Robustness and diversity in genetic algorithms for a complex combinatorial optimization problem.
Carlos A. BrizuelaNobuo SannomiyaPublished in: Int. J. Syst. Sci. (2001)
Keyphrases
- combinatorial optimization
- metaheuristic
- simulated annealing
- genetic algorithm
- traveling salesman problem
- combinatorial optimization problems
- branch and bound algorithm
- optimization problems
- branch and bound
- memetic algorithm
- quadratic assignment problem
- evolutionary algorithm
- tabu search
- mathematical programming
- multi objective
- combinatorial problems
- neural network
- genetic programming
- evolutionary computation
- fitness function
- optimization method
- benchmark problems
- vehicle routing problem
- graph theory
- ant colony optimization
- particle swarm optimization
- estimation of distribution algorithms
- scatter search
- combinatorial search
- path relinking
- hard combinatorial optimization problems
- max flow min cut
- hybrid algorithm
- artificial neural networks
- search space
- upper bound