New benchmark instances for the inventory routing problem.
Jørgen SkålnesMohamed Ben AhmedLars Magnus HvattumMagnus StålhanePublished in: Eur. J. Oper. Res. (2024)
Keyphrases
- benchmark instances
- metaheuristic
- tabu search
- memetic algorithm
- exact algorithms
- vehicle routing problem
- job shop scheduling problem
- integer programming
- traveling salesman problem
- solution quality
- variable neighborhood search
- set of benchmark instances
- simulated annealing
- feasible solution
- combinatorial optimization problems
- genetic algorithm
- combinatorial optimization
- test instances
- np hard
- approximation algorithms
- optimization problems
- particle swarm optimization
- scheduling problem
- evolutionary computation
- heuristic methods
- search algorithm
- ant colony optimization
- computational complexity
- neural network
- multi objective
- graph model
- benchmark problems
- computational efficiency