Open-source VRPLite Package for Vehicle Routing with Pickup and Delivery: A Path Finding Engine for Scheduled Transportation Systems

Xuesong Zhou, Lu Tong, Monirehalsadat Mahmoudi, Lijuan Zhuge, Yu Yao, Yongxiang Zhang, Pan Shang, Jiangtao Liu, Tie Shi

Research output: Contribution to journalArticle

9 Citations (Scopus)

Abstract

Recently, automation, shared use, and electrification are viewed as the “three revolutions” in the future transportation sector, and the traditional scheduled public transit system will be greatly enhanced with flexible services and autonomous vehicle scheduling capabilities. Many emerging scheduled transportation applications include the fully automatic operation system in urban rail transit, joint line planning, and timetabling for high-speed rail as well as emerging self-driving vehicle dispatching. The vehicle routing problem (VRP) holds promise for seeking an optimal set of vehicle routes and schedules to meet customers’ requirements and plays a vital role in optimizing services for feature scheduled transportation systems. Due to the difficulty of finding optimal solutions for large-scale instances, enormous research efforts have been dedicated to developing efficient algorithms, while our paper presents a unique perspective based on a time-dependent and state-dependent path searching framework. An open-source and light-weight VRP with pickup and delivery with time windows (VRPPDTW) modeling package, namely VRPLite, has been developed in this research to provide a high-quality and computationally efficient solution engine for transportation on demand applications. This paper describes the space–time–state modeling process of VRPPDTW using a hyper-network representation. This solution framework can be embedded in a column generation or Lagrangian relaxation framework to handle many general applications. A number of illustrated examples are presented to demonstrate the effectiveness of the path search algorithm under various traffic conditions and passenger travel requirements.

Original languageEnglish (US)
Pages (from-to)68-85
Number of pages18
JournalUrban Rail Transit
Volume4
Issue number2
DOIs
StatePublished - Jun 1 2018

Fingerprint

Vehicle routing
Pickups
transportation system
routing
engine
Engines
Rails
Light weight vehicles
Automation
automation
scheduling
customer
travel
electrification
traffic
planning
demand
Scheduling
modeling
Planning

Keywords

  • Column generation
  • Lagrangian relaxation
  • Space–time–state network modeling
  • Vehicle routing problem with pickup and delivery

ASJC Scopus subject areas

  • Civil and Structural Engineering
  • Geography, Planning and Development
  • Automotive Engineering
  • Transportation
  • Urban Studies
  • Electrical and Electronic Engineering

Cite this

Open-source VRPLite Package for Vehicle Routing with Pickup and Delivery : A Path Finding Engine for Scheduled Transportation Systems. / Zhou, Xuesong; Tong, Lu; Mahmoudi, Monirehalsadat; Zhuge, Lijuan; Yao, Yu; Zhang, Yongxiang; Shang, Pan; Liu, Jiangtao; Shi, Tie.

In: Urban Rail Transit, Vol. 4, No. 2, 01.06.2018, p. 68-85.

Research output: Contribution to journalArticle

Zhou, Xuesong ; Tong, Lu ; Mahmoudi, Monirehalsadat ; Zhuge, Lijuan ; Yao, Yu ; Zhang, Yongxiang ; Shang, Pan ; Liu, Jiangtao ; Shi, Tie. / Open-source VRPLite Package for Vehicle Routing with Pickup and Delivery : A Path Finding Engine for Scheduled Transportation Systems. In: Urban Rail Transit. 2018 ; Vol. 4, No. 2. pp. 68-85.
@article{9914a4fa36944958abab1545305396e9,
title = "Open-source VRPLite Package for Vehicle Routing with Pickup and Delivery: A Path Finding Engine for Scheduled Transportation Systems",
abstract = "Recently, automation, shared use, and electrification are viewed as the “three revolutions” in the future transportation sector, and the traditional scheduled public transit system will be greatly enhanced with flexible services and autonomous vehicle scheduling capabilities. Many emerging scheduled transportation applications include the fully automatic operation system in urban rail transit, joint line planning, and timetabling for high-speed rail as well as emerging self-driving vehicle dispatching. The vehicle routing problem (VRP) holds promise for seeking an optimal set of vehicle routes and schedules to meet customers’ requirements and plays a vital role in optimizing services for feature scheduled transportation systems. Due to the difficulty of finding optimal solutions for large-scale instances, enormous research efforts have been dedicated to developing efficient algorithms, while our paper presents a unique perspective based on a time-dependent and state-dependent path searching framework. An open-source and light-weight VRP with pickup and delivery with time windows (VRPPDTW) modeling package, namely VRPLite, has been developed in this research to provide a high-quality and computationally efficient solution engine for transportation on demand applications. This paper describes the space–time–state modeling process of VRPPDTW using a hyper-network representation. This solution framework can be embedded in a column generation or Lagrangian relaxation framework to handle many general applications. A number of illustrated examples are presented to demonstrate the effectiveness of the path search algorithm under various traffic conditions and passenger travel requirements.",
keywords = "Column generation, Lagrangian relaxation, Space–time–state network modeling, Vehicle routing problem with pickup and delivery",
author = "Xuesong Zhou and Lu Tong and Monirehalsadat Mahmoudi and Lijuan Zhuge and Yu Yao and Yongxiang Zhang and Pan Shang and Jiangtao Liu and Tie Shi",
year = "2018",
month = "6",
day = "1",
doi = "10.1007/s40864-018-0083-7",
language = "English (US)",
volume = "4",
pages = "68--85",
journal = "Urban Rail Transit",
issn = "2199-6687",
publisher = "Springer Verlag",
number = "2",

}

