Variable neighborhood search for the Vertex Separation Problem.
Abraham DuarteLaureano F. EscuderoRafael MartíNenad MladenovicJuan José PantrigoJesús Sánchez-OroPublished in: Comput. Oper. Res. (2012)
Keyphrases
- variable neighborhood search
- metaheuristic
- tabu search
- traveling salesman problem
- heuristic methods
- hybrid method
- routing problem
- minimum spanning tree
- single machine scheduling problem
- vehicle routing problem
- benchmark instances
- path relinking
- search procedure
- simulated annealing
- scatter search
- search space
- single machine
- hybrid algorithm
- processing times
- combinatorial problems
- combinatorial optimization
- efficient solutions