Solving the Pickup and Delivery Problem with Time Windows using "Squeaky Wheel" Optimization with Local Search
The Pickup and Delivery Problem with Time Windows (PDPTW) is an important problem in fleet planning where decisions can involve not only dispatching company fleets but also the selection of carriers on certain routes. In this problem, vehicles travel to a variety of locations to deliver or pick up g...
Saved in:
Main Authors: | LIM, Hongping, LIM, Andrew, RODRIGUES, Brian |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2002
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/lkcsb_research/1963 https://ink.library.smu.edu.sg/context/lkcsb_research/article/2962/viewcontent/SolvingPickupDeliveryProblemTimeWindows_2002.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Minimizing the Makespan for Unrelated Parallel Machines
by: GUO, Yunsong, et al.
Published: (2007) -
An assignment-based local search method for solving vehicle routing problems
by: Zeng, L., et al.
Published: (2014) -
A generalized crossing local search method for solving vehicle routing problems
by: Zeng, L., et al.
Published: (2014) -
Vehicle routing problem with a heterogeneous fleet and time windows
by: Jiang, J., et al.
Published: (2014) -
Local search with annealing-like restarts to solve the vehicle routing problem with time windows
by: Li, H., et al.
Published: (2013)