TY - JOUR

T1 - Open-source VRPLite Package for Vehicle Routing with Pickup and Delivery

T2 - A Path Finding Engine for Scheduled Transportation Systems

AU - Zhou, Xuesong

AU - Tong, Lu

AU - Mahmoudi, Monirehalsadat

AU - Zhuge, Lijuan

AU - Yao, Yu

AU - Zhang, Yongxiang

AU - Shang, Pan

AU - Liu, Jiangtao

AU - Shi, Tie

PY - 2018/6/1

Y1 - 2018/6/1

N2 - Recently, automation, shared use, and electrification are viewed as the “three revolutions” in the future transportation sector, and the traditional scheduled public transit system will be greatly enhanced with flexible services and autonomous vehicle scheduling capabilities. Many emerging scheduled transportation applications include the fully automatic operation system in urban rail transit, joint line planning, and timetabling for high-speed rail as well as emerging self-driving vehicle dispatching. The vehicle routing problem (VRP) holds promise for seeking an optimal set of vehicle routes and schedules to meet customers’ requirements and plays a vital role in optimizing services for feature scheduled transportation systems. Due to the difficulty of finding optimal solutions for large-scale instances, enormous research efforts have been dedicated to developing efficient algorithms, while our paper presents a unique perspective based on a time-dependent and state-dependent path searching framework. An open-source and light-weight VRP with pickup and delivery with time windows (VRPPDTW) modeling package, namely VRPLite, has been developed in this research to provide a high-quality and computationally efficient solution engine for transportation on demand applications. This paper describes the space–time–state modeling process of VRPPDTW using a hyper-network representation. This solution framework can be embedded in a column generation or Lagrangian relaxation framework to handle many general applications. A number of illustrated examples are presented to demonstrate the effectiveness of the path search algorithm under various traffic conditions and passenger travel requirements.

AB - Recently, automation, shared use, and electrification are viewed as the “three revolutions” in the future transportation sector, and the traditional scheduled public transit system will be greatly enhanced with flexible services and autonomous vehicle scheduling capabilities. Many emerging scheduled transportation applications include the fully automatic operation system in urban rail transit, joint line planning, and timetabling for high-speed rail as well as emerging self-driving vehicle dispatching. The vehicle routing problem (VRP) holds promise for seeking an optimal set of vehicle routes and schedules to meet customers’ requirements and plays a vital role in optimizing services for feature scheduled transportation systems. Due to the difficulty of finding optimal solutions for large-scale instances, enormous research efforts have been dedicated to developing efficient algorithms, while our paper presents a unique perspective based on a time-dependent and state-dependent path searching framework. An open-source and light-weight VRP with pickup and delivery with time windows (VRPPDTW) modeling package, namely VRPLite, has been developed in this research to provide a high-quality and computationally efficient solution engine for transportation on demand applications. This paper describes the space–time–state modeling process of VRPPDTW using a hyper-network representation. This solution framework can be embedded in a column generation or Lagrangian relaxation framework to handle many general applications. A number of illustrated examples are presented to demonstrate the effectiveness of the path search algorithm under various traffic conditions and passenger travel requirements.

KW - Column generation

KW - Lagrangian relaxation

KW - Space–time–state network modeling

KW - Vehicle routing problem with pickup and delivery

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

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

U2 - 10.1007/s40864-018-0083-7

DO - 10.1007/s40864-018-0083-7

M3 - Article

AN - SCOPUS:85048039511

VL - 4

SP - 68

EP - 85

JO - Urban Rail Transit

JF - Urban Rail Transit

SN - 2199-6687

IS - 2

ER -