MaxMinMin p-dispersion problem: A variable neighborhood search approach.
Behnaz SaboonchiPierre HansenSylvain PerronPublished in: Comput. Oper. Res. (2014)
Keyphrases
- variable neighborhood search
- metaheuristic
- tabu search
- traveling salesman problem
- neighborhood search
- heuristic methods
- routing problem
- single machine scheduling problem
- hybrid method
- minimum spanning tree
- vehicle routing problem
- benchmark instances
- search procedure
- path relinking
- search space
- genetic algorithm
- optimization problems
- simulated annealing
- single machine
- feasible solution
- combinatorial optimization problems
- memetic algorithm
- combinatorial optimization
- ant colony optimization
- dynamic programming
- optimal solution
- neural network