IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v255y2016i1p68-79.html
   My bibliography  Save this article

Local search heuristics for sectoring routing in a household waste collection context

Author

Listed:
  • Cortinhal, Maria João
  • Mourão, Maria Cândida
  • Nunes, Ana Catarina

Abstract

This paper addresses the problem of residential waste collection, as a real life application of a sectoring-arc routing problem (SARP). Tactical decisions comprise the partition of the service territory into a number of sectors so that each sector can be covered by a set of vehicle trips. In addition, operational decisions involving the design of the vehicle trips that minimize total routing time are to be made. Apart from supporting good vehicle trips, sectors should also be planned such that the workload time imbalance as well as the number of connected components are minimized. These later try to promote service areas (sectors) geographically concentrated and grouped into delimited regions. We propose two local search methods: a hill climbing and a tabu search based heuristic. A constructive heuristic for obtaining an initial solution is also suggested. By means of a normalized weighted sum of criteria for evaluating solutions, the local search heuristics were tailored to improve the features of the initial solution. The algorithms are tested on random instances and also on real life based instances. The results show that the proposed local search methods are an efficient way of obtaining good quality solutions to implement in practice. Results also highlight that the proposed function for evaluating solutions during the search phase plays an essential role.

Suggested Citation

  • Cortinhal, Maria João & Mourão, Maria Cândida & Nunes, Ana Catarina, 2016. "Local search heuristics for sectoring routing in a household waste collection context," European Journal of Operational Research, Elsevier, vol. 255(1), pages 68-79.
    • Handle: RePEc:eee:ejores:v:255:y:2016:i:1:p:68-79
    DOI: 10.1016/j.ejor.2016.04.013
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221716302326
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2016.04.013?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Constantino, Miguel & Gouveia, Luís & Mourão, Maria Cândida & Nunes, Ana Catarina, 2015. "The mixed capacitated arc routing problem with non-overlapping routes," European Journal of Operational Research, Elsevier, vol. 244(2), pages 445-456.
    2. Haugland, Dag & Ho, Sin C. & Laporte, Gilbert, 2007. "Designing delivery districts for the vehicle routing problem with stochastic demands," European Journal of Operational Research, Elsevier, vol. 180(3), pages 997-1010, August.
    3. Salhi, Said & Rand, Graham K., 1989. "The effect of ignoring routes when locating depots," European Journal of Operational Research, Elsevier, vol. 39(2), pages 150-156, March.
    4. Perrier, Nathalie & Langevin, André & Campbell, James F., 2008. "The sector design and assignment problem for snow disposal operations," European Journal of Operational Research, Elsevier, vol. 189(2), pages 508-525, September.
    5. L Muyldermans & D Cattrysse & D Van Oudheusden, 2003. "District design for arc-routing applications," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(11), pages 1209-1221, November.
    6. Mourgaya, M. & Vanderbeck, F., 2007. "Column generation based heuristic for tactical planning in multi-period vehicle routing," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1028-1041, December.
    7. Teixeira, Joao & Antunes, Antonio Pais & de Sousa, Jorge Pinho, 2004. "Recyclable waste collection planning--a case study," European Journal of Operational Research, Elsevier, vol. 158(3), pages 543-554, November.
    8. Bozkaya, Burcin & Erkut, Erhan & Laporte, Gilbert, 2003. "A tabu search heuristic and adaptive memory procedure for political districting," European Journal of Operational Research, Elsevier, vol. 144(1), pages 12-26, January.
    9. M. Salazar-Aguilar & Roger Ríos-Mercado & José González-Velarde & Julián Molina, 2012. "Multiobjective scatter search for a commercial territory design problem," Annals of Operations Research, Springer, vol. 199(1), pages 343-360, October.
    10. Philippe Lacomme & Christian Prins & Wahiba Ramdane-Cherif, 2004. "Competitive Memetic Algorithms for Arc Routing Problems," Annals of Operations Research, Springer, vol. 131(1), pages 159-185, October.
    11. Mourão, Maria Cândida & Nunes, Ana Catarina & Prins, Christian, 2009. "Heuristic methods for the sectoring arc routing problem," European Journal of Operational Research, Elsevier, vol. 196(3), pages 856-868, August.
    12. David Simchi-Levi, 1992. "Hierarchical Planning for Probabilistic Distribution Systems in Euclidean Spaces," Management Science, INFORMS, vol. 38(2), pages 198-211, February.
    13. Jozefowiez, Nicolas & Semet, Frédéric & Talbi, El-Ghazali, 2009. "An evolutionary algorithm for the vehicle routing problem with route balancing," European Journal of Operational Research, Elsevier, vol. 195(3), pages 761-769, June.
    14. T R P Ramos & R C Oliveira, 2011. "Delimitation of service areas in reverse logistics networks with multiple depots," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(7), pages 1198-1210, July.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Akoluk, Damla & Karsu, Özlem, 2022. "Ensuring multidimensional equality in public service," Socio-Economic Planning Sciences, Elsevier, vol. 80(C).
    2. Shao, Saijun & Xu, Su Xiu & Huang, George Q., 2020. "Variable neighborhood search and tabu search for auction-based waste collection synchronization," Transportation Research Part B: Methodological, Elsevier, vol. 133(C), pages 1-20.
    3. Jens Van Engeland & Jeroen Beliën, 2021. "Tactical waste collection: column generation and mixed integer programming based heuristics," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 43(1), pages 89-126, March.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Constantino, Miguel & Gouveia, Luís & Mourão, Maria Cândida & Nunes, Ana Catarina, 2015. "The mixed capacitated arc routing problem with non-overlapping routes," European Journal of Operational Research, Elsevier, vol. 244(2), pages 445-456.
    2. Antonio Diglio & Stefan Nickel & Francisco Saldanha-da-Gama, 2020. "Towards a stochastic programming modeling framework for districting," Annals of Operations Research, Springer, vol. 292(1), pages 249-285, September.
    3. Alexander Butsch & Jörg Kalcsics & Gilbert Laporte, 2014. "Districting for Arc Routing," INFORMS Journal on Computing, INFORMS, vol. 26(4), pages 809-824, November.
    4. T R P Ramos & R C Oliveira, 2011. "Delimitation of service areas in reverse logistics networks with multiple depots," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(7), pages 1198-1210, July.
    5. Mourão, Maria Cândida & Nunes, Ana Catarina & Prins, Christian, 2009. "Heuristic methods for the sectoring arc routing problem," European Journal of Operational Research, Elsevier, vol. 196(3), pages 856-868, August.
    6. Jens Van Engeland & Jeroen Beliën, 2021. "Tactical waste collection: column generation and mixed integer programming based heuristics," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 43(1), pages 89-126, March.
    7. Steiner, Maria Teresinha Arns & Datta, Dilip & Steiner Neto, Pedro José & Scarpin, Cassius Tadeu & Rui Figueira, José, 2015. "Multi-objective optimization in partitioning the healthcare system of Parana State in Brazil," Omega, Elsevier, vol. 52(C), pages 53-64.
    8. Rodríguez-Martín, Inmaculada & Salazar-González, Juan-José & Yaman, Hande, 2019. "The periodic vehicle routing problem with driver consistency," European Journal of Operational Research, Elsevier, vol. 273(2), pages 575-584.
    9. Ramos, Tânia Rodrigues Pereira & Gomes, Maria Isabel & Barbosa-Póvoa, Ana Paula, 2014. "Planning a sustainable reverse logistics system: Balancing costs with environmental and social concerns," Omega, Elsevier, vol. 48(C), pages 60-74.
    10. Liu, Ran & Xie, Xiaolan & Garaix, Thierry, 2014. "Hybridization of tabu search with feasible and infeasible local searches for periodic home health care logistics," Omega, Elsevier, vol. 47(C), pages 17-32.
    11. Vidal, Thibaut & Laporte, Gilbert & Matl, Piotr, 2020. "A concise guide to existing and emerging vehicle routing problem variants," European Journal of Operational Research, Elsevier, vol. 286(2), pages 401-416.
    12. Sebastián Moreno & Jordi Pereira & Wilfredo Yushimito, 2020. "A hybrid K-means and integer programming method for commercial territory design: a case study in meat distribution," Annals of Operations Research, Springer, vol. 286(1), pages 87-117, March.
    13. Rodríguez-Martín, Inmaculada & Yaman, Hande, 2022. "Periodic Vehicle Routing Problem with Driver Consistency and service time optimization," Transportation Research Part B: Methodological, Elsevier, vol. 166(C), pages 468-484.
    14. Karsu, Özlem & Morton, Alec, 2015. "Inequity averse optimization in operational research," European Journal of Operational Research, Elsevier, vol. 245(2), pages 343-359.
    15. Ramos, Tânia Rodrigues Pereira & Gomes, Maria Isabel & Barbosa-Póvoa, Ana Paula, 2014. "Assessing and improving management practices when planning packaging waste collection systems," Resources, Conservation & Recycling, Elsevier, vol. 85(C), pages 116-129.
    16. Abdelkader Sbihi & Richard Eglese, 2010. "Combinatorial optimization and Green Logistics," Annals of Operations Research, Springer, vol. 175(1), pages 159-175, March.
    17. Michael Schneider & Andreas Stenger & Fabian Schwahn & Daniele Vigo, 2015. "Territory-Based Vehicle Routing in the Presence of Time-Window Constraints," Transportation Science, INFORMS, vol. 49(4), pages 732-751, November.
    18. Qingqing Qiao & Fengming Tao & Hailin Wu & Xuewei Yu & Mengjun Zhang, 2020. "Optimization of a Capacitated Vehicle Routing Problem for Sustainable Municipal Solid Waste Collection Management Using the PSO-TS Algorithm," IJERPH, MDPI, vol. 17(6), pages 1-22, March.
    19. Lavigne, Carolien & Inghels, Dirk & Dullaert, Wout & Dewil, Reginald, 2023. "A memetic algorithm for solving rich waste collection problems," European Journal of Operational Research, Elsevier, vol. 308(2), pages 581-604.
    20. Meiyan Lin & Kwai Sang Chin & Lijun Ma & Kwok Leung Tsui, 2020. "A comprehensive multi-objective mixed integer nonlinear programming model for an integrated elderly care service districting problem," Annals of Operations Research, Springer, vol. 291(1), pages 499-529, August.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:255:y:2016:i:1:p:68-79. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.