The Two-echelon vehicle routing problem with transshipment nodes and occasional drivers: Formulation and adaptive large neighborhood search heuristic

This research introduces a new variant of the two-echelon vehicle routing problem (2EVRP) called the two-echelon vehicle routing problem with transshipment nodes and occasional drivers (2EVRP-TN-OD). In addition to city freighters in the second-echelon network, a set of occasional drivers (ODs) is a...

وصف كامل

محفوظ في:
التفاصيل البيبلوغرافية
المؤلفون الرئيسيون: YU, Vincent F., NGUYEN, Minh P. K., PUTRA, Kuza, GUNAWAN, Aldy, DHARMA, I. Gusti Bagus Budi
التنسيق: text
اللغة:English
منشور في: Institutional Knowledge at Singapore Management University 2022
الموضوعات:
الوصول للمادة أونلاين:https://ink.library.smu.edu.sg/sis_research/10100
https://ink.library.smu.edu.sg/context/sis_research/article/11100/viewcontent/Two_EchelonVehicleRoutingProblem_2022_pvoa_cc_by.pdf
الوسوم: إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
المؤسسة: Singapore Management University
اللغة: English
id sg-smu-ink.sis_research-11100
record_format dspace
spelling sg-smu-ink.sis_research-111002025-02-13T02:10:23Z The Two-echelon vehicle routing problem with transshipment nodes and occasional drivers: Formulation and adaptive large neighborhood search heuristic YU, Vincent F. NGUYEN, Minh P. K. PUTRA, Kuza GUNAWAN, Aldy DHARMA, I. Gusti Bagus Budi This research introduces a new variant of the two-echelon vehicle routing problem (2EVRP) called the two-echelon vehicle routing problem with transshipment nodes and occasional drivers (2EVRP-TN-OD). In addition to city freighters in the second-echelon network, a set of occasional drivers (ODs) is available to serve customers. ODs are the basis of a crowd-shipping system in which crowds with planned trips are willing to take detours to deliver packages in exchange for some compensation. To serve customers, ODs collect the assigned packages at either satellite served by first-echelon trucks or transshipment nodes served by city freighters. We formulate this problem as a mixed-integer nonlinear programming model and develop an adaptive large neighborhood search (ALNS) to solve it. New problem-specific destroy and repair operators and a tailored local search procedure are embedded into ALNS to deal with the problem’s unique characteristics. The experiments show that the proposed ALNS effectively solves 2EVRP-TN-OD by outperforming Gurobi in terms of both solution quality and computational time. Moreover, the experiments confirm that employing occasional drivers leads to lower operational costs. Sensitivity analyses on the characteristics of occasional drivers and the impact of transshipment nodes are presented as interesting managerial insights from 2EVRP-TN-OD. 2022-01-01T08:00:00Z text application/pdf https://ink.library.smu.edu.sg/sis_research/10100 info:doi/10.1155/2022/5603956 https://ink.library.smu.edu.sg/context/sis_research/article/11100/viewcontent/Two_EchelonVehicleRoutingProblem_2022_pvoa_cc_by.pdf http://creativecommons.org/licenses/by/4.0/ Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University Numerical Analysis and Scientific Computing Operations Research, Systems Engineering and Industrial Engineering Transportation
institution Singapore Management University
building SMU Libraries
continent Asia
country Singapore
Singapore
content_provider SMU Libraries
collection InK@SMU
language English
topic Numerical Analysis and Scientific Computing
Operations Research, Systems Engineering and Industrial Engineering
Transportation
spellingShingle Numerical Analysis and Scientific Computing
Operations Research, Systems Engineering and Industrial Engineering
Transportation
YU, Vincent F.
NGUYEN, Minh P. K.
PUTRA, Kuza
GUNAWAN, Aldy
DHARMA, I. Gusti Bagus Budi
The Two-echelon vehicle routing problem with transshipment nodes and occasional drivers: Formulation and adaptive large neighborhood search heuristic
description This research introduces a new variant of the two-echelon vehicle routing problem (2EVRP) called the two-echelon vehicle routing problem with transshipment nodes and occasional drivers (2EVRP-TN-OD). In addition to city freighters in the second-echelon network, a set of occasional drivers (ODs) is available to serve customers. ODs are the basis of a crowd-shipping system in which crowds with planned trips are willing to take detours to deliver packages in exchange for some compensation. To serve customers, ODs collect the assigned packages at either satellite served by first-echelon trucks or transshipment nodes served by city freighters. We formulate this problem as a mixed-integer nonlinear programming model and develop an adaptive large neighborhood search (ALNS) to solve it. New problem-specific destroy and repair operators and a tailored local search procedure are embedded into ALNS to deal with the problem’s unique characteristics. The experiments show that the proposed ALNS effectively solves 2EVRP-TN-OD by outperforming Gurobi in terms of both solution quality and computational time. Moreover, the experiments confirm that employing occasional drivers leads to lower operational costs. Sensitivity analyses on the characteristics of occasional drivers and the impact of transshipment nodes are presented as interesting managerial insights from 2EVRP-TN-OD.
format text
author YU, Vincent F.
NGUYEN, Minh P. K.
PUTRA, Kuza
GUNAWAN, Aldy
DHARMA, I. Gusti Bagus Budi
author_facet YU, Vincent F.
NGUYEN, Minh P. K.
PUTRA, Kuza
GUNAWAN, Aldy
DHARMA, I. Gusti Bagus Budi
author_sort YU, Vincent F.
title The Two-echelon vehicle routing problem with transshipment nodes and occasional drivers: Formulation and adaptive large neighborhood search heuristic
title_short The Two-echelon vehicle routing problem with transshipment nodes and occasional drivers: Formulation and adaptive large neighborhood search heuristic
title_full The Two-echelon vehicle routing problem with transshipment nodes and occasional drivers: Formulation and adaptive large neighborhood search heuristic
title_fullStr The Two-echelon vehicle routing problem with transshipment nodes and occasional drivers: Formulation and adaptive large neighborhood search heuristic
title_full_unstemmed The Two-echelon vehicle routing problem with transshipment nodes and occasional drivers: Formulation and adaptive large neighborhood search heuristic
title_sort two-echelon vehicle routing problem with transshipment nodes and occasional drivers: formulation and adaptive large neighborhood search heuristic
publisher Institutional Knowledge at Singapore Management University
publishDate 2022
url https://ink.library.smu.edu.sg/sis_research/10100
https://ink.library.smu.edu.sg/context/sis_research/article/11100/viewcontent/Two_EchelonVehicleRoutingProblem_2022_pvoa_cc_by.pdf
_version_ 1827070766595702784