Abstract
In this chapter, we illustrate the use of discrete event simulation to evaluate how dynamic planning methodologies can be best applied for the collection of waste from underground containers. We present a case study that took place at the waste collection company Twente Milieu, located in The Netherlands. Even though the underground containers are already equipped with motion sensors, the planning of container emptying’s is still based on static cyclic schedules. It is expected that the use of a dynamic planning methodology, that employs sensor information, will result in a more efficient collection process with respect to customer satisfaction, profits, and CO2 emissions. In this research we use simulation to (i) evaluate the current planning methodology, (ii) evaluate various dynamic planning possibilities, (iii) quantify the benefits of switching to a dynamic collection process, and (iv) quantify the benefits of investing in fill-level sensors. After simulating all scenarios, we conclude that major improvements can be achieved, both with respect to logistical costs as well as customer satisfaction.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Andersson, H., Hoff, A., Christiansen, M., Hasle, G., Løkketangen, A.: Industrial aspects and literature survey: Combined inventory management and routing. Computers & Operations Research 37(9), 1515–1536 (2010)
Angelelli, E., Bianchessi, N., Mansini, R., Speranza, M.G.: Short term strategies for a dynamic multi-period routing problem. Transportation Research Part C 17(2), 106–119 (2009)
Engelelli, E., Speranza, M.G., Savelsbergh, M.W.P.: Competitive analysis for dynamic multi-period uncapacitated routing problems. Networks 49(4), 308–317 (2007)
Beltrami, E.J., Bodin, L.D.: Networks and Vehicle Routing for Municipal Waste Collection. Networks 4, 9–32 (1974)
Berbeglia, G., Cordeau, J.F., Laporte, G.: Dynamic pickup and delivery problems. European Journal of Operational Research 202(1), 8–15 (2010)
Campbell, A., Clarke, L., Kleywegt, A., Savelsbergh, M.: Inventory routing. In: Crainic, T., Laporte, G. (eds.) Fleet Management and Logistics. Kluwer Academic Publishers, Boston (1998)
Campbell, A.M., Savelsbergh, M.: Efficient insertion heuristics for vehicle routing and scheduling problems. Transportation Science 38, 369–378 (2004)
Chalkias, C., Lasaridi, K.: A GIS based model for the optimisation of municipal solid waste collection: the case study of Nikea, Athens, Greece. WSEAS Transactions on Environment and Development 10(5), 640–650 (2009)
Chang, N.B., Wei, Y.: Comparative study between the heuristic algorithm and the optimization technique for vehicle routing and scheduling in a solid waste collection system. Civil Engineering and Environmental Systems 19(10), 41–65 (2002)
Chao, I.M., Golden, B., Wasil, E.: An improved heuristic for the period vehicle routing problem. Networks 26, 25–44 (1995)
Cordeau, J.F., Gendreau, M., Laporte, G.: A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks 30(2), 105–119 (1997)
Dantzig, G.B., Ramser, J.H.: The Truck Dispatching Problem. Management Science 6(1), 80–91 (1959)
Francis, P.M., Smilowitz, K.R., Tzur, M.: The Period Vehicle Routing Problem with Service Choice. Transportation Science 40(4), 439–454 (2006)
Francis, P.M., Smilowitz, K.R., Tzur, M.: The period vehicle routing problem and its extensions. In: Golden, B.L., Raghavan, S., Wasil, E.A. (eds.) The Vehicle Routing Problem: Latest Advances and New Challenges, pp. 73–102. Springer, New York (2008)
Golden, B., Assad, A., Dahl, R.: Analysis of a large scale vehicle routing problem with an inventory component. Large Scale Systems 7(2-3), 181–190 (1984)
Golden, B., Raghavan, S., Wasil, E.: The Vehicle Routing Problem: Latest Advances and New Challenges. Springer, New York (2008)
Jaillet, P., Huang, L., Bard, J.F., Dror, M.: A rolling horizon framework for the inventory routing problem. Working paper. University of Texas, Austin (1997)
Johansson, O.M.: The effect of dynamic scheduling and routing in a solid waste management system. Waste Management 26(8), 875–885 (2006)
Jozefowiez, N., Semet, F., Talbi, E.G.: Multi-objective vehicle routing problems. European Journal of Operational Research 189(2), 293–309 (2008)
Karadimas, N.V., Papatzelou, K., Loumos, V.G.: Optimal solid waste collection routes identified by the ant colony system algorithm. Waste Management & Research 25(2), 139–147 (2007)
Kim, B.I., Kim, S., Sahoo, S.: Waste collection vehicle routing problem with time windows. Computers and Operations Research 33(12), 3624–3642 (2006)
Lacomme, P., Prins, C., Sevaux, M.: A genetic algorithm for a bi-objective capacitated arc routing problem. Computers & Operations Research 33(12), 3473–3493 (2006)
Larsen, A., Madsen, O.B.G., Solomon, M.M.: Recent developments in dynamic vehicle routing systems. In: Golden, B.L., Raghavan, S., Wasil, E.A. (eds.) The Vehicle Routing Problem: Latest Advances and New Challenges, pp. 199–218. Springer, New York (2008)
Law, A.: Simulation Modeling and Analysis, 4th edn. McGraw-Hill, New York (2007)
McLeod, F., Cherrett, T.: Quantifying the transport impacts of domestic waste collection strategies. Waste Management 28(11), 2271–2278 (2008)
Mes, M.R.K., Powell, W.B., Frazier, P.I.: Hierarchical Knowledge Gradient for Sequential Sampling. Journal of Machine Learning Research 12, 2931–2974 (2011)
Mourgaya, M., Vanderbeck, F.: Column generation based heuristic for tactical planning in multi-period vehicle routing. European Journal of Operational Research 183(3), 1028–1041 (2007)
Newman, A.M., Yano, C.A., Kaminsky, P.M.: Third party logistics planning with routing and inventory costs. In: Geunes, J., Pardalos, P.M. (eds.) Supply Chain Optimization. Springer, New York (2005)
Nuortio, T., Kytöjoki, J., Niska, H., Bräysy, O.: Improved route planning and scheduling of waste collection and transport. Expert Systems with Applications 30(2), 223–232 (2006)
Pacheco, J., MartĂ, R.: Tabu search for a multi-objective routing problem. Journal of the Operational Research Society 57(1), 29–37 (2007)
Plant Simulation (2011), http://www.plm.automation.siemens.com/
Russell, R.A., Igo, W.: An Assignment Routing Problem. Networks 9, 1–17 (1979)
Tan, K.C., Chew, Y.H., Lee, L.H.: A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems. European Journal of Operational Research 172(3), 855–885 (2006)
Toth, P., Vigo, D.: The Vehicle Routing Problem. SIAM, Philadelphia (2001)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer Berlin Heidelberg
About this chapter
Cite this chapter
Mes, M. (2012). Using Simulation to Assess the Opportunities of Dynamic Waste Collection. In: Bangsow, S. (eds) Use Cases of Discrete Event Simulation. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28777-0_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-28777-0_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-28776-3
Online ISBN: 978-3-642-28777-0
eBook Packages: EngineeringEngineering (R0)