Evolutionary Algorithm based on simulated annealing for the multi-objective optimization of combinatorial problems.
Elias David Niño RuizHenry Nieto ParraAnangelica Isabel Chinchilla CamargoPublished in: Int. J. Comb. Optim. Probl. Informatics (2013)
Keyphrases
- evolutionary algorithm
- combinatorial problems
- multi objective optimization
- simulated annealing
- metaheuristic
- combinatorial optimization
- multi objective
- optimization problems
- tabu search
- evolutionary computation
- traveling salesman problem
- genetic algorithm
- differential evolution
- graph coloring
- constraint programming
- solving hard
- nsga ii
- benchmark problems
- optimization method
- solution quality
- genetic programming
- hill climbing
- genetic algorithm ga
- fitness function
- multiple objectives
- ant colony optimization
- multi objective optimization problems
- pareto optimal
- multi objective genetic algorithm
- solving multi objective optimization problems
- hybrid evolutionary algorithm
- constraint satisfaction problems
- evolutionary strategy
- bi objective
- genetic operators
- crossover operator
- branch and bound algorithm
- particle swarm optimization pso
- job shop scheduling problem
- mutation operator
- constraint satisfaction
- particle swarm
- multiobjective optimization
- optimization algorithm
- multi objective evolutionary algorithms
- pareto optimal set
- constraint propagation
- neural network
- multi objective genetic algorithms