Evolutionary algorithm with a directional local search for multiobjective optimization in combinatorial problems.
Krzysztof MichalakPublished in: GECCO (Companion) (2017)
Keyphrases
- combinatorial problems
- evolutionary algorithm
- multiobjective optimization
- multi objective
- combinatorial optimization
- simulated annealing
- optimization problems
- metaheuristic
- nsga ii
- tabu search
- multi objective optimization
- traveling salesman problem
- evolutionary computation
- genetic algorithm
- optimization algorithm
- combinatorial optimization problems
- memetic algorithm
- fitness function
- particle swarm optimization
- differential evolution
- constraint programming
- solving hard
- multiobjective evolutionary algorithm
- multiple objectives
- branch and bound algorithm
- multiobjective evolutionary algorithms
- constraint satisfaction
- genetic programming
- min max
- phase transition
- test problems
- benchmark problems
- job shop scheduling problem
- hill climbing
- optimal solution
- pareto optimal
- constraint satisfaction problems
- solution quality
- swarm intelligence
- branch and bound
- genetic algorithm ga
- bi objective
- search space
- search algorithm
- vehicle routing problem
- multi objective optimization problems
- ant colony optimization
- multi objective evolutionary algorithms
- artificial intelligence
- search strategies
- particle swarm optimization pso
- fuzzy systems
- knapsack problem
- feasible solution
- systematic search
- fuzzy logic