Separating capacity constraints in the CVRP using tabu search.
P. AugeratJosé-Manuel BelenguerEnrique BenaventÁngel CorberánDenis NaddefPublished in: Eur. J. Oper. Res. (1998)
Keyphrases
- capacity constraints
- tabu search
- feasible solution
- lagrangian relaxation
- simulated annealing
- minimum cost
- metaheuristic
- network flow
- bicriteria
- scheduling problem
- memetic algorithm
- flowshop
- path relinking
- search procedure
- heuristic methods
- search algorithm
- job shop scheduling problem
- hybrid algorithm
- genetic algorithm
- vehicle routing problem
- tabu search algorithm
- single item
- benchmark instances
- np hard
- benchmark problems
- optimization problems
- efficient solutions
- scatter search
- approximation algorithms
- linear programming
- multi item
- ant colony optimization
- multistage
- solution quality
- special case
- evolutionary algorithm
- neural network