2366. Vehicle Routing Problem with Time Windows on a Signalized Road Network
Invited abstract in session TD-56: Routing with Time Windows, stream Vehicle Routing and Logistics.
Tuesday, 14:30-16:00Room: Liberty 1.11
Authors (first author is the speaker)
| 1. | Tsung-Sheng Chang
|
| Department of Transportation and Logistics Management, National Yang Ming Chiao Tung University | |
| 2. | Yen-Yu Chen
|
| Department of Transportation and Logistics Management, National Yang Ming Chiao Tung University | |
| 3. | Pei-Yu Sung
|
| Department of Transportation & Logistics Management, National Yang Ming Chiao Tung University |
Abstract
This research investigates the Vehicle Routing Problem with Time Windows (VRPTW) under pre-timed traffic signal conditions. Traditional vehicle routing models often neglect the impact of signal control, leading to suboptimal or infeasible solutions that violate time window constraints. Additionally, previous studies have struggled with accurately estimating link travel times. While some research has developed travel time prediction methods, these are primarily applied to the Shortest Path Problem and not to vehicle routing. To bridge this gap, this study integrates link travel time estimation into VRPTW within signalized road networks. A detailed graph structure is formulated to represent various vehicle movements through signalized intersections. To accurately capture the impact of pre-timed signals, piecewise linear functions are developed to model link travel times. The VRPTW is then formulated as a Mixed-Integer Linear Programming model, explicitly incorporating signalized road networks and strict time window constraints. A branch-and-price solution algorithm is designed to efficiently solve large-scale instances.
Keywords
- Vehicle Routing
Status: accepted
Back to the list of papers