A Sensitive Metaheuristic for Solving a Large Optimization Problem.
Camelia-Mihaela PinteaCamelia ChiraD. DumitrescuPetrica C. PopPublished in: SOFSEM (2008)
Keyphrases
- metaheuristic
- combinatorial optimization
- optimization problems
- simulated annealing
- optimization method
- suboptimal solutions
- tabu search
- ant colony optimization
- harmony search
- combinatorial optimization problems
- scatter search
- combinatorial problems
- traveling salesman problem
- optimal solution
- path relinking
- search space
- evolutionary algorithm
- iterated local search
- mip solver
- hybrid algorithms
- continuous optimization
- vehicle routing problem
- mathematical programming
- benchmark instances
- genetic algorithm
- particle swarm optimization
- memetic algorithm
- benchmark problems
- branch and bound
- variable neighborhood search
- metaheuristic algorithms
- guided local search
- objective function
- exact algorithms
- branch and bound algorithm
- nature inspired
- multi start
- hybrid metaheuristic
- feasible solution
- optimization algorithm
- max min
- estimation of distribution algorithms
- knapsack problem
- ant colony optimization metaheuristic