A Variable Neighborhood Search Approach for the S-labeling Problem.
Marcos RoblesSergio CaveroEduardo G. PardoPublished in: MIC (1) (2024)
Keyphrases
- variable neighborhood search
- metaheuristic
- tabu search
- neighborhood search
- minimum spanning tree
- heuristic methods
- traveling salesman problem
- routing problem
- hybrid method
- search procedure
- vehicle routing problem
- single machine scheduling problem
- benchmark instances
- path relinking
- simulated annealing
- combinatorial optimization
- optimization problems
- search space
- search algorithm
- genetic algorithm
- scheduling problem
- optimal solution