The Use of Metaheuristics based on Clusters of Particles for Problem Solving in Combinatorial Optimization: A Case Study of CVRP.
Alberto GómezDavid de la FuenteNazario GarcíaJavier PuenteJosé ParreñoPublished in: IC-AI (2010)
Keyphrases
- combinatorial optimization
- metaheuristic
- combinatorial optimization problems
- traveling salesman problem
- vehicle routing problem
- simulated annealing
- clustering algorithm
- combinatorial problems
- optimization problems
- branch and bound algorithm
- branch and bound
- hard combinatorial optimization problems
- mathematical programming
- quadratic assignment problem
- path relinking
- scatter search
- tabu search
- special case
- memetic algorithm
- evolutionary algorithm
- test instances
- benchmark instances
- optimal solution