The Capacitated m Two-Node Survivable Star Problem: A Hybrid Metaheuristic Approach.
Gabriel BayáAntonio MauttoneFranco RobledoPablo RomeroPublished in: HM (2016)
Keyphrases
- hybrid metaheuristic
- vehicle routing problem
- network design problem
- routing problem
- metaheuristic
- scatter search
- tabu search
- benchmark problems
- benchmark instances
- traveling salesman problem
- multi objective
- combinatorial optimization
- variable neighborhood search
- particle swarm optimization
- special case
- travel time
- path relinking
- np hard
- memetic algorithm
- network design
- optical networks
- evolutionary algorithm
- search space
- lot sizing
- test problems
- approximation algorithms
- neural network
- search strategies
- directed graph
- ant colony optimization