Single-item reformulations for a vendor managed inventory routing problem: Computational experience with benchmark instances.
Pasquale AvellaMaurizio BocciaLaurence A. WolseyPublished in: Networks (2015)
Keyphrases
- routing problem
- vehicle routing problem
- benchmark instances
- single item
- set of benchmark instances
- mathematical programming
- metaheuristic
- lot sizing
- vendor managed inventory
- traveling salesman problem
- tabu search
- lead time
- combinatorial auctions
- supply chain
- memetic algorithm
- infinite horizon
- combinatorial optimization
- benchmark problems
- travel time
- exact algorithms
- upper bound
- job shop scheduling problem
- combinatorial optimization problems
- long run
- ant colony optimization
- particle swarm optimization
- simulated annealing
- knapsack problem
- np hard
- finite horizon
- search algorithm
- optimization problems
- solution quality
- optimal policy
- special case
- neural network