A cumulative service state representation for the pickup and delivery problem with transfers

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

Research output: Contribution to journalArticle

Abstract

The pickup and delivery problem with transfers is a challenging version of the vehicle routing problem. In order to tackle this problem, we add a time dimension to physical transportation networks to not only track the location of vehicles at any time but also impose parcels’ pickup/delivery time windows, synchronization time points, and precedence constraints to the problem. We also add another dimension, described as the “cumulative service state” to the constructed space-time network to track the service status of parcels at any time. The constructed network not only handles real-life transportation networks but also is well-suited for connecting microscopic cumulative service states to macroscopic cumulative flow count diagrams. We develop a continuous time approximation approach using cumulative arrival, departure, and on-board count diagrams to effectively assess the performance of the system and dynamically constrict the search space. To handle a large-scale set of parcels, we develop the traditional cluster-first, route-second approach. We reach optimality for the clusters derived from the original set of parcels. We also propose an integer programming model to improve the vehicles’ efficiency. We perform extensive numerical experiments over the standard data set used by Ropke and Pisinger (2006) and real-world large-scale data set proposed by Cainiao Network (with about 10,000 delivery orders) to examine the computational efficiency of our developed algorithm.

Original languageEnglish (US)
Pages (from-to)351-380
Number of pages30
JournalTransportation Research Part B: Methodological
Volume129
DOIs
StatePublished - Nov 2019

Fingerprint

Pickups
Vehicle routing
Integer programming
Computational efficiency
Synchronization
Experiments
efficiency
time
programming
experiment
performance

Keywords

  • Cumulative flow count diagrams
  • Cumulative service states
  • Dynamic programming
  • Lagrangian heuristics
  • Pickup and delivery problems with transfers

ASJC Scopus subject areas

  • Civil and Structural Engineering
  • Transportation

Cite this

A cumulative service state representation for the pickup and delivery problem with transfers. / Mahmoudi, Monirehalsadat; Chen, Junhua; Shi, Tie; Zhang, Yongxiang; Zhou, Xuesong.

In: Transportation Research Part B: Methodological, Vol. 129, 11.2019, p. 351-380.

Research output: Contribution to journalArticle

Mahmoudi, Monirehalsadat ; Chen, Junhua ; Shi, Tie ; Zhang, Yongxiang ; Zhou, Xuesong. / A cumulative service state representation for the pickup and delivery problem with transfers. In: Transportation Research Part B: Methodological. 2019 ; Vol. 129. pp. 351-380.
@article{5745461d8b824ffea5844199b7bdbe7a,
title = "A cumulative service state representation for the pickup and delivery problem with transfers",
abstract = "The pickup and delivery problem with transfers is a challenging version of the vehicle routing problem. In order to tackle this problem, we add a time dimension to physical transportation networks to not only track the location of vehicles at any time but also impose parcels’ pickup/delivery time windows, synchronization time points, and precedence constraints to the problem. We also add another dimension, described as the “cumulative service state” to the constructed space-time network to track the service status of parcels at any time. The constructed network not only handles real-life transportation networks but also is well-suited for connecting microscopic cumulative service states to macroscopic cumulative flow count diagrams. We develop a continuous time approximation approach using cumulative arrival, departure, and on-board count diagrams to effectively assess the performance of the system and dynamically constrict the search space. To handle a large-scale set of parcels, we develop the traditional cluster-first, route-second approach. We reach optimality for the clusters derived from the original set of parcels. We also propose an integer programming model to improve the vehicles’ efficiency. We perform extensive numerical experiments over the standard data set used by Ropke and Pisinger (2006) and real-world large-scale data set proposed by Cainiao Network (with about 10,000 delivery orders) to examine the computational efficiency of our developed algorithm.",
keywords = "Cumulative flow count diagrams, Cumulative service states, Dynamic programming, Lagrangian heuristics, Pickup and delivery problems with transfers",
author = "Monirehalsadat Mahmoudi and Junhua Chen and Tie Shi and Yongxiang Zhang and Xuesong Zhou",
year = "2019",
month = "11",
doi = "10.1016/j.trb.2019.09.015",
language = "English (US)",
volume = "129",
pages = "351--380",
journal = "Transportation Research, Series B: Methodological",
issn = "0191-2615",
publisher = "Elsevier Limited",

}

TY - JOUR

T1 - A cumulative service state representation for the pickup and delivery problem with transfers

AU - Mahmoudi, Monirehalsadat

AU - Chen, Junhua

AU - Shi, Tie

AU - Zhang, Yongxiang

AU - Zhou, Xuesong

PY - 2019/11

Y1 - 2019/11

N2 - The pickup and delivery problem with transfers is a challenging version of the vehicle routing problem. In order to tackle this problem, we add a time dimension to physical transportation networks to not only track the location of vehicles at any time but also impose parcels’ pickup/delivery time windows, synchronization time points, and precedence constraints to the problem. We also add another dimension, described as the “cumulative service state” to the constructed space-time network to track the service status of parcels at any time. The constructed network not only handles real-life transportation networks but also is well-suited for connecting microscopic cumulative service states to macroscopic cumulative flow count diagrams. We develop a continuous time approximation approach using cumulative arrival, departure, and on-board count diagrams to effectively assess the performance of the system and dynamically constrict the search space. To handle a large-scale set of parcels, we develop the traditional cluster-first, route-second approach. We reach optimality for the clusters derived from the original set of parcels. We also propose an integer programming model to improve the vehicles’ efficiency. We perform extensive numerical experiments over the standard data set used by Ropke and Pisinger (2006) and real-world large-scale data set proposed by Cainiao Network (with about 10,000 delivery orders) to examine the computational efficiency of our developed algorithm.

AB - The pickup and delivery problem with transfers is a challenging version of the vehicle routing problem. In order to tackle this problem, we add a time dimension to physical transportation networks to not only track the location of vehicles at any time but also impose parcels’ pickup/delivery time windows, synchronization time points, and precedence constraints to the problem. We also add another dimension, described as the “cumulative service state” to the constructed space-time network to track the service status of parcels at any time. The constructed network not only handles real-life transportation networks but also is well-suited for connecting microscopic cumulative service states to macroscopic cumulative flow count diagrams. We develop a continuous time approximation approach using cumulative arrival, departure, and on-board count diagrams to effectively assess the performance of the system and dynamically constrict the search space. To handle a large-scale set of parcels, we develop the traditional cluster-first, route-second approach. We reach optimality for the clusters derived from the original set of parcels. We also propose an integer programming model to improve the vehicles’ efficiency. We perform extensive numerical experiments over the standard data set used by Ropke and Pisinger (2006) and real-world large-scale data set proposed by Cainiao Network (with about 10,000 delivery orders) to examine the computational efficiency of our developed algorithm.

KW - Cumulative flow count diagrams

KW - Cumulative service states

KW - Dynamic programming

KW - Lagrangian heuristics

KW - Pickup and delivery problems with transfers

UR - http://www.scopus.com/inward/record.url?scp=85073570567&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85073570567&partnerID=8YFLogxK

U2 - 10.1016/j.trb.2019.09.015

DO - 10.1016/j.trb.2019.09.015

M3 - Article

AN - SCOPUS:85073570567

VL - 129

SP - 351

EP - 380

JO - Transportation Research, Series B: Methodological

JF - Transportation Research, Series B: Methodological

SN - 0191-2615

ER -