Split-Delivery Capacitated Arc-Routing Problem: Lower Bound and Metaheuristic.
José-Manuel BelenguerEnrique BenaventNacima LabadiChristian PrinsMohamed ReghiouiPublished in: Transp. Sci. (2010)
Keyphrases
- metaheuristic
- lower bound
- optimal solution
- upper bound
- tabu search
- simulated annealing
- lower and upper bounds
- scatter search
- optimization problems
- ant colony optimization
- combinatorial optimization
- search space
- branch and bound algorithm
- np hard
- genetic algorithm
- branch and bound
- objective function
- vehicle routing problem
- path relinking
- worst case
- iterated local search
- particle swarm optimization
- nature inspired
- benchmark instances
- hybrid metaheuristic
- linear programming
- memetic algorithm
- job shop scheduling problem
- harmony search
- linear program
- multi start
- quadratic assignment problem
- linear programming relaxation
- search algorithm
- cutting plane
- evolutionary algorithm
- variable neighborhood search
- column generation
- solution quality
- differential evolution
- genetic algorithm ga
- guided local search
- constructive heuristic
- ant colony optimization metaheuristic