Quantifying the transport impacts of domestic waste collection strategies.

This paper models the effects of three different options for domestic waste collection using data from three Hampshire authorities: (i) joint working between neighbouring waste collection authorities; (ii) basing vehicles at waste disposal sites; and (iii) alternate weekly collection of residual waste and dry recyclables. A vehicle mileage savings of 3% was modelled for joint working, where existing vehicle allocations to depots were maintained, which increased to 5.9% when vehicles were re-allocated to depots optimally. Vehicle mileage was reduced by 13.5% when the collection rounds were based out of the two waste disposal sites rather than out of the existing depots, suggesting that the former could be the most effective place to keep vehicles providing that travel arrangements for the crews could be made. Alternate weekly collection was modelled to reduce vehicle mileage by around 8% and time taken by 14%, when compared with a typical scenario of weekly collection of residual and fortnightly collection of recyclable waste. These results were based on an assumption that 20% of the residual waste would be directly diverted into the dry recyclables waste stream.

[1]  Paolo Viotti,et al.  Genetic algorithms as a promising tool for optimisation of the MSW collection routes , 2003, Waste management & research : the journal of the International Solid Wastes and Public Cleansing Association, ISWA.

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

[3]  Ni-Bin Chang,et al.  Cost-effective and equitable workload operation in solid-waste management systems , 1997 .

[4]  Roberto Musmanno,et al.  The Arc Routing and Scheduling Problem with Transshipment , 2002, Transp. Sci..

[5]  Roberto Baldacci,et al.  Exact methods based on node‐routing formulations for undirected arc‐routing problems , 2006, Networks.

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

[7]  John F. Hayford What is the Center of an Area, or the Center of a Population? , 1902 .

[8]  J. Mendel Uncertain Rule-Based Fuzzy Logic Systems: Introduction and New Directions , 2001 .

[9]  Andrew Lim,et al.  Multi-depot vehicle routing problem: a one-stage approach , 2005, IEEE Transactions on Automation Science and Engineering.

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

[11]  Ni-Bin Chang,et al.  Siting recycling drop-off stations in urban area by genetic algorithm-based fuzzy multiobjective nonlinear integer programming modeling , 2000, Fuzzy Sets Syst..

[12]  Dorothea Heiss-Czedik,et al.  An Introduction to Genetic Algorithms. , 1997, Artificial Life.

[13]  Saïd Hanafi,et al.  Municipal Solid Waste Collection: An Effective Data Structure For Solving The Sectorization Problem With Local Search Methods , 1999 .

[14]  Alain Hertz,et al.  A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem , 2003, Transp. Sci..

[15]  Gilbert Laporte,et al.  Models and exact solutions for a class of stochastic location-routing problems , 1987 .

[16]  Harri Niska,et al.  Improved route planning and scheduling of waste collection and transport , 2006, Expert Syst. Appl..

[17]  Hokey Min,et al.  Combined location-routing problems: A synthesis and future research directions , 1998, Eur. J. Oper. Res..

[18]  Chinyao Low,et al.  Heuristic solutions to multi-depot location-routing problems , 2002, Comput. Oper. Res..

[19]  Ni-Bin Chang,et al.  Comparative Study between the Heuristic Algorithm and the Optimization Technique for Vehicle Routing and Scheduling in a Solid Waste Collection System , 2002 .