Abstract
Collecting and transporting solid waste is a constant problem for municipalities and populations in general. Waste management should take into account the preservation of the environment and the reduction of costs. The goal with this paper is to address a real-life solid waste problem. The case reveals some general and specific characteristics which are not rare, but are not widely addressed in the literature. Furthermore, new methods and models to deal with sectorization and routing are introduced, which can be extended to other applications. Sectorization and routing are tackled following a two-phase approach. In the first phase, a new method is described for sectorization based on electromagnetism and Coulomb’s Law. The second phase addresses the routing problems in each sector. The paper addresses not only territorial division, but also the frequency with which waste is collected, which is a critical issue in these types of applications. Special characteristics related to the number and type of deposition points were also a motivation for this work. A new model for a Mixed Capacitated Arc Routing Problem with Limited Multi-Landfills is proposed and tested in real instances. The computational results achieved confirm the effectiveness of the entire approach.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Amaya, A., Langevin, A., Trépanier, M.: The capacitated arc routing problem with refill points. Les Cahiers du GERAD G-2004-100 (2004)
Assad, A.A., Golden, B.L.: Arc routing methods and applications. Handbooks in operations research and management science, vol. 8, pp. 375–483. (1995)
Belenguer, J.M., Benavent, E.: The capacitated arc routing problem: valid inequalities and facets. Comput. Optim. Appl. 10, 165–187 (1998)
Benzarti, E., Sahin, E., Dallery, Y.: Operations management applied to home care services: analysis of the districting problem. Decis. Support Syst. 55, 587–598 (2013)
Bertolazzi, P., Bianco, L., Ricciardelli, S.: A method for determining the optimal districting in urban emergency services. Comput. Oper. Res. 4(1), 1–12 (1977)
Bozkaya, B., Erkut, E., Laporte, G.: A tabu search heuristic and adaptive memory procedure for political districting. Eur. J. Oper. Res. 144, 12–26 (2003)
Caro, F., Shirabe, T., Guignard, M., Weintraub, A.: School redistricting: embedding GIS tools with integer programming. J. Oper. 55, 836–849 (2004)
Chu, F., Labadi, N., Prins, C.: A scatter search for the periodic capacitated arc routing problem. Eur. J. Oper. Res. 169, 586–605 (2006)
D’Amico, S.J., Wang, S.-J., Batta, R., Rump, C.M.: A simulated annealing approach to police district design. Comput. Oper. Res. 29(6), 667–684 (2002)
Dror, M. (ed.): Arc Routing: Theory, Solutions and Applications. Springer Science & Business Media (2012)
Eiselt, H.A., Gendreau, M., Laporte, G.: Arc routing problems (part I): the Chinese postman problem. Oper. Res. 43(2), 231–242 (1995)
Eiselt, H.A., Gendreau, M., Laporte, G.: Arc routing problems (part II): the rural postman problem. Oper. Res. 43(3), 399–414 (1995)
Fleury, G., Lacomme, P., Prins, C.: Evolutionary Algorithms for Stochastic Arc Routing Problems. In: Raidl, G.R., et al. (eds.) Applications of Evolutionary Computing. Lecture Notes in Computer Science, vol. 3005, pp. 501–512. Springer, Berlin (2004)
Garfinkel, R.S., Nemhauser, G.L.: Optimal political districting by implicit enumeration techniques. Manag. Sci. 16(8), 495–508 (1970)
Geroliminis, N., Kepaptsoglou, K., Karlaftis, M.G.: A hybrid hypercube – genetic algorithm approach for deploying many emergency response mobile units in an urban network. Eur. J. Oper. Res. 210, 287–300 (2011)
Ghiani, G., Improta, G., Laporte, G.: The capacitated arc routing problem with intermediate facilities. Networks 37(3), 134–143 (2001)
Golden, B., Wong, R.: Capacitated arc routing problem. Networks 11, 305–315 (1981)
Gouveia, L., Mourão, M.C., Pinto, L.S.: Lower bounds for the mixed capacitated arc routing problem. Comput. Oper. Res. 37, 692–699 (2010)
Hanafi, S., Freville, A., Vaca, P.: Municipal solid waste collection: an effective data structure for solving the sectorization problem with local search methods. INFOR 37(3), 236–254 (1999)
Hess, S.W., Samuels, S.A.: Experiences with a sales districting model: criteria and implementation. Manag. Sci. 18(4), 41–54 (1971)
Hess, S.W., Weaver, J., Siegfeldt, H., Whelan, J., Zitlau, P.: Nonpartisan political redistricting by computer. Oper. Res. 13(6), 998 (1965)
Iannoni, A.P., Morabito, R., Saydam, C.: An optimization approach for ambulance location and the districting of the response segments on highways. Eur. J. Oper. Res. 195, 528–542 (2009)
Kalcsics, J., Nickel, S., Schröder, M.: Towards a unified territorial design approach – applications, algorithms and GIS integration. Top 13(1), 1–56 (2005)
Kip, A.F.: Fundamentals of Electricity and Magnetism. McGraw-Hill Series in Fundamentals of Physics: An Undergraduate Textbook Program. McGraw-Hill, New York (1969)
Lacomme, P., Prins, C., Ramdane-Chérif, W.: Evolutionary Algorithms for Multiperiod Arc Routing Problems. In: Proc. of the 9th Int. Conf. on Information Processing and Management of Uncertainty in Knowledge-Based systems (IPMU 2002). (2002)
Lacomme, P., Prins, C., Sevaux, M.: Multiobjective Capacitated Arc Routing Problem. In: Evolutionary Multi-Criterion Optimization. Springer, Berlin, Heidelberg (2003)
Lacomme, P., Prins, C., Ramdane-Chérif, W.: Competitive memetic algorithms for arc routing problems. Ann. Oper. Res. 131, 159–185 (2004)
Lacomme, P., Prins, C., Sevaux, M.: A genetic algorithm for a bi-objective capacitated arc routing problem. Comput. Oper. Res. 33, 3473–3493 (2006)
Lamata, M., Pcláez, J., Sierra, J., Bravo, J.: A sectoring genetic algorithm for the urban waste collection problem. In: Reusch, B. (ed.) Computational Intelligence. Volume 1625 of Lecture Notes in Computer Science, pp. 642–646. Springer, Berlin/Heidelberg (1999)
Letchford, A.N., Oukil, A.: Exploiting sparsity in pricing routines for the capacitated arc routing problem. Comput. Oper. Res. 36(7), 2320–2327 (2009)
Levy, L., Bodin, L.: The arc oriented location routing problem. INFOR 27(1), 74–94 (1989)
Liu, T., Jiang, Z., Chen, F., Liu, R., Liu, S.: Combined Location-Arc Routing Problems: A Survey and Suggestions for Future Research. Service Operations and Logistics, and Informatics. IEEE/SOLI 2008. IEEE International Conference on. vol. 2. IEEE (2008)
Longo, H., Aragão, M.P., Uchoa, E.: Solving capacitated arc routing problems a transformation to the CVRP. Comput. Oper. Res. 33, 1823–1837 (2006)
Lunday, B.J., Sherali, H.D., Lunday, K.E.: The coastal seaspace patrol sector design and allocation problem. Comput. Manag. Sci. 9, 483–514 (2012)
Male, J.W., Liebman, J.C.: Districting and routing for solid waste collection. J. Environ. Eng. Div. 104(1), 1–14 (1978)
Marianov, V., Fresard, F.: A procedure for the strategic planning of locations, capacities and districting of jails: application to Chile. J. Oper. Res. Soc. 56, 244–251 (2005)
Minciardi, R., Puliafito, P., Zoppoli, R.: A districting procedure for social organizations. Eur. J. Oper. Res. 8(1), 47–57 (1981)
Moreira, L., Oliveira, J., Gomes, A., Ferreira, J.S.: Heuristics for a dynamic rural postman problem. Comput. Oper. Res. 34(11), 3281–3294 (2007)
Mourão, M.C., Nunes, A.C., Prins, C.: Heuristic methods for the sectoring arc routing problem. Eur. J. Oper. Res. 196(3), 856–868 (2009)
Orloff, C.S.: A fundamental problem in vehicle routing. Networks 4, 35–64 (1974)
Pezzella, F., Bonanno, R., Nicoletti, B.: A system approach to the optimal health-care districting. Eur. J. Oper. Res. 8(2), 139–146 (1981)
Prins, C., Prodhon, C., Calvo, R.W.: A memetic algorithm with population management (MA | PM) for the capacitated location-routing problem. In: Lecture Notes in Computer Science, vol. 3906. Springer, Berlin/Heidelberg (2006)
Ricca, F., Scozzari, A., Simeone, B.: Political districting: from classical models to recent approaches. Ann. Oper. Res. 204, 271–299 (2013)
Rodrigues, A.M.: Sectores e Rotas na Recolha de Resíduos Sólidos Urbanos. Ph.D. thesis, Faculdade de Engenharia da Universidade do Porto (2014)
Rodrigues, A.M., Ferreira, J.S.: Cutting path as a rural postman problem: solutions by memetic algorithms. Int. J. Comb. Optim. Probl. Inform. 3(1), 22–37 (2012)
Rodrigues, A.M., Ferreira, J.S.: Waste collection routing – limited multiple landfills and heterogeneous fleet. Networks (2015). doi:10.1002/net.21597
Skiera, B., Albers, S.: Costa: contribution optimizing sales territory alignment. Mark. Sci. 17, 196–213 (1998)
Tagmouti, M., Gendreau, M., Potvin, J.-Y.: Arc routing problems with time-dependent service costs. Eur. J. Oper. Res. 181, 30–39 (2007)
Takashi, T., Yukio, S.: Evaluation of school family system using GIS. Geogr. Rev. Jpn. 76(10), 743–758 (2003)
Wøhlk, S.: A decade of capacitated arc routing. In: Golden, B., Raghavan, S., Wasil, E. (eds). The Vehicle Routing Problem: Latest Advances and New Challenges. Operations Research/Computer Science Interfaces, Springer, pp. 29–48 (2008)
Zoltners, A.A., Sinha, P.: Sales territory alignment: a review and model. Manag. Sci 29(11), 1237–1256 (1983)
Acknowledgements
This work was partially financed by National Funds through the FCT- Fundação para a Ciência e a Tecnologia (Portuguese Foundation for Science and Technology) within project “Project SEROW/ PTDC/ EGE-GES/ 121406/ 2010”, and by the North Portugal Regional Operational Programme (ON.2 – O Novo Norte), under the National Strategic Reference Framework (NSRF), through the European Regional Development Fund (ERDF), and by National Funds, through the FCT within “Project NORTE-07-0124-FEDER-000057”.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Rodrigues, A.M., Ferreira, J.S. (2015). Sectors and Routes in Solid Waste Collection. In: Almeida, J., Oliveira, J., Pinto, A. (eds) Operational Research. CIM Series in Mathematical Sciences, vol 4. Springer, Cham. https://doi.org/10.1007/978-3-319-20328-7_20
Download citation
DOI: https://doi.org/10.1007/978-3-319-20328-7_20
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-20327-0
Online ISBN: 978-3-319-20328-7
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)