On the worst-case performance of some heuristics for the vehicle routing and scheduling problem with time window constraints.
Marius M. SolomonPublished in: Networks (1986)
Keyphrases
- vehicle routing
- scheduling problem
- worst case
- np hard
- list scheduling
- travel time
- vehicle routing problem
- logistics distribution
- single machine
- column generation
- vehicle routing problems with time windows
- inventory management
- worst case analysis
- vehicle routing and scheduling
- tabu search
- routing problem
- average case
- flowshop
- production scheduling
- running times
- upper bound
- search strategies
- road network
- constraint satisfaction
- parallel machines
- lower bound
- search algorithm