Efficiency of Heuristic Algorithms in Solving Waste Collection Vehicle Routing Problem: A Case Study

This paper investigated the efficiency of six heuristic algorithms from prior studies in the attempt to solve issues related to waste collection, namely: (i) Nearest Greedy (NG), (ii) Further from Depot (FFD), (iii) Different Initial Customer (DIC), (iv) Savings Approach, (v) Sweep Algorithm, and (vi) Different Initial Customer based on Sweep Algorithm. In fact, these heuristics have been employed to solve several routing problems in past studies, but the performance of each heuristic has never been compared. Hence, this paper looked into the efficiency of these heuristics by testing them on a real case study of waste collection problem in a district located at the north of Peninsular Malaysia. Several solutions obtained from these heuristics were compared with solutions implemented by the waste collection company, especially in terms of the total distance travelled. As a result, the computational results exhibited that DIC generated the best solutions, when compared to other heuristics, with a 12% reduction of the total travel distance.

[1]  Paolo Toth,et al.  Vehicle Routing , 2014, Vehicle Routing.

[2]  A. M. Benjamin,et al.  Metaheuristics for the waste collection vehicle routing problem with time windows , 2011 .

[3]  David Pisinger,et al.  An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows , 2006, Transp. Sci..

[4]  Imma Ribas,et al.  An iterated greedy algorithm for the flowshop scheduling problem with blocking , 2011 .

[5]  Juan José Salazar González,et al.  Heuristics for the One-Commodity Pickup-and-Delivery Traveling Salesman Problem , 2004, Transp. Sci..

[6]  Burak Eksioglu,et al.  The vehicle routing problem: A taxonomic review , 2009, Comput. Ind. Eng..

[7]  George Tchobanoglous,et al.  Integrated Solid Waste Management: Engineering Principles and Management Issues , 1993 .

[8]  Ángel Corberán,et al.  Separating capacity constraints in the CVRP using tabu search , 1998, Eur. J. Oper. Res..

[9]  David P. Williamson,et al.  Greedy algorithms for the single-demand facility location problem , 2017, Oper. Res. Lett..

[10]  Byung-In Kim,et al.  Waste collection vehicle routing problem with time windows using multi-objective genetic algorithms , 2007 .

[11]  M A Hannan,et al.  Capacitated vehicle-routing problem model for scheduled solid waste collection and route optimization using PSO algorithm. , 2018, Waste management.

[12]  James R. Evans,et al.  Heuristic methods and applications: A categorized survey , 1989 .

[13]  Xiao Liu,et al.  Two-phase heuristic algorithms for full truckloads multi-depot capacitated vehicle routing problem in carrier collaboration , 2010, Comput. Oper. Res..

[14]  Antoni Wibowo,et al.  Nearest greedy for solving the waste collection vehicle routing problem: A case study , 2017 .

[15]  J. Ben Atkinson,et al.  A Greedy Look-ahead Heuristic for Combinatorial Optimization: An Application to Vehicle Scheduling with Time Windows , 1994 .

[16]  Korhan Karabulut,et al.  A variable iterated greedy algorithm for the traveling salesman problem with time windows , 2014, Inf. Sci..

[17]  Robert M. Clark,et al.  Analysis of Solid Waste Management Operations in Cleveland, Ohio: A Case Study , 1975 .

[18]  Magdalene Marinaki,et al.  A hybrid genetic - Particle Swarm Optimization Algorithm for the vehicle routing problem , 2010, Expert Syst. Appl..

[19]  Angel A. Juan,et al.  A Biased-Randomized Heuristic for the Waste Collection Problem in Smart Cities , 2015 .

[20]  Susan H. Xu,et al.  Greedy algorithm for the general multidimensional knapsack problem , 2007, Ann. Oper. Res..

[21]  Billy E. Gillett,et al.  A Heuristic Algorithm for the Vehicle-Dispatch Problem , 1974, Oper. Res..

[22]  LysgaardJens,et al.  A new branch-and-cut algorithm for the capacitated vehicle routing problem , 2004 .

[23]  Liesje De Boeck,et al.  Municipal Solid Waste Collection and Management Problems: A Literature Review , 2014, Transp. Sci..

[24]  George Ioannou,et al.  A greedy look-ahead heuristic for the vehicle routing problem with time windows , 2001, J. Oper. Res. Soc..

[25]  Kris Braekers,et al.  The vehicle routing problem: State of the art classification and review , 2016, Comput. Ind. Eng..

[26]  A. M. Benjamin,et al.  Metaheuristics with disposal facility positioning for the waste collection VRP with time windows , 2013, Optim. Lett..

[27]  Nur Azriati Mat,et al.  ENHANCED HEURISTIC ALGORITHMS WITH A VEHICLE TRAVEL SPEED MODEL FOR TIME-DEPENDENT VEHICLE ROUTING : A WASTE COLLECTION PROBLEM , 2018 .

[28]  Michel Gendreau,et al.  A shortest path-based algorithm for the inventory routing problem of waste vegetable oil collection , 2018, J. Oper. Res. Soc..

[29]  Erik Demeulemeester,et al.  A model enhancement approach for optimizing the integrated shift scheduling and vehicle routing problem in waste collection , 2018, Eur. J. Oper. Res..

[30]  G. Clarke,et al.  Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .