A variable neighborhood descent heuristic for arc routing problems with time-dependent service costs.
Mariam TagmoutiMichel GendreauJean-Yves PotvinPublished in: Comput. Ind. Eng. (2010)
Keyphrases
- variable neighborhood descent
- multi start
- path relinking
- iterated local search
- search procedures
- tabu search
- metaheuristic
- variable neighborhood search
- web services
- search algorithm
- optimal solution
- service discovery
- global optimization
- search procedure
- service oriented
- search strategies
- traveling salesman problem
- simulated annealing
- integer programming
- service composition
- benchmark problems
- hill climbing
- web service composition
- minimum spanning tree
- service selection
- scatter search
- vehicle routing problem with time windows
- evolutionary algorithm