Narrow Results

The constrained position shift (CPS) model is a famous model in the aircraft arrival sequencing and scheduling (ASS) problem, which allows each aircraft to shift forward or backward at most $k$ (a given integer number) positions in the first come first serve (FCFS) sequence. However, CPS is insufficient to cope with the case that some aircraft requiring more than $k$ positions shift. From this point, we modify it to be a more applicable model, named weighted constrained position shift (W-CPS) model. Three methods are developed to solve W-CPS, which are dynamic programming (DP), mixed integer programming (MIP) and ant colony (AC) algorithm. Numerical results validate the efficiency of these methods.