IDEAS home Printed from https://ideas.repec.org/a/eee/transe/v145y2021ics1366554520308127.html
   My bibliography  Save this article

Integrated E-waste transportation using capacitated general routing problem with time-window

Author

Listed:
  • Pourhejazy, Pourya
  • Zhang, Dali
  • Zhu, Qinghua
  • Wei, Fangfang
  • Song, Shuang

Abstract

Formal collectors of electronics waste in the developing countries are struggling to survive despite receiving governmental subsidies at the early stages of their activities. The formal collection enterprises fail to collect much of the electrical and electronic equipment wastes (WEEE) due to the operational limitations and the households' preference for the traditional door-to-door collection services; this situation has resulted in inappropriate management of the WEEE stream. This study puts forward an integrated collection scheme that simultaneously considers the on-call and door-to-door demands. To explore how to effectively implement the proposed approach, an original capacitated general routing model with time-window (CGRPTW) is studied, which facilitates the general routing methodology for WEEE collection practices. A set of test instances – testbed – based on real data is developed to investigate the proposed collection scheme under various operational situations. On this basis, it is shown that the resulting improvement is more significant under certain operational, i.e. capacity- and time-management decisions. Overall, this study explores trade-offs between profit- and service-oriented paradigms for the management of the collectors' behavior within the integrated WEEE collection scheme.

