Showing papers by "Chris N. Potts published in 2011"
TL;DR: The techniques and tools of operational research and management science that are used for scheduling aircraft landings and take-offs are reviewed, including dynamic programming, branch and bound, heuristics and meta-heuristics.
Abstract: Airport runway optimization is an ongoing challenge for air traffic controllers. Since demand for air-transportation is predicted to increase, there is a need to realize additional take-off and landing slots through better runway scheduling. In this paper, we review the techniques and tools of operational research and management science that are used for scheduling aircraft landings and take-offs. The main solution techniques include dynamic programming, branch and bound, heuristics and meta-heuristics.
127 citations
19 Sep 2011
TL;DR: Computational results show that variable neighborhood search provides both the best-quality solutions and the fastest computation time compared to multi-start and tabu search.
Abstract: This paper considers a classical ship scheduling problem in which the routing and scheduling of a heterogeneous fleet of ships with time windows for pick-ups and deliveries at multiple ports is required. Assuming fixed ship speeds, the problem of maximising profit is addressed. A variable neighborhood search metaheuristic is proposed for this problem. A computational evaluation compares this variable neighborhood search procedure with multi-start local search and a previous tabu search approach. Computational results show that variable neighborhood search provides both the best-quality solutions and the fastest computation time compared to multi-start and tabu search.
27 citations
TL;DR: It is proved that problem Hamilton Cycle for the locally connected graphs with Δ ( G ) ⩽ 7 is NP-complete and extended the results of Kikust and Hendry on full cycle extendability of the connected, locallyconnected graphs with the maximum vertex degree bounded by 5.
18 citations