Selecting Good a Priori Sequences for Vehicle Routing Problem with Stochastic Demand.
Ei AndoBinay K. BhattacharyaYuzhuang HuTsunehiko KamedaQiaosheng ShiPublished in: ICTAC (2011)
Keyphrases
- vehicle routing problem
- stochastic demand
- infinite horizon
- tabu search
- metaheuristic
- inventory control
- vehicle routing
- routing problem
- benchmark problems
- combinatorial optimization
- np hard
- vehicle routing problem with time windows
- lead time
- travel time
- traveling salesman problem
- single item
- particle swarm optimization
- finite horizon
- pick up and delivery
- learning algorithm
- search strategies
- lost sales
- approximation algorithms
- shortest path
- scheduling problem
- vehicle routing problem with simultaneous