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

A variable neighborhood search for the multi-period collection of recyclable materials

Author

Listed:
  • Elbek, Maria
  • Wøhlk, Sanne

Abstract

We consider an approach for scheduling the multi-period collection of recyclable materials. Citizens can deposit glass and paper for recycling in small cubes located at several collection points. The cubes are emptied by a vehicle that carries two containers and the material is transported to two treatment facilities. We investigate how the scheduling of emptying and transportation should be done in order to minimize the operation cost, while providing a high service level and ensuring that capacity constraints are not violated. We develop a heuristic solution method for solving the daily planning problem with uncertain accretion rate for materials by considering a rolling time horizon of a few days. We apply a construction heuristic in the first period and re-optimize the solution every subsequent period with a variable neighborhood search. Computational experiments are conducted on real life data.

Suggested Citation

  • Elbek, Maria & Wøhlk, Sanne, 2016. "A variable neighborhood search for the multi-period collection of recyclable materials," European Journal of Operational Research, Elsevier, vol. 249(2), pages 540-550.
    • Handle: RePEc:eee:ejores:v:249:y:2016:i:2:p:540-550
    DOI: 10.1016/j.ejor.2015.08.035
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221715007900
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2015.08.035?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. Bogh, Morten Bie & Mikkelsen, Hardy & Wøhlk, Sanne, 2014. "Collection of recyclables from cubes – A case study," Socio-Economic Planning Sciences, Elsevier, vol. 48(2), pages 127-134.
    2. Muyldermans, L. & Pang, G., 2010. "On the benefits of co-collection: Experiments with a multi-compartment vehicle routing algorithm," European Journal of Operational Research, Elsevier, vol. 206(1), pages 93-103, October.
    3. E Angelelli & M G Speranza, 2002. "The application of a vehicle routing model to a waste-collection problem: two case studies," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 53(9), pages 944-952, September.
    4. Coelho, Leandro C. & Laporte, Gilbert, 2015. "Classification, models and exact algorithms for multi-compartment delivery problems," European Journal of Operational Research, Elsevier, vol. 242(3), pages 854-864.
    5. 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.
    6. Aksen, Deniz & Kaya, Onur & Sibel Salman, F. & Tüncel, Özge, 2014. "An adaptive large neighborhood search algorithm for a selective and periodic inventory routing problem," European Journal of Operational Research, Elsevier, vol. 239(2), pages 413-426.
    7. Leandro C. Coelho & Jean-François Cordeau & Gilbert Laporte, 2014. "Thirty Years of Inventory Routing," Transportation Science, INFORMS, vol. 48(1), pages 1-19, February.
    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. Tino Henke & M. Grazia Speranza & Gerhard Wäscher, 2019. "A branch-and-cut algorithm for the multi-compartment vehicle routing problem with flexible compartment sizes," Annals of Operations Research, Springer, vol. 275(2), pages 321-338, April.
    2. Ostermeier, Manuel & Henke, Tino & Hübner, Alexander & Wäscher, Gerhard, 2021. "Multi-compartment vehicle routing problems: State-of-the-art, modeling framework and future directions," European Journal of Operational Research, Elsevier, vol. 292(3), pages 799-817.
    3. Roberto Aringhieri & Maurizio Bruglieri & Federico Malucelli & Maddalena Nonato, 2018. "A Special Vehicle Routing Problem Arising in the Optimization of Waste Disposal: A Real Case," Transportation Science, INFORMS, vol. 52(2), pages 277-299, March.
    4. Yu, Bin & Shan, Wenxuan & Sheu, Jiuh-Biing & Diabat, Ali, 2022. "Branch-and-price for a combined order selection and distribution problem in online community group-buying of perishable products," Transportation Research Part B: Methodological, Elsevier, vol. 158(C), pages 341-373.
    5. Cui, Hailong & Sošić, Greys, 2019. "Recycling common materials: Effectiveness, optimal decisions, and coordination mechanisms," European Journal of Operational Research, Elsevier, vol. 274(3), pages 1055-1068.
    6. Hiba Yahyaoui & Islem Kaabachi & Saoussen Krichen & Abdulkader Dekdouk, 2020. "Two metaheuristic approaches for solving the multi-compartment vehicle routing problem," Operational Research, Springer, vol. 20(4), pages 2085-2108, December.
    7. Tino Henke & Grazia Speranza & Gerhard Wäscher, 2017. "A Branch-and-Cut Algorithm for the Multi Compartment vehicle Routing Problem with Flexbile Compartment Sizes," FEMM Working Papers 170004, Otto-von-Guericke University Magdeburg, Faculty of Economics and Management.
    8. Iyer, Ananth V. & Vedantam, Aditya & Lacourbe, Paul, 2023. "Recycled content claims under demand benefit and supply uncertainty: Multi-period model and application to glasswool insulation," European Journal of Operational Research, Elsevier, vol. 309(2), pages 745-761.
    9. Soheil Davari, 2019. "The incremental cooperative design of preventive healthcare networks," Annals of Operations Research, Springer, vol. 272(1), pages 445-492, January.
    10. Soysal, Mehmet & Koç, Çağrı & Çimen, Mustafa & İbiş, Merve, 2023. "Managing returnable transport items in a vendor managed inventory system," Socio-Economic Planning Sciences, Elsevier, vol. 86(C).
    11. Dayarian, Iman & Crainic, Teodor Gabriel & Gendreau, Michel & Rei, Walter, 2016. "An adaptive large-neighborhood search heuristic for a multi-period vehicle routing problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 95(C), pages 95-123.

    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. Dayarian, Iman & Crainic, Teodor Gabriel & Gendreau, Michel & Rei, Walter, 2016. "An adaptive large-neighborhood search heuristic for a multi-period vehicle routing problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 95(C), pages 95-123.
    2. Gu, Wenjuan & Archetti, Claudia & Cattaruzza, Diego & Ogier, Maxime & Semet, Frédéric & Speranza, M. Grazia, 2024. "Vehicle routing problems with multiple commodities: A survey," European Journal of Operational Research, Elsevier, vol. 317(1), pages 1-15.
    3. Ostermeier, Manuel & Henke, Tino & Hübner, Alexander & Wäscher, Gerhard, 2021. "Multi-compartment vehicle routing problems: State-of-the-art, modeling framework and future directions," European Journal of Operational Research, Elsevier, vol. 292(3), pages 799-817.
    4. Martins, Sara & Ostermeier, Manuel & Amorim, Pedro & Hübner, Alexander & Almada-Lobo, Bernardo, 2019. "Product-oriented time window assignment for a multi-compartment vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 276(3), pages 893-909.
    5. David Raba & Rafael D. Tordecilla & Pedro Copado & Angel A. Juan & Daniel Mount, 2022. "A Digital Twin for Decision Making on Livestock Feeding," Interfaces, INFORMS, vol. 52(3), pages 267-282, May.
    6. Cárdenas-Barrón, Leopoldo Eduardo & González-Velarde, José Luis & Treviño-Garza, Gerardo & Garza-Nuñez, Dagoberto, 2019. "Heuristic algorithm based on reduce and optimize approach for a selective and periodic inventory routing problem in a waste vegetable oil collection environment," International Journal of Production Economics, Elsevier, vol. 211(C), pages 44-59.
    7. Samira Mirzaei & Sanne Wøhlk, 2019. "A Branch-and-Price algorithm for two multi-compartment vehicle routing problems," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 8(1), pages 1-33, March.
    8. Henriette Koch & Tino Henke & Gerhard Wäscher, 2016. "A Genetic Algorithm for the Multi-Compartment Vehicle Routing Problem with Flexible Compartment Sizes," FEMM Working Papers 160004, Otto-von-Guericke University Magdeburg, Faculty of Economics and Management.
    9. Ramos, Tânia Rodrigues Pereira & Gomes, Maria Isabel & Barbosa-Póvoa, Ana Paula, 2014. "Economic and environmental concerns in planning recyclable waste collection systems," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 62(C), pages 34-54.
    10. Cárdenas-Barrón, Leopoldo E. & Melo, Rafael A., 2021. "A fast and effective MIP-based heuristic for a selective and periodic inventory routing problem in reverse logistics," Omega, Elsevier, vol. 103(C).
    11. Toni Greif & Nikolai Stein & Christoph M. Flath, 2023. "Information Value Analysis for Real-Time Silo Fill-Level Monitoring," Interfaces, INFORMS, vol. 53(4), pages 283-294, July.
    12. Tino Henke & M. Grazia Speranza & Gerhard Wäscher, 2019. "A branch-and-cut algorithm for the multi-compartment vehicle routing problem with flexible compartment sizes," Annals of Operations Research, Springer, vol. 275(2), pages 321-338, April.
    13. Heßler, Katrin, 2021. "Exact algorithms for the multi-compartment vehicle routing problem with flexible compartment sizes," European Journal of Operational Research, Elsevier, vol. 294(1), pages 188-205.
    14. Song, Ruidian & Zhao, Lei & Van Woensel, Tom & Fransoo, Jan C., 2019. "Coordinated delivery in urban retail," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 126(C), pages 122-148.
    15. Aksen, Deniz & Kaya, Onur & Sibel Salman, F. & Tüncel, Özge, 2014. "An adaptive large neighborhood search algorithm for a selective and periodic inventory routing problem," European Journal of Operational Research, Elsevier, vol. 239(2), pages 413-426.
    16. Liu, Wenqian & Ke, Ginger Y. & Chen, Jian & Zhang, Lianmin, 2020. "Scheduling the distribution of blood products: A vendor-managed inventory routing approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 140(C).
    17. Katrin Heßler, 2020. "Exact Algorithms for the Multi-Compartment Vehicle Routing Problem with Flexible Compartment Sizes," Working Papers 2007, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    18. Hiba Yahyaoui & Islem Kaabachi & Saoussen Krichen & Abdulkader Dekdouk, 2020. "Two metaheuristic approaches for solving the multi-compartment vehicle routing problem," Operational Research, Springer, vol. 20(4), pages 2085-2108, December.
    19. Lahyani, Rahma & Khemakhem, Mahdi & Semet, Frédéric, 2015. "Rich vehicle routing problems: From a taxonomy to a definition," European Journal of Operational Research, Elsevier, vol. 241(1), pages 1-14.
    20. Samira Mirzaei & Sanne Wøhlk, 2017. "Erratum to: A Branch-and-Price algorithm for two multi-compartment vehicle routing problems," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 6(2), pages 185-218, June.

    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:249:y:2016:i:2:p:540-550. 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.