Dynamic Collection Scheduling Using Remote Asset Monitoring

Remote sensing technology is now coming onto the market in the waste collection sector. This technology allows waste and recycling receptacles to report their fill levels at regular intervals. This reporting enables collection schedules to be optimized dynamically to meet true servicing needs in a better way and so reduce transport costs and ensure that visits to clients are made in a timely fashion. This paper describes a real-life logistics problem faced by a leading UK charity that services its textile and book donation banks and its high street stores by using a common fleet of vehicles with various carrying capacities. Use of a common fleet gives rise to a vehicle routing problem in which visits to stores are on fixed days of the week with time window constraints and visits to banks (fitted with remote fill-monitoring technology) are made in a timely fashion so that the banks do not become full before collection. A tabu search algorithm was developed to provide vehicle routes for the next day of operation on the basis of the maximization of profit. A longer look-ahead period was not considered because donation rates to banks are highly variable. The algorithm included parameters that specified the minimum fill level (e.g., 50%) required to allow a visit to a bank and a penalty function used to encourage visits to banks that are becoming full. The results showed that the algorithm significantly reduced visits to banks and increased profit by up to 2.4%, with the best performance obtained when the donation rates were more variable.

[1]  Nicolas Jozefowiez,et al.  The vehicle routing problem: Latest advances and new challenges , 2007 .

[2]  Christos D. Tarantilis,et al.  A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows , 2008, J. Heuristics.

[3]  Roberto Baldacci,et al.  A unified exact method for solving different classes of vehicle routing problems , 2009, Math. Program..

[4]  Alessandro Giusti,et al.  Early detection and evaluation of waste through sensorized containers for a collection monitoring application. , 2009, Waste management.

[5]  Alessandro Persona,et al.  Waste collection multi objective model with real time traceability data. , 2011, Waste management.

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

[7]  Zhuo Fu,et al.  A Variable Neighborhood Tabu Search Algorithm for the Heterogeneous Fleet Vehicle Routing Problem with Time Windows , 2010, 2010 International Conference on Logistics Engineering and Intelligent Transportation Systems.

[8]  Ola M Johansson,et al.  The effect of dynamic scheduling and routing in a solid waste management system. , 2006, Waste management.

[9]  Hande Yaman Formulations and Valid Inequalities for the Heterogeneous Vehicle Routing Problem , 2006, Math. Program..

[10]  Michel Gendreau,et al.  Diversion Issues in Real-Time Vehicle Dispatching , 2000, Transp. Sci..

[11]  Sara Ceschia,et al.  Tabu search techniques for the heterogeneous vehicle routing problem with time windows and carrier-dependent costs , 2011, J. Sched..

[12]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[13]  M. Garey Johnson: computers and intractability: a guide to the theory of np- completeness (freeman , 1979 .

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

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

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

[17]  Harold Krikke,et al.  Low-frequency collection of materials disassembled from end-of-life vehicles: On the value of on-line monitoring in optimizing route planning , 2008 .

[18]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[19]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[20]  Maria Grazia Speranza,et al.  Short Term Strategies for a Dynamic Multi-Period Routing Problem , 2009 .

[21]  Gilbert Laporte,et al.  Fifty Years of Vehicle Routing , 2009, Transp. Sci..

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

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

[24]  Dirk Van Oudheusden,et al.  The Multiconstraint Team Orienteering Problem with Multiple Time Windows , 2010, Transp. Sci..

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

[26]  José Brandão,et al.  A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem , 2011, Comput. Oper. Res..

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