An approach to the MOGAS initialization problem using an algorithm based on path relinking.
Thiago Gomes Nepomuceno da SilvaJosé Everardo Bessa MaiaLeonardo Sampaio RochaPublished in: SAC (2015)
Keyphrases
- k means
- path relinking
- computational complexity
- exhaustive search
- dynamic programming
- optimal solution
- test problems
- search procedure
- combinatorial optimization
- tabu search
- optimization algorithm
- computationally efficient
- simulated annealing
- search space
- lower bound
- objective function
- computational efficiency
- traveling salesman problem
- solution quality
- multi objective
- scatter search
- stochastic approximation
- multi start