Publication Type

Journal Article

Version

acceptedVersion

Publication Date

10-2021

Abstract

This research addresses a new variant of the vehicle routing problem, called the two-echelon vehicle routing problem with time windows, covering options, and occasional drivers (2E-VRPTW-CO-OD). In this problem, two types of fleets are available to serve customers, city freighters and occasional drivers (ODs), while two delivery options are available to customers, home delivery and alternative delivery. For customers choosing the alternative delivery, their demands are delivered to one of the available covering locations for them to pick up. The objective of 2E-VRPTW-CO-OD is to minimize the total cost consisting of routing costs, connection costs, and compensations paid to ODs while satisfying all demands. We formulate a mixed integer linear programming model and propose an effective adaptive large neighborhood search (ALNS) for solving 2E-VRPTW-CO-OD. In addition, the proposed ALNS provides comparable results with those obtained by state-of-the-art algorithms for the two echelon vehicle routing problem, which is a special case of 2E-VRPTW-CO-OD. Lastly, the effects of occasional drivers and covering locations are presented.

Keywords

Two-echelon vehicle routing, City logistics, Covering location, Occasional driver

Discipline

Artificial Intelligence and Robotics | Operations Research, Systems Engineering and Industrial Engineering | Transportation

Research Areas

Intelligent Systems and Optimization

Publication

Transportation Research Part E: Logistics and Transportation Review

Volume

154

First Page

1

Last Page

30

ISSN

1366-5545

Identifier

10.1016/j.tre.2021.102461

Publisher

Elsevier

Copyright Owner and License

Authors

Additional URL

https://doi.org/10.1016/j.tre.2021.102461

Download

Share

COinS