2019
DOI: 10.1177/0954410019830172
|View full text |Cite
|
Sign up to set email alerts
|

Optimal scheduling algorithm in point merge system including holding pattern based on mixed-integer linear programming

Abstract: An optimal scheduling algorithm of the point merge system that considers a holding pattern is presented based on mixed-integer linear programming. The route structure of the point merge system is constructed by adopting virtual fixes, and appropriate constraints are included to integrate a holding pattern into the formulation of point merge system. The performance of the proposed point merge system holding algorithm is demonstrated by comparing with the point merge system and first-come first-served algorithms… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
9
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 10 publications
(9 citation statements)
references
References 13 publications
0
9
0
Order By: Relevance
“…LH based on PM was first developed by the EUROCONTROL Experimental Centre (EEC) in 2006. LH could be designed into an RNAV STAR, which is characterized by a single merge point and predefined legs (36)(37)(38) . These legs provide sequencing, and they play a critical role in absorbing necessary delays by stretching paths (39) .…”
Section: Methodsmentioning
confidence: 99%
“…LH based on PM was first developed by the EUROCONTROL Experimental Centre (EEC) in 2006. LH could be designed into an RNAV STAR, which is characterized by a single merge point and predefined legs (36)(37)(38) . These legs provide sequencing, and they play a critical role in absorbing necessary delays by stretching paths (39) .…”
Section: Methodsmentioning
confidence: 99%
“…The approaches used in solutions can be classified as exact solution and heuristic algorithms. To solve ASSP and TTFP, CPLEX solver ( 15 20 ), dynamic programming ( 2126 ), and the branch and bound algorithm ( 2729 ) have been applied as exact solution algorithms. In addition, several meta-heuristic algorithms have been implemented, such as the tabu search ( 16 , 27 , 30 , 31 ), simulated annealing ( 14 ), ( 3235 ), ant colony optimization ( 3638 ), the evolutionary algorithm ( 39 46 ), scatter search ( 47 ), particle swarm optimization ( 48 , 49 ), artificial bee colony ( 50 ), and artificial immune system ( 51 ).…”
Section: Literature Reviewmentioning
confidence: 99%
“…Hong et al developed single and multi-objective models for arrival sequencing in a single PMS with a single runway using mixed-integer linear programming and å-constraint methods ( 30 ). Lee et al presented an optimal sequencing algorithm that aimed to minimize delays for a single PMS using mixed-integer linear programming (MIP) and considered the holding pattern ( 31 ). They highlighted the single aircraft category and the very small scale of their experiments as aspects of the study that need improvement.…”
Section: Literature Reviewmentioning
confidence: 99%