GRASP based metaheuristic to solve the mixed fleet e-waste collection route planning problem

• Main Authors: GUNAWAN, Aldy, NGUYEN, Dang V.A., NGUYEN, Pham K.M., VANSTEENWEGEN, Pieter.
• Format: text
• Language: English
• Published: Institutional Knowledge at Singapore Management University 2023
• Subjects: E-waste; Vehicle routing problem; time windows; GRASP; Path-relinking; Operations Research, Systems Engineering and Industrial Engineering; Theory and Algorithms
• Online Access: https://ink.library.smu.edu.sg/sis_research/8317; https://ink.library.smu.edu.sg/context/sis_research/article/9320/viewcontent/GRASP_based_metaheuristic_to_solve_the_mixed_fleet_e_waste_collection_route_planning_problem.pdf
• Institution: Singapore Management University

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.