An ant colony algorithm for the multi-compartment vehicle routing problem

We demonstrate the use of Ant Colony System (ACS) to solve the capacitated vehicle routing problem associated with collection of recycling waste from households, treated as nodes in a spatial network. For networks where the nodes are concentrated in separate clusters, the use of k-means clustering can greatly improve the efficiency of the solution. The ACS algorithm is extended to model the use of multi-compartment vehicles with kerbside sorting of waste into separate compartments for glass, paper, etc. The algorithm produces high-quality solutions for two-compartment test problems.

[1]  Paolo Toth,et al.  Vehicle routing: historical perspective and recent contributions , 2013, EURO J. Transp. Logist..

[2]  Alexander Popov,et al.  Routing Optimization for Waste Management , 2005, Interfaces.

[3]  Kay Chen Tan,et al.  A Hybrid Multiobjective Evolutionary Algorithm for Solving Vehicle Routing Problem with Time Windows , 2003, Comput. Optim. Appl..

[4]  Samuel J. Raff,et al.  Routing and scheduling of vehicles and crews : The state of the art , 1983, Comput. Oper. Res..

[5]  Patrick R. McMullen,et al.  Ant colony optimization techniques for the vehicle routing problem , 2004, Adv. Eng. Informatics.

[6]  Katerina Papatzelou,et al.  Optimal solid waste collection routes identified by the ant colony system algorithm , 2007, Waste management & research : the journal of the International Solid Wastes and Public Cleansing Association, ISWA.

[7]  M. Salomon,et al.  Reconsidering the distribution structure of gasoline products for a large oil company , 1995 .

[8]  V. KARADIMAS,et al.  URBAN SOLID WASTE COLLECTION AND ROUTING : THE ANT COLONY STRATEGIC APPROACH , 2005 .

[9]  Manuel López-Ibáñez,et al.  Ant colony optimization , 2010, GECCO '10.

[10]  Keivan Ghoseiri,et al.  Multi-objective vehicle routing problem with time windows using goal programming and genetic algorithm , 2010, Appl. Soft Comput..

[11]  Guo H. Huang,et al.  Planning of municipal solid waste management under dual uncertainties , 2010, Waste management & research : the journal of the International Solid Wastes and Public Cleansing Association, ISWA.

[12]  Marianne Jahre.  Logistics Systems for Recycling - Efficient Collection of Household Waste , 1995 .

[13]  Summer School in Combinatorial Optimization , 1978 .

[14]  S Mazzeo,et al.  AN ANT COLONY ALGORITHM FOR THE CAPACITATED VEHICLE ROUTING PROBLEM , 2004 .

[15]  Beatrice M. Ombuki-Berman,et al.  Multi-Objective Genetic Algorithms for Vehicle Routing Problem with Time Windows , 2006, Applied Intelligence.

[16]  Richard F. Hartl,et al.  D-Ants: Savings Based Ants divide and conquer the vehicle routing problem , 2004, Comput. Oper. Res..

[17]  Ibrahim H. Osman,et al.  Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem , 1993, Ann. Oper. Res..

[18]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem , 1991 .

[19]  Abdellah El-Fallahi,et al.  A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem , 2008, Comput. Oper. Res..

[20]  Pasquale Avella,et al.  Solving a fuel delivery problem by heuristic and exact approaches , 2004, Eur. J. Oper. Res..

[21]  Luc Muyldermans,et al.  On the benefits of co-collection: Experiments with a multi-compartment vehicle routing algorithm , 2010, Eur. J. Oper. Res..

[22]  Irene Loiseau,et al.  An Ant Colony Algorithm for the Capacitated Vehicle Routing , 2004, Electron. Notes Discret. Math..

[23]  David Pisinger,et al.  A general heuristic for vehicle routing problems , 2007, Comput. Oper. Res..

[24]  D. Brynn Hibbert,et al.  Hybrid genetic algorithms , 2003 .

[25]  Christian Prins,et al.  A simple and effective evolutionary algorithm for the vehicle routing problem , 2004, Comput. Oper. Res..

[26]  Rajasooriyar Partheepan.  Hybrid Genetic Algorithms , 2004 .

[27]  Richard F. Hartl,et al.  An improved Ant System algorithm for theVehicle Routing Problem , 1999, Ann. Oper. Res..

[28]  Joaquín Bautista,et al.  Ant Algorithms for Urban Waste Collection Routing , 2004, ANTS Workshop.

[29]  Lixin Tang,et al.  A new hybrid ant colony optimization algorithm for the vehicle routing problem , 2009, Pattern Recognit. Lett..

[30]  Enrique Alba,et al.  Applied Soft Computing a Comparative Study between Dynamic Adapted Pso and Vns for the Vehicle Routing Problem with Dynamic Requests , 2022 .

[31]  Ziauddin Ursani,et al.  Localized genetic algorithm for vehicle routing problem with time windows , 2011, Appl. Soft Comput..

[32]  Karl F. Doerner,et al.  A Savings Based Ant System For The Vehicle Routing Problem , 2002, GECCO.

[33]  Paolo Toth,et al.  The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.

[34]  Barbara Webb,et al.  Swarm Intelligence: From Natural to Artificial Systems , 2002, Connect. Sci..

[35]  Xiaolei Ma,et al.  Vehicle Routing Problem , 2013 .

[36]  Emmanuel D. Chajakis,et al.  Scheduling Deliveries in Vehicles with Multiple Compartments , 2003, J. Glob. Optim..

[37]  Barrie M. Baker,et al.  A genetic algorithm for the vehicle routing problem , 2003, Comput. Oper. Res..

[38]  Éric D. Taillard,et al.  Parallel iterative search methods for vehicle routing problems , 1993, Networks.

[39]  Dario Coltorti,et al.  Ant colony optimization for real-world vehicle routing problems , 2007, SEVO.

[40]  Nicos Christofides,et al.  An Algorithm for the Vehicle-dispatching Problem , 1969 .

[41]  Maria Grazia Speranza,et al.  The application of a vehicle routing model to a waste-collection problem: two case studies , 2002, J. Oper. Res. Soc..