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

Collection-disassembly-delivery problem of disassembly centers in a reverse logistics network

Author

Listed:
  • Lei, Jieyu
  • Che, Ada
  • Van Woensel, Tom

Abstract

Disassembly centers are essential in a reverse logistics network for breaking end-of-life products and recycling valuable materials. This paper studies a collection-disassembly-delivery problem for a disassembly center, which collects products from collection centers, disassembles products into materials and delivers materials to remanufacturing plants. A set of homogenous vehicles are available for collecting products and delivering materials. The disassembly center makes the best decision on disassembly, inventory, and vehicle routing for collecting products and delivering materials. We propose a mixed-integer linear programming model to formulate the problem, and then improve the two-phase iterative heuristic approach and adaptive large neighborhood search heuristic to solve the problem. This method introduces a tabu search procedure, a learning mechanism, and four new removal operators. A real case and three generated datasets are used to evaluate its computational performance. The results demonstrate that the method can quickly obtain high-quality solutions.

Suggested Citation

  • Lei, Jieyu & Che, Ada & Van Woensel, Tom, 2024. "Collection-disassembly-delivery problem of disassembly centers in a reverse logistics network," European Journal of Operational Research, Elsevier, vol. 313(2), pages 478-493.
    • Handle: RePEc:eee:ejores:v:313:y:2024:i:2:p:478-493
    DOI: 10.1016/j.ejor.2023.07.008
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221723005465
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2023.07.008?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. Ann Melissa Campbell & Martin W. P. Savelsbergh, 2004. "A Decomposition Approach for the Inventory-Routing Problem," Transportation Science, INFORMS, vol. 38(4), pages 488-502, November.
    2. Stefan Ropke & David Pisinger, 2006. "An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows," Transportation Science, INFORMS, vol. 40(4), pages 455-472, November.
    3. Muh. Khoirul Khakim Habibi & Olga Battaïa & Van-Dat Cung & Alexandre Dolgui & Manoj Kumar Tiwari, 2019. "Sample average approximation for multi-vehicle collection–disassembly problem under uncertainty," International Journal of Production Research, Taylor & Francis Journals, vol. 57(8), pages 2409-2428, April.
    4. Guy Desaulniers & Jørgen G. Rakke & Leandro C. Coelho, 2016. "A Branch-Price-and-Cut Algorithm for the Inventory-Routing Problem," Transportation Science, INFORMS, vol. 50(3), pages 1060-1076, August.
    5. Goetschalckx, Marc & Jacobs-Blecha, Charlotte, 1989. "The vehicle routing problem with backhauls," European Journal of Operational Research, Elsevier, vol. 42(1), pages 39-51, September.
    6. Ropke, Stefan & Pisinger, David, 2006. "A unified heuristic for a large class of Vehicle Routing Problems with Backhauls," European Journal of Operational Research, Elsevier, vol. 171(3), pages 750-775, June.
    7. N. Absi & C. Archetti & S. Dauzère-Pérès & D. Feillet, 2015. "A Two-Phase Iterative Heuristic Approach for the Production Routing Problem," Transportation Science, INFORMS, vol. 49(4), pages 784-795, November.
    8. Manousakis, Eleftherios G. & Kasapidis, Grigoris A. & Kiranoudis, Chris T. & Zachariadis, Emmanouil E., 2022. "An infeasible space exploring matheuristic for the Production Routing Problem," European Journal of Operational Research, Elsevier, vol. 298(2), pages 478-495.
    9. Sila Çetinkaya & Chung-Yee Lee, 2000. "Stock Replenishment and Shipment Scheduling for Vendor-Managed Inventory Systems," Management Science, INFORMS, vol. 46(2), pages 217-232, February.
    10. Boudia, M. & Prins, C., 2009. "A memetic algorithm with dynamic population management for an integrated production-distribution problem," European Journal of Operational Research, Elsevier, vol. 195(3), pages 703-715, June.
    11. Bortfeldt, Andreas & Hahn, Thomas & Männel, Dirk & Mönch, Lars, 2015. "Hybrid algorithms for the vehicle routing problem with clustered backhauls and 3D loading constraints," European Journal of Operational Research, Elsevier, vol. 243(1), pages 82-96.
    12. Ada Che & Jieyu Lei & Zhibin Jiang, 2022. "Optimised redesign of reverse logistics network with multi-level capacity choices for household appliances," International Journal of Production Research, Taylor & Francis Journals, vol. 60(18), pages 5615-5632, September.
    13. Palhazi Cuervo, Daniel & Goos, Peter & Sörensen, Kenneth & Arráiz, Emely, 2014. "An iterated local search algorithm for the vehicle routing problem with backhauls," European Journal of Operational Research, Elsevier, vol. 237(2), pages 454-464.
    14. Schenekemberg, Cleder M. & Scarpin, Cassius T. & Pécora, José E. & Guimarães, Thiago A. & Coelho, Leandro C., 2021. "The two-echelon production-routing problem," European Journal of Operational Research, Elsevier, vol. 288(2), pages 436-449.
    15. Li, Yantong & Chu, Feng & Chu, Chengbin & Zhu, Zhanguo, 2019. "An efficient three-level heuristic for the large-scaled multi-product production routing problem with outsourcing," European Journal of Operational Research, Elsevier, vol. 272(3), pages 914-927.
    16. Paolo Toth & Daniele Vigo, 1997. "An Exact Algorithm for the Vehicle Routing Problem with Backhauls," Transportation Science, INFORMS, vol. 31(4), pages 372-385, November.
    17. Alumur, Sibel A. & Nickel, Stefan & Saldanha-da-Gama, Francisco & Verter, Vedat, 2012. "Multi-period reverse logistics network design," European Journal of Operational Research, Elsevier, vol. 220(1), pages 67-78.
    18. G. Clarke & J. W. Wright, 1964. "Scheduling of Vehicles from a Central Depot to a Number of Delivery Points," Operations Research, INFORMS, vol. 12(4), pages 568-581, August.
    19. Nolz, Pamela C. & Absi, Nabil & Feillet, Dominique & Seragiotto, Clóvis, 2022. "The consistent electric-Vehicle routing problem with backhauls and charging management," European Journal of Operational Research, Elsevier, vol. 302(2), pages 700-716.
    20. Wade, A. C. & Salhi, S., 2002. "An investigation into a new class of vehicle routing problem with backhauls," Omega, Elsevier, vol. 30(6), pages 479-487, December.
    21. Ann Melissa Campbell & Martin Savelsbergh, 2004. "Efficient Insertion Heuristics for Vehicle Routing and Scheduling Problems," Transportation Science, INFORMS, vol. 38(3), pages 369-378, August.
    22. Hoff, Arild & Gribkovskaia, Irina & Laporte, Gilbert & Løkketangen, Arne, 2009. "Lasso solution strategies for the vehicle routing problem with pickups and deliveries," European Journal of Operational Research, Elsevier, vol. 192(3), pages 755-766, February.
    23. Ren, Yaping & Zhang, Chaoyong & Zhao, Fu & Xiao, Huajun & Tian, Guangdong, 2018. "An asynchronous parallel disassembly planning based on genetic algorithm," European Journal of Operational Research, Elsevier, vol. 269(2), pages 647-660.
    24. Luca Bertazzi & Giuseppe Paletta & M. Grazia Speranza, 2002. "Deterministic Order-Up-To Level Policies in an Inventory Routing Problem," Transportation Science, INFORMS, vol. 36(1), pages 119-132, February.
    25. Demir, Emrah & Bektaş, Tolga & Laporte, Gilbert, 2012. "An adaptive large neighborhood search heuristic for the Pollution-Routing Problem," European Journal of Operational Research, Elsevier, vol. 223(2), pages 346-359.
    26. Yossiri Adulyasak & Jean-François Cordeau & Raf Jans, 2014. "Optimization-Based Adaptive Large Neighborhood Search for the Production Routing Problem," Transportation Science, INFORMS, vol. 48(1), pages 20-45, February.
    27. Yossiri Adulyasak & Jean-François Cordeau & Raf Jans, 2015. "Benders Decomposition for Production Routing Under Demand Uncertainty," Operations Research, INFORMS, vol. 63(4), pages 851-867, August.
    28. Manousakis, Eleftherios & Repoussis, Panagiotis & Zachariadis, Emmanouil & Tarantilis, Christos, 2021. "Improved branch-and-cut for the Inventory Routing Problem based on a two-commodity flow formulation," European Journal of Operational Research, Elsevier, vol. 290(3), pages 870-885.
    29. Yossiri Adulyasak & Jean-François Cordeau & Raf Jans, 2014. "Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems," INFORMS Journal on Computing, INFORMS, vol. 26(1), pages 103-120, February.
    30. Xin Liu & Feng Chu & Alexandre Dolgui & Feifeng Zheng & Ming Liu, 2021. "Service-oriented bi-objective robust collection-disassembly problem with equipment selection," International Journal of Production Research, Taylor & Francis Journals, vol. 59(6), pages 1676-1690, March.
    31. Slama, Ilhem & Ben-Ammar, Oussama & Thevenin, Simon & Dolgui, Alexandre & Masmoudi, Faouzi, 2022. "Stochastic program for disassembly lot-sizing under uncertain component refurbishing lead times," European Journal of Operational Research, Elsevier, vol. 303(3), pages 1183-1198.
    32. S Salhi & G Nagy, 1999. "A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 50(10), pages 1034-1042, October.
    33. Archetti, Claudia & Ljubić, Ivana, 2022. "Comparison of formulations for the Inventory Routing Problem," European Journal of Operational Research, Elsevier, vol. 303(3), pages 997-1008.
    34. Walter J. Bell & Louis M. Dalberto & Marshall L. Fisher & Arnold J. Greenfield & R. Jaikumar & Pradeep Kedia & Robert G. Mack & Paul J. Prutzman, 1983. "Improving the Distribution of Industrial Gases with an On-Line Computerized Routing and Scheduling Optimizer," Interfaces, INFORMS, vol. 13(6), pages 4-23, December.
    35. Hrabec, Dušan & Hvattum, Lars Magnus & Hoff, Arild, 2022. "The value of integrated planning for production, inventory, and routing decisions: A systematic review and meta-analysis," International Journal of Production Economics, Elsevier, vol. 248(C).
    36. 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)

    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. Maria João Santos & Pedro Amorim & Alexandra Marques & Ana Carvalho & Ana Póvoa, 2020. "The vehicle routing problem with backhauls towards a sustainability perspective: a review," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 28(2), pages 358-401, July.
    2. Henriette Koch & Andreas Bortfeldt & Gerhard Wäscher, 2018. "A hybrid algorithm for the vehicle routing problem with backhauls, time windows and three-dimensional loading constraints," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 40(4), pages 1029-1075, October.
    3. Manousakis, Eleftherios G. & Kasapidis, Grigoris A. & Kiranoudis, Chris T. & Zachariadis, Emmanouil E., 2022. "An infeasible space exploring matheuristic for the Production Routing Problem," European Journal of Operational Research, Elsevier, vol. 298(2), pages 478-495.
    4. 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.
    5. Manousakis, Eleftherios & Repoussis, Panagiotis & Zachariadis, Emmanouil & Tarantilis, Christos, 2021. "Improved branch-and-cut for the Inventory Routing Problem based on a two-commodity flow formulation," European Journal of Operational Research, Elsevier, vol. 290(3), pages 870-885.
    6. Henriette Koch & Andreas Bortfeldt & Gerhard Wäscher, 2017. "A hybrid solution approach for the 3L-VRP with simultaneous delivery and pickups," FEMM Working Papers 170005, Otto-von-Guericke University Magdeburg, Faculty of Economics and Management.
    7. Schenekemberg, Cleder M. & Scarpin, Cassius T. & Pécora, José E. & Guimarães, Thiago A. & Coelho, Leandro C., 2021. "The two-echelon production-routing problem," European Journal of Operational Research, Elsevier, vol. 288(2), pages 436-449.
    8. Avci, Mustafa & Yildiz, Seyda Topaloglu, 2019. "A matheuristic solution approach for the production routing problem with visit spacing policy," European Journal of Operational Research, Elsevier, vol. 279(2), pages 572-588.
    9. Alvarez, Aldair & Miranda, Pedro & Rohmer, S.U.K., 2022. "Production routing for perishable products," Omega, Elsevier, vol. 111(C).
    10. Zakaria Chekoubi & Wajdi Trabelsi & Nathalie Sauer & Ilias Majdouline, 2022. "The Integrated Production-Inventory-Routing Problem with Reverse Logistics and Remanufacturing: A Two-Phase Decomposition Heuristic," Sustainability, MDPI, vol. 14(20), pages 1-30, October.
    11. Qiu, Yuzhuo & Zhou, Dan & Du, Yanan & Liu, Jie & Pardalos, Panos M. & Qiao, Jun, 2021. "The two-echelon production routing problem with cross-docking satellites," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 147(C).
    12. Henriette Koch & Maximilian Schlögell & Andreas Bortfeldt, 2020. "A hybrid algorithm for the vehicle routing problem with three-dimensional loading constraints and mixed backhauls," Journal of Scheduling, Springer, vol. 23(1), pages 71-93, February.
    13. 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.
    14. Hu, Weihong & Toriello, Alejandro & Dessouky, Maged, 2018. "Integrated inventory routing and freight consolidation for perishable goods," European Journal of Operational Research, Elsevier, vol. 271(2), pages 548-560.
    15. Diabat, Ali & Bianchessi, Nicola & Archetti, Claudia, 2024. "On the zero-inventory-ordering policy in the inventory routing problem," European Journal of Operational Research, Elsevier, vol. 312(3), pages 1024-1038.
    16. S Mitra, 2008. "A parallel clustering technique for the vehicle routing problem with split deliveries and pickups," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(11), pages 1532-1546, November.
    17. Vidal, Thibaut & Crainic, Teodor Gabriel & Gendreau, Michel & Prins, Christian, 2013. "Heuristics for multi-attribute vehicle routing problems: A survey and synthesis," European Journal of Operational Research, Elsevier, vol. 231(1), pages 1-21.
    18. Emre Çankaya & Ali Ekici & Okan Örsan Özener, 2019. "Humanitarian relief supplies distribution: an application of inventory routing problem," Annals of Operations Research, Springer, vol. 283(1), pages 119-141, December.
    19. Ahmed Kheiri, 2020. "Heuristic Sequence Selection for Inventory Routing Problem," Transportation Science, INFORMS, vol. 54(2), pages 302-312, March.
    20. 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.

    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:313:y:2024:i:2:p:478-493. 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.