A metaheuristic for crew scheduling in a pickup-and-delivery problem with time windows.
Mauro LucciDaniel SeverínPaula ZabalaPublished in: CoRR (2021)
Keyphrases
- metaheuristic
- crew scheduling
- vehicle routing problem
- integer programming
- tabu search
- optimization problems
- optimization model
- simulated annealing
- search space
- crew pairing
- ant colony optimization
- combinatorial optimization
- genetic algorithm
- routing problem
- benchmark instances
- scatter search
- vehicle routing problem with time windows
- optimal solution
- hybrid metaheuristic
- iterated local search
- travel time
- path relinking
- traveling salesman problem
- nature inspired
- memetic algorithm
- particle swarm optimization
- set of benchmark instances
- guided local search
- mathematical programming
- multi start
- greedy randomized adaptive search procedure
- optimization method
- feasible solution
- variable neighborhood search
- network flow
- branch and bound algorithm
- lagrangian relaxation
- set covering
- metaheuristic algorithms
- routing decisions
- harmony search
- cost function
- column generation
- neural network