A new meta-heuristic approach is proposed in this paper based on a new composite dispatching rule to tackle the aircraft landing problem(ALP).First,the ALP is modeled as a machine scheduling problem with the objective...A new meta-heuristic approach is proposed in this paper based on a new composite dispatching rule to tackle the aircraft landing problem(ALP).First,the ALP is modeled as a machine scheduling problem with the objective of minimizing the total penalty,i.e.,total weighted earliness plus total weighted tardiness.Second,a composite dispatching rule,minimized penalty with due dates and set-ups(MPDS),is presented to determine the landing sequence.Then,an efficient heuristic approach is proposed to solve the problem by integrating the MPDS rule and CPLEX solver.In the first stage,the landing sequence is established based on the proposed MPDS rule.In the second stage,landing time is optimized using CPLEX solver.Next,a new meta-heuristic strategy is introduced into the heuristic approach by conducting the local search from the potential landing sequences,which are generated by the proposed MPDS rule.Finally,the performance of the proposed approach is evaluated using a set of benchmark instances taken from the OR library.The results demonstrate the effectiveness and efficiency of the proposed approaches.展开更多
The establishment of the toll station on the highway has very great influence on the operation and management of the highway. It should both be easy to manage, and make the average time that vehicle pass the whole cha...The establishment of the toll station on the highway has very great influence on the operation and management of the highway. It should both be easy to manage, and make the average time that vehicle pass the whole charge area minimum, so a rational design of the toll station number in charge area is needed. So a queuing theory mode has been set up in this paper. Through analysis, we found that in the specific road section, the variable that we can only control is the number of the toll station. An appropriate toll station number may be found, and a calculating case is presented to confirm if the number is bigger than 10, the solution is extremely appropriate. Finally we use computer simulation to simulate the process of the vehicles arrive, the toll station charge and then the vehicles leave. We also carried on a test to check the model, obtained a satisfactory result.展开更多
基金This work was supported by the Joint Fund of National Natural Science Foundation of China and Civil Aviation Administration of China(No.U1933117)。
文摘A new meta-heuristic approach is proposed in this paper based on a new composite dispatching rule to tackle the aircraft landing problem(ALP).First,the ALP is modeled as a machine scheduling problem with the objective of minimizing the total penalty,i.e.,total weighted earliness plus total weighted tardiness.Second,a composite dispatching rule,minimized penalty with due dates and set-ups(MPDS),is presented to determine the landing sequence.Then,an efficient heuristic approach is proposed to solve the problem by integrating the MPDS rule and CPLEX solver.In the first stage,the landing sequence is established based on the proposed MPDS rule.In the second stage,landing time is optimized using CPLEX solver.Next,a new meta-heuristic strategy is introduced into the heuristic approach by conducting the local search from the potential landing sequences,which are generated by the proposed MPDS rule.Finally,the performance of the proposed approach is evaluated using a set of benchmark instances taken from the OR library.The results demonstrate the effectiveness and efficiency of the proposed approaches.
文摘The establishment of the toll station on the highway has very great influence on the operation and management of the highway. It should both be easy to manage, and make the average time that vehicle pass the whole charge area minimum, so a rational design of the toll station number in charge area is needed. So a queuing theory mode has been set up in this paper. Through analysis, we found that in the specific road section, the variable that we can only control is the number of the toll station. An appropriate toll station number may be found, and a calculating case is presented to confirm if the number is bigger than 10, the solution is extremely appropriate. Finally we use computer simulation to simulate the process of the vehicles arrive, the toll station charge and then the vehicles leave. We also carried on a test to check the model, obtained a satisfactory result.
