Bi-objective corridor allocation problem using a permutation-based genetic algorithm hybridized with a local search technique.
Zahnupriya KalitaDilip DattaGintaras PalubeckisPublished in: Soft Comput. (2019)
Keyphrases
- bi objective
- genetic algorithm
- multi objective
- multi objective optimization
- job shop scheduling problem
- memetic algorithm
- global search
- pareto local search
- particle swarm optimization
- ant colony optimization
- genetic algorithm ga
- nsga ii
- efficient solutions
- evolutionary algorithm
- multiple objectives
- fitness function
- tabu search
- set covering problem
- hybrid ga
- crossover operator
- simulated annealing
- optimization algorithm
- initial population
- artificial neural networks
- mobile robot
- neural network
- genetic operators
- hybrid algorithms
- metaheuristic
- search procedure
- selection operator
- network design
- search space
- genetic programming
- hybrid algorithm
- optimal solution
- shortest path problem
- explore the search space
- differential evolution
- global optimization
- optimization problems
- knapsack problem
- mutation operator
- lower bound
- objective function
- combinatorial optimization
- multi objective evolutionary algorithms
- neighborhood search
- hill climbing
- routing problem
- search strategies