A decomposition based metaheuristic approach for solving rapid needs assessment routing problem.
Yurtsev MihçiogluErinç AlbeyPublished in: Comput. Ind. Eng. (2021)
Keyphrases
- routing problem
- metaheuristic
- vehicle routing problem
- scatter search
- combinatorial optimization
- variable neighborhood search
- tabu search
- path relinking
- ant colony optimization
- optimization problems
- mip solver
- benchmark instances
- simulated annealing
- vehicle routing problem with time windows
- genetic algorithm
- traveling salesman problem
- search methods
- search space
- particle swarm optimization
- iterated local search
- optimal solution
- memetic algorithm
- set partitioning
- travel time
- np hard
- suboptimal solutions
- multicommodity flow
- harmony search
- routing algorithm
- benchmark problems
- branch and bound