Can the global optimum of a combinatorial optimization problem be reliably estimated through extreme value theory?
Luis VelascoHéctor GuerreroAntonio HospitalerPublished in: Swarm Evol. Comput. (2022)
Keyphrases
- combinatorial optimization
- global optimum
- extreme value theory
- simulated annealing
- metaheuristic
- optimization method
- global convergence
- traveling salesman problem
- search space
- combinatorial optimization problems
- tabu search
- evolutionary algorithm
- branch and bound algorithm
- genetic algorithm
- branch and bound
- combinatorial problems
- benchmark problems
- objective function
- optimal solution
- mathematical programming
- optimization problems
- trust region
- global solution
- faster convergence
- optimization methods
- global minimum
- quadratic assignment problem
- hybrid algorithm
- neural network
- particle swarm optimization pso
- search algorithm
- multi objective
- hard combinatorial optimization problems
- swarm intelligence
- estimation of distribution algorithms
- vehicle routing problem
- single machine scheduling problem
- computational complexity
- combinatorial search
- genetic algorithm ga