A variable neighborhood search for the multi-product inventory routing problem.
Anis MjirdaBassem JarbouiRita MacedoSaïd HanafiPublished in: Electron. Notes Discret. Math. (2012)
Keyphrases
- variable neighborhood search
- metaheuristic
- tabu search
- routing problem
- hybrid method
- heuristic methods
- benchmark instances
- traveling salesman problem
- minimum spanning tree
- ant colony optimization
- vehicle routing problem
- path relinking
- genetic algorithm
- single machine scheduling problem
- search procedure
- integer programming
- special case