Coloring graphs by iterated local search traversing feasible and infeasible solutions.
Massimiliano CaramiaPaolo Dell'OlmoPublished in: Discret. Appl. Math. (2008)
Keyphrases
- infeasible solutions
- iterated local search
- tabu search
- feasible solution
- benchmark problems
- multidimensional knapsack problem
- metaheuristic
- vehicle routing problem with time windows
- test problems
- vehicle routing problem
- genetic algorithm
- simulated annealing
- solution space
- multi start
- scheduling problem
- objective function
- lagrangian relaxation
- solution quality
- optimization problems
- design space
- evolution strategy
- heuristic methods
- optimal solution
- mixed integer
- combinatorial optimization
- search algorithm
- flowshop
- linear programming
- particle swarm optimization
- valid inequalities
- special case
- knapsack problem
- ant colony optimization
- global optimization