Skip to main content

GRASP Solution Approach for the E-Waste Collection Problem

  • Conference paper
  • First Online:
Computational Logistics (ICCL 2023)

Abstract

The digital economy has brought significant advancements in electronic devices, increasing convenience and comfort in people’s lives. However, this progress has also led to a shorter life cycle for these devices due to rapid advancements in hardware and software technology. As a result, e-waste collection and recycling have become vital for protecting the environment and people’s health. From the operations research perspective, the e-waste collection problem can be modeled as the Heterogeneous Vehicle Routing Problem with Multiple Time Windows (HVRP-MTW). This study proposes a metaheuristic based on the Greedy Randomized Adaptive Search Procedure complemented by Path Relinking (GRASP-PR) to solve the HVRP-MTW problem. The experiment demonstrates that the proposed algorithm can efficiently handle HVRP-MTW instances, even of large-scale. Moreover, the comparison with CPLEX indicates that our approach can achieve optimal solutions for small instances and outperform the commercial solver in large-scale instances.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 69.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 89.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Baldé, C., D’Angelo, E., Deubzer, V.L.O., Kuehr, R.: Global transboundary e-waste flows monitor - 2022, United Nations Institute for Training and Research (UNITAR), December 2022. https://ewastemonitor.info/gtf-2022/. Accessed 26 June 2023

  2. Braekers, K., Ramaekers, K., Van Nieuwenhuyse, I.: The vehicle routing problem: state of the art classification and review. Comput. Ind. Eng. 99, 300–313 (2016)

    Article  Google Scholar 

  3. Clarke, G., Wright, J.W.: Scheduling of vehicles from a central depot to a number of delivery points. Oper. Res. 12(4), 568–581 (1964)

    Article  Google Scholar 

  4. Feo, T.A., Resende, M.G.: A probabilistic heuristic for a computationally difficult set covering problem. Oper. Res. Lett. 8(2), 67–71 (1989)

    Article  Google Scholar 

  5. Glover, F.: Tabu search and adaptive memory programming-advances, applications and challenges. In: Barr, R.S., Helgason, R.V., Kennington, J.L. (eds.) Interfaces in Computer Science and Operations Research. Operations Research/Computer Science Interfaces Series, vol. 7, pp. 1–75. Springer, Boston, MA (1997). https://doi.org/10.1007/978-1-4615-4102-8_1

  6. Golden, B., Assad, A., Levy, L., Gheysens, F.: The fleet size and mix vehicle routing problem. Comput. Oper. Res. 11(1), 49–66 (1984)

    Article  Google Scholar 

  7. Gunawan, A., Nguyen, M.P.K., F. Yu, V., Nguyen, D.V.A.: The heterogeneous vehicle routing problem with multiple time windows for the e-waste collection problem. In: submitted to IEEE CASE 2023 (accepted) (2023)

    Google Scholar 

  8. Jovanovic, R., Sanfilippo, A.P., Voß, S.: Fixed set search applied to the clique partitioning problem. Eur. J. Oper. Res. 309(1), 65–81 (2023)

    Article  Google Scholar 

  9. Jovanovic, R., Tuba, M., Voß, S.: Fixed set search applied to the traveling salesman problem. In: Blesa Aguilera, M.J., Blum, C., Gambini Santos, H., Pinacho-Davidson, P., Godoy del Campo, J. (eds.) HM 2019. LNCS, vol. 11299, pp. 63–77. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-05983-5_5

    Chapter  Google Scholar 

  10. Król, A., Nowakowski, P., Mrówczyńska, B.: How to improve WEEE management? Novel approach in mobile collection with application of artificial intelligence. Waste Manag. 50, 222–233 (2016)

    Article  Google Scholar 

  11. Mar-Ortiz, J., González-Velarde, J.L., Adenso-Díaz, B.: Designing routes for WEEE collection: the vehicle routing problem with split loads and date windows. J. Heuristics 19, 103–127 (2013)

    Article  Google Scholar 

  12. Pourhejazy, P., Zhang, D., Zhu, Q., Wei, F., Song, S.: Integrated e-waste transportation using capacitated general routing problem with time-window. Transp. Res. Part E Logist. Transp. Rev. 145, 102169 (2021)

    Article  Google Scholar 

  13. Yao, L., He, W., Li, G., Huang, J.: The integrated design and optimization of a WEEE collection network in Shanghai, China. Waste Manag. Res. 31(9), 910–919 (2013)

    Article  Google Scholar 

Download references

Acknowledgement

This research was supported by the Singapore Ministry of Education (MOE) Academic Research Fund (AcRF) Tier 1 grant.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Aldy Gunawan .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Gunawan, A., Nguyen, D.V.A., Nguyen, P.K.M., Vansteenwegen, P. (2023). GRASP Solution Approach for the E-Waste Collection Problem. In: Daduna, J.R., Liedtke, G., Shi, X., Voß, S. (eds) Computational Logistics. ICCL 2023. Lecture Notes in Computer Science, vol 14239. Springer, Cham. https://doi.org/10.1007/978-3-031-43612-3_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-43612-3_16

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-43611-6

  • Online ISBN: 978-3-031-43612-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics