Constraint guided search for aircraft sequencing

Abstract

Aircraft sequencing problem (ASP) is an NP-Hard problem. It involves allocation of aircraft to runways for landing and takeoff, minimising total tardiness. ASP has made significant progress in recent years. However, within practical time limits, existing incomplete algorithms still either find low quality solutions or struggle with large problems. One key reason behind this is the typical way of using generic heuristics or metaheuristics that usually lack problem specific structural knowledge. As a result, existing such methods use either an exhaustive or a random neighbourhood generation strategy. So their search guidance comes only from the evaluation function that is used mainly after the neighbourhood generation. In this work, we aim to advance ASP search by better exploiting the problem specific structural knowledge. We use the constraint and the objective functions to obtain such problem specific knowledge and we exploit such knowledge both in a constructive search method and in a local search method. Our motivation comes from the constraint optimisation paradigm in artificial intelligence, where instead of random decisions, constraint-guided more informed optimisation decisions are of particular interest. We run our experiments on a range of standard benchmark problem instances that include instances from real airports and instances crafted using real airport parameters, and contain scenarios involving multiple runways and both landing and takeoff operations. We show that our proposed algorithms significantly outperform existing state-of-the-art aircraft sequencing algorithms.

Rancangan Restrukturisasi VFR Route : Sebuah Studi Kasus Dari Majalengka CTR Perum LPPNPI Unit Kertajati

“…Perancangan VFR route dilakukan dengan menggunakan simplified/standard method dengan pembuktian masalah yang mengikuti prosedur. Personel Air Traffic Controller (ATC) yang memberikan pelayanan penerbangan VFR dan IFR harus mampu menjaga separasi dan urutan pesawat agar keselamatan penerbangan terjaga namun tanpa mengurangi efisiensi serta kelancaran arus lalu lintas udara (Liu & Zhang, 2019) dan (Purwanto, 2014) (Riahi, Newton, Polash, Su, & Sattar, 2019) untuk mengatasi permasalahan efisiensi lalu lintas penerbangan. Beberapa peneliti lainnya memberikan solusi terkait efisiensi lalu lintas penerbangan melalui kesadaran terhadap kondisi lingkungan dan iklim (Takeichi, Kaida, Shimomura, & Yamauchi, 2017), (Santos, Monteiro, Studic, & Majumdar, 2017), (Kwasiborska, 2017), dan (Hrastovec & Solina, 2016) Berdasarkan uraian di atas, disimpulkan bahwa pelaksanaan pemberian pelayanan lalu lintas penerbangan pada Perum LPPNPI unit Kertajati saat ini masih terdapat suatu permasalahan pada efisiensi lalu lintas penerbangan.…”

A Decision Support Framework for Aircraft Arrival Scheduling and Trajectory Optimization in Terminal Maneuvering Areas

“…Furthermore, the environmental and health impacts of air traffic have prompted increased scrutiny from both the government and the public, primarily due to concerns related to noise and emissions. Consequently, aviation authorities continuously set ambitious targets to address various aspects of Air Traffic Management (ATM), including increasing airport capacity, minimizing aircraft delays, and reducing the environmental impact of air traffic while adhering to ATM safety regulations [5,6].…”

Constraint based local search for flowshops with sequence-dependent setup times

“…To that end, we have employed a constraint based local search approach in our proposed algorithm. Constraint based local search approach is a concept that recently attracts great attention for solving different combinatorial problems such as Golomb rulers (Polash et al, 2017a), all-interval series (Polash et al, 2017b), minimum spanning tree problem (Arbelaez et al, 2018), aircraft scheduling (Riahi et al, 2018a(Riahi et al, , 2019b, and customer order scheduling (Riahi et al, 2019a). Constraint based approaches transform the constraints into an objective function and use search algorithms to optimise the objective (Hentenryck and Michel, 2009).…”