Suggested Citation

  • Pourhejazy, Pourya & Zhang, Dali & Zhu, Qinghua & Wei, Fangfang & Song, Shuang, 2021. "Integrated E-waste transportation using capacitated general routing problem with time-window," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 145(C).
    • Handle: RePEc:eee:transe:v:145:y:2021:i:c:s1366554520308127
    DOI: 10.1016/j.tre.2020.102169
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1366554520308127
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.tre.2020.102169?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. Markov, Iliya & Varone, Sacha & Bierlaire, Michel, 2016. "Integrating a heterogeneous fixed fleet and a flexible assignment of destination depots in the waste collection VRP with intermediate facilities," Transportation Research Part B: Methodological, Elsevier, vol. 84(C), pages 256-273.
    2. Chen, Rongying & Dong, Jing-Xin & Lee, Chung-Yee, 2016. "Pricing and competition in a shipping market with waste shipments and empty container repositioning," Transportation Research Part B: Methodological, Elsevier, vol. 85(C), pages 32-55.
    3. Yang, Senyan & Ning, Lianju & Shang, Pan & (Carol) Tong, Lu, 2020. "Augmented Lagrangian relaxation approach for logistics vehicle routing problem with mixed backhauls and time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 135(C).
    4. Saedinia, R. & Vahdani, Behnam & Etebari, F. & Afshar Nadjafi, B., 2019. "Robust gasoline closed loop supply chain design with redistricting, service sharing and intra-district service transfer," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 123(C), pages 121-141.
    5. Thibaut Vidal, 2017. "Node, Edge, Arc Routing and Turn Penalties: Multiple Problems—One Neighborhood Extension," Operations Research, INFORMS, vol. 65(4), pages 992-1010, August.
    6. Wang, Junbin & Zhang, Ting & Fan, Xiaojun, 2020. "Reverse channel design with a dominant retailer and upstream competition in emerging markets: Retailer- or manufacturer- collection?," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 137(C).
    7. Mathias Weller & Annie Chateau & Rodolphe Giroudeau & Jean-Claude König & Valentin Pollet, 2018. "On residual approximation in solution extension problems," Journal of Combinatorial Optimization, Springer, vol. 36(4), pages 1195-1220, November.
    8. Yu, Mingzhu & Jin, Xin & Zhang, Zizhen & Qin, Hu & Lai, Qidong, 2019. "The split-delivery mixed capacitated arc-routing problem: Applications and a forest-based tabu search approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 132(C), pages 141-162.
    9. Ciancio, Claudio & Laganá, Demetrio & Vocaturo, Francesca, 2018. "Branch-price-and-cut for the Mixed Capacitated General Routing Problem with Time Windows," European Journal of Operational Research, Elsevier, vol. 267(1), pages 187-199.
    10. Zhang, Bin & Du, Zhanjie & Wang, Bo & Wang, Zhaohua, 2019. "Motivation and challenges for e-commerce in e-waste recycling under “Big data” context: A perspective from household willingness in China," Technological Forecasting and Social Change, Elsevier, vol. 144(C), pages 436-444.
    11. Nguyen, Phuong Khanh & Crainic, Teodor Gabriel & Toulouse, Michel, 2013. "A tabu search for Time-dependent Multi-zone Multi-trip Vehicle Routing Problem with Time Windows," European Journal of Operational Research, Elsevier, vol. 231(1), pages 43-56.
    12. 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.
    13. Eric Williams & Ramzy Kahhat & Magnus Bengtsson & Shiko Hayashi & Yasuhiko Hotta & Yoshiaki Totoki, 2013. "Linking Informal and Formal Electronics Recycling via an Interface Organization," Challenges, MDPI, vol. 4(2), pages 1-18, July.
    14. Besiou, Maria & Georgiadis, Patroklos & Van Wassenhove, Luk N., 2012. "Official recycling and scavengers: Symbiotic or conflicting?," European Journal of Operational Research, Elsevier, vol. 218(2), pages 563-576.
    15. Ghaderi, Abdolsalam & Burdett, Robert L., 2019. "An integrated location and routing approach for transporting hazardous materials in a bi-modal transportation network," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 127(C), pages 49-65.
    16. Halvorsen-Weare, Elin E. & Savelsbergh, Martin W.P., 2016. "The bi-objective mixed capacitated general routing problem with different route balance criteria," European Journal of Operational Research, Elsevier, vol. 251(2), pages 451-465.
    17. Zhao, Jun & Huang, Lixia & Lee, Der-Horng & Peng, Qiyuan, 2016. "Improved approaches to the network design problem in regional hazardous waste management systems," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 88(C), pages 52-75.
    18. Alain Hertz & Gilbert Laporte & Pierrette Nanchen Hugo, 1999. "Improvement Procedures for the Undirected Rural Postman Problem," INFORMS Journal on Computing, INFORMS, vol. 11(1), pages 53-62, February.
    19. Pourya Pourhejazy, 2020. "Destruction Decisions for Managing Excess Inventory in E-Commerce Logistics," Sustainability, MDPI, vol. 12(20), pages 1-12, October.
    20. Archetti, Claudia & Bertazzi, Luca & Laganà, Demetrio & Vocaturo, Francesca, 2017. "The Undirected Capacitated General Routing Problem with Profits," European Journal of Operational Research, Elsevier, vol. 257(3), pages 822-833.
    21. Beraldi, Patrizia & Bruni, Maria Elena & Laganà, Demetrio & Musmanno, Roberto, 2015. "The mixed capacitated general routing problem under uncertainty," European Journal of Operational Research, Elsevier, vol. 240(2), pages 382-392.
    22. Nagurney, Anna & Toyasaki, Fuminori, 2005. "Reverse supply chain management and electronic waste recycling: a multitiered network equilibrium framework for e-cycling," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 41(1), pages 1-28, January.
    23. Miranda, Pablo A. & Blazquez, Carola A. & Vergara, Rodrigo & Weitzler, Sebastian, 2015. "A novel methodology for designing a household waste collection system for insular zones," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 77(C), pages 227-247.
    24. Alain Hertz & Gilbert Laporte & Michel Mittaz, 2000. "A Tabu Search Heuristic for the Capacitated arc Routing Problem," Operations Research, INFORMS, vol. 48(1), pages 129-135, February.
    25. Chen, Yenming J. & Sheu, Jiuh-Biing & Lirn, Taih-Cherng, 2012. "Fault tolerance modeling for an e-waste recycling supply chain," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(5), pages 897-906.
    26. Paolo Toth & Daniele Vigo, 2003. "The Granular Tabu Search and Its Application to the Vehicle-Routing Problem," INFORMS Journal on Computing, INFORMS, vol. 15(4), pages 333-346, November.
    27. Mauro Dell’Amico & José Carlos Díaz Díaz & Geir Hasle & Manuel Iori, 2016. "An Adaptive Iterated Local Search for the Mixed Capacitated General Routing Problem," Transportation Science, INFORMS, vol. 50(4), pages 1223-1238, November.
    28. Pourya Pourhejazy & Oh Kyoung Kwon & Young-Tae Chang & Hyosoo (Kevin) Park, 2017. "Evaluating Resiliency of Supply Chain Network: A Data Envelopment Analysis Approach," Sustainability, MDPI, vol. 9(2), pages 1-19, February.
    29. 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.
    30. D Soler & E Martínez & J C Micó, 2008. "A transformation for the mixed general routing problem with turn penalties," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(4), pages 540-547, April.
    31. Irnich, Stefan & Laganà, Demetrio & Schlebusch, Claudia & Vocaturo, Francesca, 2015. "Two-phase branch-and-cut for the mixed capacitated general routing problem," European Journal of Operational Research, Elsevier, vol. 243(1), pages 17-29.
    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. Feifeng Zheng & Zhiyu Sun & Ming Liu, 2021. "Location-Routing Optimization with Renting Social Vehicles in a Two-Stage E-Waste Recycling Network," Sustainability, MDPI, vol. 13(21), pages 1-18, October.
    2. Liang Shen & Runjie Fan & Zhaoqing Yu & Yuyan Wang, 2021. "The Service Strategy and Influencing Factors of Online Recycling of Used Mobile Phones," Mathematics, MDPI, vol. 9(21), pages 1-24, October.
    3. Duan, Gang & Aghalari, Amin & Chen, Li & Marufuzzaman, Mohammad & Ma, Junfeng, 2021. "Vessel routing optimization for floating macro-marine debris collection in the ocean considering dynamic velocity and direction," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 152(C).

    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. Duan, Gang & Aghalari, Amin & Chen, Li & Marufuzzaman, Mohammad & Ma, Junfeng, 2021. "Vessel routing optimization for floating macro-marine debris collection in the ocean considering dynamic velocity and direction," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 152(C).
    2. Feng, Jianghong & Xu, Su Xiu & Xu, Gangyan & Cheng, Huibing, 2022. "An integrated decision-making method for locating parking centers of recyclable waste transportation vehicles," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 157(C).
    3. Thibaut Vidal, 2017. "Node, Edge, Arc Routing and Turn Penalties: Multiple Problems—One Neighborhood Extension," Operations Research, INFORMS, vol. 65(4), pages 992-1010, August.
    4. Benavent, Enrique & Corberán, Ángel & Laganà, Demetrio & Vocaturo, Francesca, 2019. "The periodic rural postman problem with irregular services on mixed graphs," European Journal of Operational Research, Elsevier, vol. 276(3), pages 826-839.
    5. Ciancio, Claudio & Laganá, Demetrio & Vocaturo, Francesca, 2018. "Branch-price-and-cut for the Mixed Capacitated General Routing Problem with Time Windows," European Journal of Operational Research, Elsevier, vol. 267(1), pages 187-199.
    6. Akbari, Vahid & Salman, F. Sibel, 2017. "Multi-vehicle synchronized arc routing problem to restore post-disaster network connectivity," European Journal of Operational Research, Elsevier, vol. 257(2), pages 625-640.
    7. Barbara De Rosa & Gennaro Improta & Gianpaolo Ghiani & Roberto Musmanno, 2002. "The Arc Routing and Scheduling Problem with Transshipment," Transportation Science, INFORMS, vol. 36(3), pages 301-313, August.
    8. Wu, Weitiao & Ma, Jian & Liu, Ronghui & Jin, Wenzhou, 2022. "Multi-class hazmat distribution network design with inventory and superimposed risks," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 161(C).
    9. Jesica Armas & Peter Keenan & Angel A. Juan & Seán McGarraghy, 2019. "Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics," Annals of Operations Research, Springer, vol. 273(1), pages 135-162, February.
    10. Archetti, Claudia & Corberán, Ángel & Plana, Isaac & Sanchis, José Maria & Speranza, M. Grazia, 2015. "A matheuristic for the Team Orienteering Arc Routing Problem," European Journal of Operational Research, Elsevier, vol. 245(2), pages 392-401.
    11. Jorge Oyola & Halvard Arntzen & David L. Woodruff, 2017. "The stochastic vehicle routing problem, a literature review, Part II: solution methods," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 6(4), pages 349-388, December.
    12. Nikzamir, Mohammad & Baradaran, Vahid, 2020. "A healthcare logistic network considering stochastic emission of contamination: Bi-objective model and solution algorithm," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 142(C).
    13. Fung, Richard Y.K. & Liu, Ran & Jiang, Zhibin, 2013. "A memetic algorithm for the open capacitated arc routing problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 50(C), pages 53-67.
    14. Archetti, Claudia & Bertazzi, Luca & Laganà, Demetrio & Vocaturo, Francesca, 2017. "The Undirected Capacitated General Routing Problem with Profits," European Journal of Operational Research, Elsevier, vol. 257(3), pages 822-833.
    15. Alain Hertz & Michel Mittaz, 2001. "A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem," Transportation Science, INFORMS, vol. 35(4), pages 425-434, November.
    16. 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.
    17. Yu, Mingzhu & Jin, Xin & Zhang, Zizhen & Qin, Hu & Lai, Qidong, 2019. "The split-delivery mixed capacitated arc-routing problem: Applications and a forest-based tabu search approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 132(C), pages 141-162.
    18. Zhou, Yangming & Qu, Chenhui & Wu, Qinghua & Kou, Yawen & Jiang, Zhibin & Zhou, MengChu, 2024. "A bilevel hybrid iterated search approach to soft-clustered capacitated arc routing problems," Transportation Research Part B: Methodological, Elsevier, vol. 184(C).
    19. Beullens, Patrick & Muyldermans, Luc & Cattrysse, Dirk & Van Oudheusden, Dirk, 2003. "A guided local search heuristic for the capacitated arc routing problem," European Journal of Operational Research, Elsevier, vol. 147(3), pages 629-643, June.
    20. 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.

    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:transe:v:145:y:2021:i:c:s1366554520308127. 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/wps/find/journaldescription.cws_home/600244/description#description .

    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.