An adaptive neighborhood search metaheuristic for the integrated railway rapid transit network design and line planning problem.
David CancaAlicia De-Los-SantosGilbert LaporteJuan A. MesaPublished in: Comput. Oper. Res. (2017)
Keyphrases
- network design
- neighborhood search
- metaheuristic
- rapid transit
- path relinking
- simulated annealing
- variable neighborhood search
- nature inspired
- vehicle routing problem
- tabu search
- scatter search
- ant colony optimization
- combinatorial optimization
- traveling salesman problem
- optimization problems
- communication networks
- genetic algorithm
- optimal solution
- search space
- solution space
- search methods
- search procedure
- network architecture
- benchmark instances
- evolutionary algorithm
- particle swarm optimization
- benchmark problems
- bi objective
- swarm intelligence
- heuristic search
- particle swarm optimization pso
- heuristic methods
- routing problem
- solution quality
- max min
- branch and bound
- memetic algorithm
- scheduling problem