A tabu search-based heuristic for a new capacitated cyclic inventory routing problem.
Mehdi SeifbarghyZahra SamadiPublished in: Int. J. Math. Oper. Res. (2014)
Keyphrases
- tabu search
- vehicle routing problem
- simulated annealing
- metaheuristic
- benchmark instances
- feasible solution
- scheduling problem
- heuristic methods
- search procedure
- memetic algorithm
- job shop scheduling problem
- search algorithm
- iterated local search
- test problems
- path relinking
- variable neighborhood search
- genetic algorithm
- quadratic assignment problem
- initial solution
- tabu search algorithm
- multi start
- multidimensional knapsack problem
- routing problem
- np hard
- variable neighbourhood search
- lot sizing
- test instances
- hybrid algorithm
- hill climbing
- tabu list
- scatter search
- simulated annealing and tabu search
- vehicle routing problem with time windows
- ant colony optimization
- search heuristics
- integer programming
- max sat
- evolutionary algorithm
- search space
- neural network
- combinatorial optimization
- flowshop
- optimization problems
- optimal solution
- mathematical programming
- graph colouring
- combinatorial optimization problems