Solving capacitated vehicle routing problem with route optimisation based on equilibrium optimiser algorithm
by Ibrahim Fares; Aboul Ella Hassanien; Rizk M. Rizk-Allah; Roushdy Mohamed Farouk; Hassan Mostafa Abo-donia
International Journal of Computing Science and Mathematics (IJCSM), Vol. 17, No. 1, 2023

Abstract: In this paper, we have presented an optimising approach based on equilibrium optimiser (EO) algorithm for solving the capacitated vehicle routing problem (CVRP). The CVRP is considered one of the NP-hard combinatorial optimisation problems and most of algorithms failed to reach optimality in these problems. The EO algorithm is a powerful technique in solving several combinatorial optimisation problems. The performance of the EO algorithm compared with the artificial bee colony algorithm, the particle swarm optimisation algorithm, and the whale optimisation algorithm. The computational results obtained for the CVRP model illustrate the power of the EO algorithm over the competitor algorithms.

Online publication date: Thu, 20-Apr-2023

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computing Science and Mathematics (IJCSM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com