Basic variable neighborhood search for the minimum sitting arrangement problem.
Eduardo G. PardoAntonio García-SánchezMarc SevauxAbraham DuartePublished in: J. Heuristics (2020)
Keyphrases
- variable neighborhood search
- metaheuristic
- tabu search
- traveling salesman problem
- routing problem
- vehicle routing problem
- path relinking
- single machine scheduling problem
- hybrid method
- heuristic methods
- benchmark instances
- minimum spanning tree
- search procedure
- ant colony optimization
- scatter search
- simulated annealing
- optimization problems
- minimum cost
- optimal solution
- global optimization
- combinatorial optimization
- linear programming
- np hard