کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
6935719 1449654 2018 12 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
An optimal data-splitting algorithm for aircraft scheduling on a single runway to maximize throughput
ترجمه فارسی عنوان
یک الگوریتم بهینه سازی داده تقسیم برای برنامه ریزی هواپیما در یک باند واحد برای به حداکثر رساندن توان
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نرم افزارهای علوم کامپیوتر
چکیده انگلیسی
In this research, we present a data-splitting algorithm to optimally solve the aircraft sequencing problem (ASP) on a single runway under both segregated and mixed-mode of operation. This problem is formulated as a 0-1 mixed-integer program (MIP), taking into account several realistic constraints, including safety separation standards, wide time-windows, and constrained position shifting, with the objective of maximizing the total throughput. Varied scenarios of large scale realistic instances of this problem, which is NP-hard in general, are computationally difficult to solve with the direct use of commercial solver as well as existing state-of-the-art dynamic programming method. The design of the algorithm is based on a recently introduced data-splitting algorithm which uses the divide-and-conquer paradigm, wherein the given set of flights is divided into several disjoint subsets, each of which is optimized using 0-1 MIP while ensuring the optimality of the entire set. Computational results show that the difficult instances can be solved in real-time and the solution is efficient in comparison to the commercial solver and dynamic programming, using both sequential, as well as parallel, implementation of this pleasingly parallel algorithm.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Transportation Research Part C: Emerging Technologies - Volume 95, October 2018, Pages 570-581
نویسندگان
, , ,