Work

Vehicle routing with time windows : optimization and approximation

Year: 1987
Type: book-chapter
Abstract: This is a survey of solution methods for routing problems with time window constraints.Among the problems considered are the traveling salesman problem, the vehicle routing problem, the pickup and delivery problem, and the dial-a-ride problem.We present optimization algorithms that use branch and bound, dynamic programming and set partitioning, and approximation algorithms based on construction, iterative improvement and incomplete optimization.
Language: English
Open Access status: green
OpenAlex ID: W1537819703
FWCI: 9.659
Cites: 29
Cited by: 292
Related to: 10