Branch-and-price-and-cut for the synchronized vehicle routing problem with split delivery, proportional service time and multiple time windows

Jiliu Li, Hu Qin*, Roberto Baldacci, Wenbin Zhu

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

57 Citations (Scopus)

Abstract

This study addresses a vehicle routing problem (VRP) in which demands are discrete, split delivery is allowed, service time is proportional to the units of delivered products, multiple time windows are provided and the demand of each customer must be delivered in only one time window (this requirement is termed synchronization constraint). We formulate this problem into a three-index vehicle-flow model and a set-covering model. Then, we propose a branch-and-price-and-cut algorithm to solve the problem. We compare our branch-and-price-and-cut algorithm with CPLEX based on 252 randomly generated instances and the computational results demonstrate the effectiveness of our algorithm.

Original languageEnglish
Article number101955
JournalTransportation Research Part E: Logistics and Transportation Review
Volume140
DOIs
Publication statusPublished - Aug 2020
Externally publishedYes

Keywords

  • Branch and price and cut
  • Multiple time windows
  • Split delivery
  • Synchronization
  • Vehicle routing

Fingerprint

Dive into the research topics of 'Branch-and-price-and-cut for the synchronized vehicle routing problem with split delivery, proportional service time and multiple time windows'. Together they form a unique fingerprint.

Cite this