Evolutionary algorithm with a directional local search for multiobjective optimization in combinatorial problems.
Krzysztof MichalakPublished in: Optim. Methods Softw. (2016)
Keyphrases
- combinatorial problems
- evolutionary algorithm
- multiobjective optimization
- multi objective
- combinatorial optimization
- simulated annealing
- metaheuristic
- optimization problems
- nsga ii
- tabu search
- genetic algorithm
- traveling salesman problem
- multi objective optimization
- evolutionary computation
- constraint programming
- optimization algorithm
- fitness function
- combinatorial optimization problems
- multiobjective evolutionary algorithm
- multiobjective evolutionary algorithms
- branch and bound algorithm
- ant colony optimization
- memetic algorithm
- particle swarm optimization
- genetic programming
- differential evolution
- branch and bound
- swarm intelligence
- pareto optimal
- constraint satisfaction problems
- hill climbing
- benchmark problems
- solution quality
- search space
- solving hard
- search procedure
- phase transition
- test problems
- search algorithm
- min max
- multiple objectives
- multi objective optimization problems
- optimal solution
- crossover operator
- vehicle routing problem
- search strategies
- artificial bee colony
- knapsack problem
- constraint satisfaction
- job shop scheduling problem
- artificial immune system
- bi objective
- multi objective evolutionary algorithms
- cost function
- artificial neural networks
- genetic algorithm ga