A variable neighborhood search approach for the crew pairing problem.
Alba AgustínAngel A. JuanEduardo G. PardoPublished in: Electron. Notes Discret. Math. (2017)
Keyphrases
- variable neighborhood search
- crew pairing
- crew scheduling
- metaheuristic
- tabu search
- set covering
- heuristic methods
- traveling salesman problem
- routing problem
- minimum spanning tree
- single machine scheduling problem
- hybrid method
- path relinking
- benchmark instances
- search procedure
- vehicle routing problem
- simulated annealing
- lagrangian relaxation
- integer programming
- optimal solution
- neural network
- memetic algorithm
- optimization problems
- genetic algorithm