Analisa Performa Hybrid Ant Colony Optimization dalam Memecahkan Vehicle Routing Problem with Time Windows.

Timothy Handi Wibawa(1*), Rolly Intan(2),


(1) Program Studi Teknik Informatika
(2) Program Studi Teknik Informatika
(*) Corresponding Author

Abstract


In modern times, humans have been helped by many technological developments. One such field is the goods delivery field, called the Vehicle Routing Problem (VRP). Vehicle Routing Problem is a matter of where there is a freight fleet that has to deliver a certain amount of goods to various customers. The solution sought is the shortest route the fleet can take.

,Hybrid Ant Colony Optimization (HACO)is an algorithm that is inspired from the foraging behaviour of ant species, that is one of the result of  development for Ant Colony Optimization. HACO has been published by Q. Ding et. al in 2012 to solve Vehicle Routing Problem with Time Windows. However, in that published journal, there were vagueness in some points like process time and memory usage.

Therefore in this journal there is a need to review the performance of HACO to solve VRPTW, which will be done using unity. In this thesis is also discussed some development of HACO which are expected to fix and improve the result of HACO.

Keywords


Ant Colony Optimization; Vehicle Routing Problem with Time Windows; C#; Unity

Full Text:

PDF

References


Bell, J., & McMullen, P. 2004. Ant colony optimization techniques for the vehicle routing problem. Advanced Engineering Informatics

Bin, Y., Yang, Z., Yao, B. 2007. An improved ant colony optimization for vehicle routing problem, European Journal of Operational Research 196 171–176

Ding, Q., Hu, X., Sun, L., & Wang, Y. 2012. An improved ant colony optimization and its application to vehicle routing problem with time windows. Neurocomputing, 98, 101-107.

Mahi, M., Baykan, Ö., & Kodaz, H. 2015. A new hybrid method based on Particle Swarm Optimization, Ant Colony Optimization and 3-Opt algorithms for Traveling Salesman Problem. Applied Soft Computing, 30, 484-490.

Osman, I. 1993. Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Annals Of Operations Research, 41(4), 421-451.

Pala, O., & Aksaraylı, M. 2018. An Ant Colony Optimization Algorithm Approach for Solving Multi-objective Capacitated Vehicle Routing Problem. Alphanumeric Journal.

Reed, M., Yiannakou, A., & Evering, R. 2014. An ant colony algorithm for the multi-compartment vehicle routing problem. Applied Soft Computing, 15, 169-176.

Stutzle, T., Hoos,H. 1997. improvements on the ant system: introducing the MAX-MIN ant system. Proceedings of the International Conference on Artificial Neural Networks and Genetic Algorithms, pp 245 - 249

Ting, C., & Chen, C. 2013. A multiple ant colony optimization algorithm for the capacitated location routing problem. International Journal Of Production Economics, 141(1), 34-44

Yao, B., Yu, B., Hu, P., Gao, J., & Zhang, M. 2015. An improved particle swarm optimization for carton heterogeneous vehicle routing problem with a collection depot. Annals Of Operations Research, 242(2), 303-320.


Refbacks

  • There are currently no refbacks.


Jurnal telah terindeks oleh :