An Efficient Solution for the VRP by Using a Hybrid Elite Ant System
AbstractThe vehicle routing problem (VRP) is a well-known NP-Hard problemin operation research which has drawn enormous interest from many researchers duringthe last decades because of its vital role in planning of distribution systems andlogistics. This article presents a modified version of the elite ant system (EAS) algorithmcalled HEAS for solving the VRP. The new version mixed with insert and swapalgorithms utilizes an effective criterion for escaping from the local optimum points.In contrast to the classical EAS, the proposed algorithm uses only a global updatingwhich will increase pheromone on the edges of the best (i.e. the shortest) route andwill at the same time decrease the amount of pheromone on the edges of the worst(i.e. the longest) route. The proposed algorithm was tested using fourteen instancesavailable from the literature and their results were compared with other well-knownmeta-heuristic algorithms. Results show that the suggested approach is quite effectiveas it provides solutions which are competitive with the best known algorithms in theliterature.
 Yousefikhoshbakht, M., Didehvar, F. and Rahmati, F. (2014). A Combination of Modified Tabu Search and Elite Ant System to Solve the Vehicle Routing Problem with Simultaneous Pickup and Delivery, Journal of Industrial and Production Engineering, 31(2): 65-75.
 Hong, L. (2012). An improved LNS algorithm for real-time vehicle routing problem with time windows, Computers and Operations Research, 39(2):151-163.
 Yousefikhoshbakht, M., F. Didehvar, and F. Rahmati, (2013). Solving the heterogeneous fixed fleet open vehicle routing problem by a combined metaheuristic algorithm, International Journal of Production Research
 Toth, P. and Vigo, D. (1997). An exact algorithm for the vehicle routing problem with backhauls, Transportation Science, 31:372-385.
 Pop P.C., Sitar C.P., Zelina I., Lupse V. and Chira C. (2011)., Heuristic Algorithms for Solving the Generalized Vehicle Routing Problem, International Journal of Computers Communications & Control, ISSN 1841-9836, 6(1): 158-165.
 Valle, C. A., Martinez, L. C. and Cunha, A. S., Mateus, G. R. (2011). Heuristic and exact algorithms for a min-max selective vehicle routing problem, Computers and Operations Research, 38(7):1054-1065.
 Brad, J., Kontoravdis, G. and Yu, G. (2002). A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows. Transportation Science, 36(2):250-269.
 Clarke, G. and Wright, J. W. (1964). Scheduling of vehicles from a central depot to a number of delivery points. Operations Research, 12: 568-581.
 Gillett, B. E. and Miller, L. R. (1974). A heuristic algorithm for the vehicle dispatch problem. Operations Research, 22: 340-349.
 Osman, I. (1993). Metastrategy simulated annealing and Tabu search algorithms for the vehicle routing problem, Operations Research, 41: 421-451.
 Baker, B., and Ayechew, M. (2003). A genetic algorithm for the vehicle routing problem, Computers and Operations Research, 30: 787-800.
 Hirota, K., Dong, F. and Chen, K. (2006), A Computational Intelligence Approach to VRSDP (Vehicle Routing, Scheduling, and Dispatching Problems), International Journal of Computers Communications & Control, ISSN 1841-9836, Suppl. issue, 1(S): 53-60,
 Zhang, X. and Tang, L. (2009). A new hybrid ant colony optimization algorithm for the vehicle routing problem, Pattern Recognition Letters, 30(152): 848-855.
 Negulescu S.C., Kifor C.V. and Oprean C. (2008). Ant Colony Solving Multiple Constraints Problem: Vehicle Route Allocation, International Journal of Computers Communications & Control, ISSN 1841-9836, 3(4):366-373.
 Ai, J., Kachitvichyanukul, V. (2009). Particle swarm optimization and two solution representations for solving the capacitated vehicle routing problem, Computers and Industrial Engineering, 56:380-387.
 Pintea C.-M., Chira C., Dumitrescu D. and Pop P.C. (2011). Sensitive Ants in Solving the Generalized Vehicle Routing Problem, International Journal of Computers Communications & Control, ISSN 1841-9836, 6(4):734-741.
 Yousefikhoshbakht, M., Didehvar, F. and Rahmati, F. (2013). Modification of the Ant Colony Optimization for Solving the Multiple Traveling Salesman Problem, Romanian Journal of Information Science and Technology, 16(1):65-80.
 Yousefikhoshbakht, M. and Sedighpour, M. (2012). A Combination of Sweep Algorithm and Elite Ant Colony Optimization for Solving the Multiple Traveling Salesman Problem, Proceedings of the Romanian academy, A, 13(4):295-302.
 Marinakis, Y. and Marinaki, M. (2010). A hybrid genetic-particle swarm optimization algorithm for the vehicle routing problem, Expert Systems with Applications, 37(33):1146-1455.
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
ONLINE OPEN ACCES: Acces to full text of each article and each issue are allowed for free in respect of Attribution-NonCommercial 4.0 International (CC BY-NC 4.0.
You are free to:
-Share: copy and redistribute the material in any medium or format;
-Adapt: remix, transform, and build upon the material.
The licensor cannot revoke these freedoms as long as you follow the license terms.
DISCLAIMER: The author(s) of each article appearing in International Journal of Computers Communications & Control is/are solely responsible for the content thereof; the publication of an article shall not constitute or be deemed to constitute any representation by the Editors or Agora University Press that the data presented therein are original, correct or sufficient to support the conclusions reached or that the experiment design or methodology is adequate.