Estimating attraction basin sizes of combinatorial optimization problems.
Anne ElorzaLeticia HernandoAlexander MendiburuJosé Antonio LozanoPublished in: Prog. Artif. Intell. (2018)
Keyphrases
- combinatorial optimization problems
- metaheuristic
- combinatorial optimization
- optimization problems
- knapsack problem
- discrete optimization
- ant colony optimization
- traveling salesman problem
- shortest path problem
- job shop scheduling
- job shop scheduling problem
- continuous optimization problems
- simulated annealing
- min cost
- tabu search
- vehicle routing problem
- search space
- rigid body
- river basin
- branch and bound
- dynamic programming
- special case
- data structure
- exact algorithms
- optimal solution
- information retrieval
- neural network