A variable neighborhood search for the capacitated arc routing problem with intermediate facilities.
Michael PolacekKarl F. DoernerRichard F. HartlVittorio ManiezzoPublished in: J. Heuristics (2008)
Keyphrases
- variable neighborhood search
- routing problem
- memetic algorithm
- tabu search
- metaheuristic
- benchmark instances
- traveling salesman problem
- heuristic methods
- vehicle routing problem
- hybrid method
- single machine scheduling problem
- lower bound
- path relinking
- minimum spanning tree
- combinatorial optimization
- valid inequalities
- search procedure
- lower and upper bounds
- routing algorithm
- neural network
- search space
- genetic algorithm
- travel time
- combinatorial problems
- optimization problems
- scheduling problem
- special case
- search algorithm
- objective function