Vehicle routing-scheduling for municipal waste collection system under the "Keep Trash off the Ground" policy

This paper investigates the waste collection problem and characterizes the problem as a set-covering and vehicle routing problem (VRP) complicated by inter-arrival time constraints. The study proposes a bi-level optimization formulation to model the split delivery VRP with multiple trips to determine the minimum-distance route. The first stage optimally plans the collection points that cover all residential blocks. The second stage applies a heuristics method to solve the minimum vehicles used and minimum distance traveled for collecting residential waste. This research contributes to model this period VRP and to introduce the heuristics method to solve the problem efficiently. The study is important in laying the groundwork for understanding the possibility of improving the service level of municipal solid waste collection.

[1]  Benjamin Lev,et al.  A branching method for the fixed charge transportation problem , 2010 .

[2]  Jacques Desrosiers,et al.  VRP with Pickup and Delivery , 2000, The Vehicle Routing Problem.

[3]  Ching-Jung Ting,et al.  A multiple ant colony optimization algorithm for the capacitated location routing problem , 2013 .

[4]  John E. Bell,et al.  A location analysis approach for military maintenance scheduling with geographically dispersed service areas , 2009 .

[5]  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.

[6]  Denis Borenstein,et al.  Truck scheduling for solid waste collection in the City of Porto Alegre, Brazil ☆ , 2008 .

[7]  Paolo Toth,et al.  Models, relaxations and exact approaches for the capacitated vehicle routing problem , 2002, Discret. Appl. Math..

[8]  José-Manuel Belenguer,et al.  A cutting plane algorithm for the capacitated arc routing problem , 2003, Comput. Oper. Res..

[9]  Robert A. Russell,et al.  A multiphase approach to the period routing problem , 1991, Networks.

[10]  Tobias Schoenherr,et al.  Improving routing and scheduling decisions at a distributor of industrial gasses , 2009 .

[11]  Angus R. Simpson,et al.  Parametric study for an ant algorithm applied to water distribution system optimization , 2005, IEEE Transactions on Evolutionary Computation.

[12]  T. Bektaş.  The multiple traveling salesman problem: an overview of formulations and solution procedures , 2006 .

[13]  Ted K. Ralphs,et al.  Parallel branch and cut for capacitated vehicle routing , 2003, Parallel Comput..

[14]  Rakesh Nagi,et al.  Scheduling to minimize stringer utilization for continuous annealing operations , 2012 .

[15]  Richard F. Hartl,et al.  Applying the ANT System to the Vehicle Routing Problem , 1999 .

[16]  Werner Z. Hirsch,et al.  Cost Functions of an Urban Government Service: Refuse Collection , 1965 .

[17]  P. U. Asnani.  SOLID WASTE MANAGEMENT , 2006 .

[18]  Nicos Christofides,et al.  The period routing problem , 1984, Networks.

[19]  Moshe Dror,et al.  Vehicle routing with split deliveries , 1994, Discret. Appl. Math..

[20]  Moshe Dror,et al.  Savings by Split Delivery Routing , 1989, Transp. Sci..

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

[22]  Luca Maria Gambardella,et al.  MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows , 1999 .

[23]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[24]  J. Bautista,et al.  Modeling the problem of locating collection areas for urban waste management. An application to the metropolitan area of Barcelona , 2006 .

[25]  Lawrence Bodin,et al.  Using mixed integer programming for solving the capacitated arc routing problem with vehicle/site dependencies with an application to the routing of residential sanitation collection vehicles , 2006, Ann. Oper. Res..

[26]  Bruce L. Golden,et al.  An improved heuristic for the period vehicle routing problem , 1995, Networks.

[27]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[28]  Lawrence Bodin,et al.  Capacitated Arc Routing Problem with Vehicle-Site Dependencies: The Philadelphia Experience , 2001, The Vehicle Routing Problem.

[29]  Joaquín Bautista,et al.  Solving an urban waste collection problem using ants heuristics , 2008, Comput. Oper. Res..

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

[31]  J. Agunwamba,et al.  Analysis of Scavengers’ Activities and Recycling in Some Cities of Nigeria , 2003, Environmental management.

[32]  F. Altiparmak,et al.  The location-routing problem with simultaneous pickup and delivery: Formulations and a heuristic approach , 2012 .

[33]  D. Sculli,et al.  Scheduling Vehicles for Refuse Collection , 1987 .

[34]  Lawrence Bodin,et al.  Networks and vehicle routing for municipal waste collection , 1974, Networks.

[35]  Ni-Bin Chang,et al.  Minimax regret optimization analysis for a regional solid waste management system. , 2007, Waste management.

[36]  Frank Kreith,et al.  Handbook of Solid Waste Management , 2002 .

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

[38]  John E. Beasley,et al.  A heuristic algorithm for the period vehicle routing problem , 1984 .

[39]  Maria Grazia Speranza,et al.  The periodic vehicle routing problem with intermediate facilities , 2002, Eur. J. Oper. Res..

[40]  Vittorio Maniezzo.  Algorithms for large directed CARP instances: urban solid waste collection operational support , 2004 .

[41]  Dag Haugland,et al.  A tabu search heuristic for the vehicle routing problem with time windows and split deliveries , 2004, Comput. Oper. Res..

[42]  K. Vaisakh,et al.  Evolving ant colony optimization based unit commitment , 2011, Appl. Soft Comput..

[43]  M. Dror,et al.  Split delivery routing , 1990 .