A variable neighborhood search for optimal scheduling and routing of take-off and landing aircraft.
Marcella SamaAndrea D'ArianoAlessandro ToliDario PacciarelliFrancesco CormanPublished in: MT-ITS (2015)
Keyphrases
- variable neighborhood search
- optimal scheduling
- routing problem
- scheduling problem
- tabu search
- vehicle routing problem
- metaheuristic
- routing algorithm
- traveling salesman problem
- scheduling algorithm
- np hard
- single machine scheduling problem
- hybrid method
- heuristic methods
- minimum spanning tree
- shortest path
- single machine
- path relinking
- travel time
- benchmark instances
- scatter search
- routing protocol
- search procedure
- neural network
- genetic algorithm