Improved route planning and scheduling of waste collection and transport

The collection of waste is a highly visible and important municipal service that involves large expenditures. Waste collection problems are, however, one of the most difficult operational problems to solve. This paper describes the optimization of vehicle routes and schedules for collecting municipal solid waste in Eastern Finland. The solutions are generated by a recently developed guided variable neighborhood thresholding metaheuristic that is adapted to solve real-life waste collection problems. Several implementation approaches to speed up the method and cut down the memory usage are discussed. A case study on the waste collection in two regions of Eastern Finland demonstrates that significant cost reductions can be obtained compared with the current practice.

[1]  Martin W. P. Savelsbergh,et al.  The Vehicle Routing Problem with Time Windows: Minimizing Route Duration , 1992, INFORMS J. Comput..

[2]  Shen Lin.  Computer solutions of the traveling salesman problem , 1965 .

[3]  Susana Baptista,et al.  A period vehicle routing case study , 2002, Eur. J. Oper. Res..

[4]  Michel Gendreau,et al.  Arc Routing Problems, Part II: The Rural Postman Problem , 1995, Oper. Res..

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

[6]  Maria Cândida Mourão,et al.  Lower-bounding and heuristic methods for a refuse collection vehicle routing problem , 2000, Eur. J. Oper. Res..

[7]  P A Koushki,et al.  Collection and transportation cost of household solid waste in Kuwait. , 2004, Waste management.

[8]  Gerrit Janssens,et al.  Fleet size determination for waste oil collection in the province of Antwerp , 1993 .

[9]  Gerhard W. Dueck,et al.  Threshold accepting: a general purpose optimization algorithm appearing superior to simulated anneal , 1990 .

[10]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[11]  Moshe Dror,et al.  Vehicle Routing with Stochastic Demands: Properties and Solution Frameworks , 1989, Transp. Sci..

[12]  Roberto Baldacci,et al.  The Rollon-Rolloff Vehicle Routing Problem , 2000, Transp. Sci..

[13]  Michel Gendreau,et al.  Vehicle Routing Problem with Time Windows, Part II: Metaheuristics , 2005, Transp. Sci..

[14]  Jean-Yves Potvin,et al.  An Exchange Heuristic for Routeing Problems with Time Windows , 1995 .

[15]  Riccardo Minciardi,et al.  A new procedure to plan routing and scheduling of vehicles for solid waste collection at a metropolitan scale , 2002 .

[16]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[17]  António Pais Antunes,et al.  Recyclable waste collection planning--a case study , 2004, Eur. J. Oper. Res..

[18]  Gilbert Laporte,et al.  Arc Routing Problems, Part I: The Chinese Postman Problem , 1995, Oper. Res..

[19]  Pierre Hansen,et al.  Variable Neighbourhood Search , 2003 .

[20]  Ni-Bin Chang,et al.  GIS Technology for Vehicle Routing and Scheduling in Solid Waste Collection Systems , 1997 .

[21]  Michel Gendreau,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows , 1997, Transp. Sci..

[22]  S K Amponsah,et al.  The investigation of a class of capacitated arc routing problems: the collection of garbage in developing countries. , 2004, Waste management.

[23]  Gilbert Laporte,et al.  STOCHASTIC VEHICLE ROUTING. , 1996 .

[24]  Gregory Gutin,et al.  The traveling salesman problem , 2006, Discret. Optim..

[25]  R. Álvarez-Valdés,et al.  ARC A computerized system for urban garbage collection , 1993 .

[26]  BräysyOlli,et al.  Vehicle Routing Problem with Time Windows, Part II , 2005 .

[27]  Larry W. Jacobs,et al.  Scheduling collection of recyclable material at Northern Illinois University campus using a two-phase algorithm , 1998 .

[28]  Li-Hsing Shih,et al.  A Routing and Scheduling System for Infectious Waste Collection , 2001 .

[29]  Michel Gendreau,et al.  Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms , 2005, Transp. Sci..

[30]  Thierry Kulcar,et al.  Optimizing solid waste collection in Brussels , 1996 .

[31]  Michel Gendreau,et al.  A Survey of Heuristics for the Vehicle Routing Problem Part II: Demand Side Extensions , 2008 .

[32]  Bruce L. Golden,et al.  Routing Vehicles in the Real World: Applications in the Solid Waste, Beverage, Food, Dairy, and Newspaper Industries , 2002, The Vehicle Routing Problem.

[33]  Katrina Smith Korfmacher,et al.  Solid Waste Collection Systems in Developing Urban Areas of South Africa: an Overview and Case Study , 1997 .

[34]  M. M. Flood.  The Traveling-Salesman Problem , 1956 .

[35]  Roberto Aringhieri,et al.  A particular Vehicle Routing Problem arising in the collection and disposal of special waste , 2004 .

[36]  Donald D. Eisenstein,et al.  Garbage Collection in Chicago: A Dynamic Scheduling Model , 1997 .

[37]  L. De Meulemeester,et al.  Optimal sequencing of skip collections and deliveries , 1997 .

[38]  Thong Ngee Goh,et al.  A computerised vehicle routing system for refuse collection , 1990 .

[39]  Dang Vu Tung,et al.  Vehicle routing-scheduling for waste collection in Hanoi , 2000, Eur. J. Oper. Res..

[40]  M. Dror.  Arc Routing : Theory, Solutions and Applications , 2000 .

[41]  Hoong Chuin Lau,et al.  Vehicle routing problem with time windows and a limited number of vehicles , 2003, Eur. J. Oper. Res..