An ant colony optimization algorithm for waste collection vehicle routing with time windows, driver rest period and multiple disposal facilities
作者： Raihanul Islam , M. Sohel Rahman
DOI: 10.1109/ICIEV.2012.6317421
关键词:
摘要: In this paper we consider a real life waste collection problem that can be seen as variant of the vehicle routing with time windows. there is set clients to served, number facilities where collected must disposed off and an infinite vehicles stationed in single depot. Each client has definite window within which it served. disposal facility also used given window. Similarly, associated depot, return it. Additionally, fixed lunch period for drivers. Our goal solve using minimum minimizing total distance crossed by vehicles. paper, Ant Colony Optimization (ACO) algorithm. Experimental results indicate our algorithm provides better than previous algorithms.
sci-hub.se 参考文章(33)
Shahrear Iqbal, Md. Faizul Bari, M. Sohel Rahman, Solving the multi-dimensional multi-choice Knapsack problem with the help of ants international conference on swarm intelligence. pp. 312- 323 ,(2010) , 10.1007/978-3-642-15461-4_27
Marco Dorigo, Luca Maria Gambardella, A Study of Some Properties of Ant-Q parallel problem solving from nature. ,vol. 1141, pp. 656- 665 ,(1996) , 10.1007/3-540-61723-X_1029
Thomas Stützle, Holger H. Hoos, – Ant System Future Generation Computer Systems. ,vol. 16, pp. 889- 914 ,(2000) , 10.1016/S0167-739X(00)00043-1
Jean-Fran�ois Cordeau, Michel Gendreau, Gilbert Laporte, A tabu search heuristic for periodic and multi-depot vehicle routing problems Networks. ,vol. 30, pp. 105- 119 ,(1997) , 10.1002/(SICI)1097-0037(199709)30:2<105::AID-NET5>3.0.CO;2-G
Daniela Favaretto, Elena Moretti, Paola Pellegrini, Ant colony system for a VRP with multiple time windows and multiple visits Journal of Interdisciplinary Mathematics. ,vol. 10, pp. 263- 284 ,(2007) , 10.1080/09720502.2007.10700491
Min Kong, Peng Tian, Yucheng Kao, A new ant colony optimization algorithm for the multidimensional Knapsack problem Computers & Operations Research. ,vol. 35, pp. 2672- 2683 ,(2008) , 10.1016/J.COR.2006.12.029
Jari Kytöjoki, Teemu Nuortio, Olli Bräysy, Michel Gendreau, An efficient variable neighborhood search heuristic for very large scale vehicle routing problems Computers & Operations Research. ,vol. 34, pp. 2743- 2757 ,(2007) , 10.1016/J.COR.2005.10.010
Benoit Crevier, Jean-François Cordeau, Gilbert Laporte, THE MULTI-DEPOT VEHICLE ROUTING PROBLEM WITH INTER-DEPOT ROUTES European Journal of Operational Research. ,vol. 176, pp. 756- 773 ,(2007) , 10.1016/J.EJOR.2005.08.015
José Brandão, Alan Mercer, A tabu search algorithm for the multi-trip vehicle routing and scheduling problem European Journal of Operational Research. ,vol. 100, pp. 180- 191 ,(1997) , 10.1016/S0377-2217(97)00010-6
Vera Hemmelmayr, Karl F. Doerner, Richard F. Hartl, Stefan Rath, A heuristic solution method for node routing based solid waste collection problems Journal of Heuristics. ,vol. 19, pp. 129- 156 ,(2013) , 10.1007/S10732-011-9188-9