Variable Neighborhood Search for the Elementary Shortest Path Problem with Loading Constraints.
Telmo PintoCláudio AlvesJosé M. Valério de CarvalhoPublished in: ICCSA (2) (2015)
Keyphrases
- shortest path problem
- variable neighborhood search
- shortest path
- metaheuristic
- combinatorial optimization problems
- bi objective
- minimum spanning tree
- benchmark instances
- hybrid method
- tabu search
- multiple objectives
- routing problem
- combinatorial problems
- ant colony optimization
- heuristic methods
- directed graph
- constraint satisfaction
- directed acyclic graph
- traveling salesman problem
- evolutionary algorithm