Research on Vehicle Routing Problems Based on the Improved Pareto Ant Colony Algorithm

Xiaohui Wang

Abstract


The paper describes the problems of route optimization for logistics delivery vehicles with time window with the mathematics model being put forward as well. Then, it makes some improvement for transition probability and pheromone update strategy representing the transition strategy and puts forward the improved Pareto ant colony algorithm according to the disadvantages of ant colony algorithm which is easy to slump into local optimum when solving the problems of vehicle optimization in the logistics system. What is more, the Mat lab simulation tool is used to makes simulation of IPACA. It also verifies the effectiveness of skills used by IPACA to improve the disadvantages of ant colony algorithm which is easy to slump into local optimum when solving the problems of vehicle optimization in the logistics system after comparing one experimental data to the simulation results of three algorithms and comparing one experimental data to the simulation results of two algorithms.


Full Text:

PDF

References


Dou Z.H. (2014). A improved pareto of ant colony algorithm to solve the vehicle routing problem with time windows, Advanced Materials Research, 1032, 1941-1944.

Li L.Y. (2014). The application of an improved hybrid ant colony algorithm in vehicle routing optimization problem, Applied Mechanics and Materials, 562, 4693-4696.

Ming Q.C. (2013). Vehicle routing optimization in logistics distribution using hybrid ant colony algorithm, Telkomnika - Indonesian Journal of Electrical Engineering, 11(9), 5308-5315.

Petr S. (2014). Ant colony optimization algorithm for Multi-Depot Vehicle Routing Problem with Time Windows, OPT-I 2014 - 1st International Conference on Engineering and Applied Sciences Optimization, OPT-I 2014, 184-192.

Petr S. (2014). Using the Ant Colony Optimization algorithm for the Capacitated Vehicle Routing Problem, Proceedings of the 16th International Conference on Mechatronics, Mechatronika, 503-510.

Ran W.X., Liu L., Yang G.M. (2013). A hybrid ant colony algorithm for vehicle routing problem with time windows, Information Technology Journal, 12(20), 5701-5706.

Tong Z. (2008). A hybrid ant colony algorithm for the capacitated vehicle routing problem, Proceedings of 2008 IEEE International Symposium on IT in Medicine and Education, ITME 2008, 935-939.

Wang J., Wang Y.Y., Li H.Y. (2012). Improved Ant Colony Algorithm for Logistics Vehicle Routing Problem with Time Window, Communications in Computer and Information Science, 315, 41-48.

Yi Y., Kang X.D. (2015). An improved ant colony algorithm to solve vehicle routing problem with time windows, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 9225, 11-22.

Yuvraj G., Tarek E.Y. (2015). Hybridized ant colony algorithm for the Multi Compartment Vehicle Routing Problem, Applied Soft Computing Journal, 37(12), 196-203.

Yun W.H. (2013). Ant Colony Optimization and Genetic Algorithm approaches to solving the Split Delivery Vehicle Routing Problem, IIE Annual Conference and Expo 2013, IIE Annual Conference and Expo 2013, 3964-3973.


Refbacks

  • There are currently no refbacks.


Revista de la Facultad de Ingeniería,

ISSN: 2443-4477; ISSN-L:0798-4065

Edif. del Decanato de la Facultad de Ingeniería,

3º piso, Ciudad Universitaria,

Apartado 50.361, Caracas 1050-A,

Venezuela.

© Universidad Central de Venezuela