EURO 2024 Copenhagen
Abstract Submission

EURO-Online login

3733. GRASP reinforced by Evolutionary Path-relinking for two-echelon covering tour vehicle routing problem

Invited abstract in session WD-26: Combinatorial optimization issues in transportation (Contributed), stream Combinatorial Optimization.

Wednesday, 14:30-16:00
Room: 012 (building: 208)

Authors (first author is the speaker)

1. Dang Viet Anh Nguyen
Department of Technology, Management and Economics, Technical University of Denmark
2. Rajesh Piplani
Systems and Engineering Mgmt, Nanyang Technological University
3. Aldy Gunawan
School of Computing and Information Systems, Singapore Management University

Abstract

We introduce the two-echelon covering tour vehicle routing problem (2E-CTVRP) - a variant of the two-echelon vehicle routing problem to address the transportation and provision of essentials in humanitarian logistics. In the first echelon, a fleet of trucks is responsible for transporting supplies and drones from the depot to satellites located near the affected area. The drones then take on last-mile delivery from the satellites to the demand cluster centroids in the affected area. A clustering algorithm is employed to group the victim location and determine the delivery points within the clusters. This study formulates the 2E-CTVRP as a Mixed Integer Linear Program (MILP) with the objective of minimizing the sum of arrival time of all trucks. A hybrid metaheuristic, called the Greedy Randomized Adaptive Search Procedure with evolutionary path relinking (GRASP-EvPR), is proposed to solve larger instances within reasonable computational time.
The numerical results show that GRASP-EvPR can effectively handle the proposed instances in terms of solution quality and computational time. Furthermore, this study compares the effects of different truck fleet types on three dimensions of humanitarian logistics: efficiency, efficacy, and equity.

Keywords

Status: accepted

Back to the list of papers