TRB Pubsindex
Text Size:

Title:

How Many Vehicles Do We Need? Synchronizing Transfers in Pickup and Delivery Problem

Accession Number:

01660456

Record Type:

Component

Abstract:

The pickup and delivery problem with time windows and synchronized transfers is a challenging version of the vehicle routing problem. In this paper, the authors impose complex assignment-routing constraints corresponding to this problem by constructing multi-dimensional networks. More specifically, the authors introduce a multi-vehicle state-space-time network in which only non-dominated assignment-based hyper paths are examined. They then reach optimality for local clusters derived from a large set of passengers on real-world transportation networks. Extensive experiments over the standard instances proposed by Ropke and Cordeau (2009) and real world data sets from Cainiao competition show the solution optimality, as well as computational efficiency of the developed algorithm.

Supplemental Notes:

This paper was sponsored by TRB committee AP020 Standing Committee on Emerging and Innovative Public Transport and Technologies.

Report/Paper Numbers:

18-06764

Language:

English

Authors:

Mahmoudi, Monirehalsadat
Chen, Junhua
Shi, Tie
Zhang, Yongxiang
Zhou, Xuesong

Pagination:

17p

Publication Date:

2018

Conference:

Transportation Research Board 97th Annual Meeting

Location: Washington DC, United States
Date: 2018-1-7 to 2018-1-11
Sponsors: Transportation Research Board

Media Type:

Digital/other

Features:

Figures; References; Tables

Subject Areas:

Freight Transportation; Highways; Operations and Traffic Management; Vehicles and Equipment

Source Data:

Transportation Research Board Annual Meeting 2018 Paper #18-06764

Files:

TRIS, TRB, ATRI

Created Date:

Jan 8 2018 11:45AM