Ant_VRP: ant-colony-based meta-heuristic algorithm to solve the vehicle routing problem
by Majid Nikougoftar Nategh; Ali Asghar Rahmani Hosseinabadi; Valentina Emilia Balas
International Journal of Advanced Intelligence Paradigms (IJAIP), Vol. 11, No. 3/4, 2018

Abstract: Vehicle routing problem is one of the most important combinatorial optimisation problems and is very important for researchers and scientists today. In this kind of problems, the aim is to determine the minimum cost needed to move the vehicles, which start simultaneously from the warehouse and returned to it after visiting customers. There are two constraints for costumers and vehicles, first, each node must be visited by only one vehicle and second, each vehicle must not load more than its capacity. In this paper, a combination of ant colony algorithm and mutation operation named Ant_VRP is proposed to solve the vehicle routing problem. The performance of the algorithm is demonstrated by comparing with other heuristic and meta-heuristic approaches.

Online publication date: Mon, 08-Oct-2018

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 Advanced Intelligence Paradigms (IJAIP):
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