A variable neighborhood search approach for the vertex bisection problem.
Alberto HerranJ. Manuel ColmenarAbraham DuartePublished in: Inf. Sci. (2019)
Keyphrases
- variable neighborhood search
- vertex set
- metaheuristic
- tabu search
- traveling salesman problem
- heuristic methods
- routing problem
- vehicle routing problem
- minimum spanning tree
- single machine scheduling problem
- hybrid method
- benchmark instances
- path relinking
- simulated annealing
- search procedure
- ant colony optimization
- directed graph
- weighted graph
- undirected graph
- combinatorial optimization problems
- memetic algorithm
- optimal solution
- benchmark problems
- feasible solution
- global optimization
- particle swarm optimization
- search space
- lower bound