Publication Type

Conference Proceeding Article

Version

publishedVersion

Publication Date

9-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.

Keywords

E-waste; GRASP; Path-relinking; Time windows; Vehicle routing problem

Discipline

Operations Research, Systems Engineering and Industrial Engineering | Theory and Algorithms

Research Areas

Intelligent Systems and Optimization

Publication

Proceedings of the 14th International Conferences on Computational Logistics, Berlin, Germany, 2023 Sep 6-8

First Page

260

Last Page

275

ISBN

9783031436116

Identifier

10.1007/978-3-031-43612-3_16

Publisher

Springer Nature

City or Country

Switzerland

Additional URL

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

Download

Share

COinS