A Path Relinking-Based Approach for the Bi-Objective Double Floor Corridor Allocation Problem.
Nicolás R. UribeAlberto HerránJ. Manuel ColmenarPublished in: CAEPIA (2024)
Keyphrases
- bi objective
- path relinking
- metaheuristic
- ant colony optimization
- scatter search
- tabu search
- traveling salesman problem
- multi objective
- nsga ii
- efficient solutions
- max min
- search procedure
- multi objective optimization
- set covering problem
- routing problem
- nature inspired
- shortest path problem
- solution space
- network design
- optimization problems
- simulated annealing
- evolutionary algorithm
- combinatorial optimization
- multiple objectives
- combinatorial optimization problems
- neighborhood search
- grasp with path relinking
- vehicle routing problem
- genetic algorithm
- particle swarm optimization
- search space
- solution quality
- knapsack problem
- optimization algorithm
- genetic programming
- optimal solution
- test problems
- feasible solution
- variable neighborhood search
- objective function