Publication Type

Conference Proceeding Article

Version

publishedVersion

Publication Date

8-2023

Abstract

The heterogeneous vehicle routing problem with time windows (HVRPTW) employs various vehicles with different capacities to serve upcoming pickup and delivery orders. We introduce a HVRPTW variant for reflecting the practical needs of crowd-shipping by considering the mass-rapid-transit stations, as the additional terminal points. A mixed integer linear programming model is formulated. An Adaptive Large Neighborhood Search based meta-heuristic is also developed by utilizing a basic probabilistic selection strategy, i.e. roulette wheel, and Simulated Annealing. The proposed approach is empirically evaluated on a new set of benchmark instances. The computational results revealed that ALNS shows its clear advantage on the instances with the increasing number of vehicles, especially compared to commercial software, CPLEX.

Keywords

Adaptive large neighborhood searches, Heterogeneous vehicles, Mass rapid transit, Metaheuristic, Mixed integer linear programming model, Pickup and delivery, Probabilistics, Search-based, Terminal points, Vehicle routing problem with time windows

Discipline

Databases and Information Systems | Transportation

Research Areas

Data Science and Engineering

Publication

Proceedings of the 19th IEEE International Conference on Automation Science and Engineering (CASE), Auckland, New Zealand, 2023 Aug 26-30

Volume

2023

ISBN

9798350320695

Identifier

10.1109/CASE56687.2023

Publisher

IEEE

City or Country

New York

Additional URL

https://doi.org/10.1109/CASE56687.2023.10260380

Download

Share

COinS