A Variable Neighborhood Search Approach for the Capacitated m-Ring-Star Problem.
Carlos Alberto Franco-FrancoEduyn López-SantanaGermán Méndez-GiraldoPublished in: ICIC (1) (2016)
Keyphrases
- variable neighborhood search
- routing problem
- vehicle routing problem
- metaheuristic
- tabu search
- benchmark instances
- traveling salesman problem
- scatter search
- shortest path
- routing algorithm
- combinatorial optimization
- combinatorial optimization problems
- benchmark problems
- travel time
- minimum spanning tree
- heuristic methods
- memetic algorithm
- np hard
- particle swarm optimization
- path relinking
- global optimization
- single machine scheduling problem
- special case
- search procedure
- test instances
- dynamic programming
- genetic algorithm
- search strategies
- simulated annealing