Finding optimal solutions for vehicle routing problem with pickup and delivery services with time windows: A dynamic programming approach based on state–space–time network representations

•Model vehicle routing with real-world transportation networks and time-dependent link travel time.•Develop an efficient dynamic programming algorithm based on state–space–time networks.•Model pickup and delivery time window constraints using multi-dimensional network flow program.•Synchronize vehic...

Full description

Saved in:

Bibliographic Details
Published in:	Transportation research. Part B: methodological Vol. 89; pp. 19 - 42
Main Authors:	Mahmoudi, Monirehalsadat, Zhou, Xuesong
Format:	Journal Article
Language:	English
Published:	Elsevier Ltd 01.07.2016
Subjects:	Algorithms Forward dynamic programming Lagrangian relaxation Mathematical models Optimization Ride-sharing service optimization Route planning Route selection Time-dependent least-cost path problem Transportation networks Vehicle routing problem with pickup and delivery with time windows Vehicles Windows (intervals) USA, Illinois, Chicago Forward dynamic programming Time-dependent least-cost path problem Lagrangian relaxation Ride-sharing service optimization Vehicle routing problem with pickup and delivery with time windows
ISSN:	0191-2615, 1879-2367
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!