Purpose-The purpose of this paper is to eliminate the fluctuations in train arrival and departure times caused by skewed distributions in interval operation times.These fluctuations arise from random origin and proces...Purpose-The purpose of this paper is to eliminate the fluctuations in train arrival and departure times caused by skewed distributions in interval operation times.These fluctuations arise from random origin and process factors during interval operations and can accumulate over multiple intervals.The aim is to enhance the robustness of high-speed rail station arrival and departure track utilization schemes.Design/methodologylapproach-To achieve this objective,the paper simulates actual train operations,incorporating the fluctuations in interval operation times into the utilization of arrival and departure tracks at the station.The Monte Carlo simulation method is adopted to solve this problem.This approach transforms a nonlinear model,which includes constraints from probability distribution functions and is difficult to solve directly,into a linear programming model that is easier to handle.The method then linearly weights two objectives to optimize the solution.Findings-Through the application of Monte Carlo simulation,the study successfully converts the complex nonlinear model with probability distribution function constraints into a manageable linear programming model.By continuously adjusting the weighting coefficients of the linear objectives,the method is able to optimize the Pareto solution.Notably,this approach does not require extensive scene data to obtain a satisfactory Pareto solution set.Originality/value-The paper contributes to the field by introducing a novel method for optimizing high-speed rail station arrival and departure track utilization in the presence of fluctuations in interval operation times.The use of Monte Carlo simulation to transform the problem into a tractable linear programming model represents a significant advancement.Furthermore,the method's ability to produce satisfactory Pareto solutions without relying on extensive data sets adds to its practical value and applicability in real-world scenarios.展开更多
Terminal airspace(TMA)is the airspace centering several military and civil aviation airports with complex route structure,limited airspace resources,traffic flow,difficult management and considerable airspace complexi...Terminal airspace(TMA)is the airspace centering several military and civil aviation airports with complex route structure,limited airspace resources,traffic flow,difficult management and considerable airspace complexity.A scientific and rational sectorization of TMA can optimize airspace resources,and sufficiently utilize the control of human resources to ensure the safety of TMA.The functional sectorization model was established based on the route structure of arriving and departing aircraft as well as controlling requirements.Based on principles of sectorization and topological relations within a network,the arrival and departure sectorization model was established,using tree based ant colony algorithm(ACO)searching.Shanghai TMA was taken as an example to be sectorizaed,and the result showed that this model was superior to traditional ones when arrival and departure routes were separated at dense airport terminal airspace.展开更多
In order to improve safety,economy efficiency and design automation degree of air route in terminal airspace,Three-dimensional(3D)planning of routes network is investigated.A waypoint probability search method is prop...In order to improve safety,economy efficiency and design automation degree of air route in terminal airspace,Three-dimensional(3D)planning of routes network is investigated.A waypoint probability search method is proposed to optimize individual flight path.Through updating horizontal pheromones by negative feedback factors,an antcolony algorithm of path searching in 3Dterminal airspace is implemented.The principle of optimization sequence of arrival and departure routes is analyzed.Each route is optimized successively,and the overall optimization of the whole route network is finally achieved.A case study shows that it takes about 63 sto optimize 8arrival and departure routes,and the operation efficiency can be significantly improved with desirable safety and economy.展开更多
A combined arrival and departure scheduling problem is investigated for multi-airport system to alleviate the problem of airspace congestion and flight delay.Firstly,the combined scheduling problem for multi-airport s...A combined arrival and departure scheduling problem is investigated for multi-airport system to alleviate the problem of airspace congestion and flight delay.Firstly,the combined scheduling problem for multi-airport system is defined through in-depth analysis of the characteristics of arrival and departure operations.Then,several constraints are taken into account,such as wake vortex separation,transfer separation,release separation,and separation in different runway operational modes.Furthermore,the scheduling model is constructed and simulated annealing algorithm is proposed by minimizing the total delay.Finally,Shanghai multi-airport system is chosen to conduct the simulation and validation.And the simulation results indicate that the proposed method is able to effectively improve the efficiency of arrival and departure operations for multi-airport system.展开更多
We consider a variant of M/M/1 where customers arrive singly or in pairs. Each single and one member of each pair is called primary;the other member of each pair is called secondary. Each primary joins the queue upon ...We consider a variant of M/M/1 where customers arrive singly or in pairs. Each single and one member of each pair is called primary;the other member of each pair is called secondary. Each primary joins the queue upon arrival. Each secondary is delayed in a separate area, and joins the queue when “pushed” by the next arriving primary. Thus each secondary joins the queue followed immediately by the next primary. This arrival/delay mechanism appears to be new in queueing theory. Our goal is to obtain the steady-state probability density function (pdf) of the workload, and related quantities of interest. We utilize a typical sample path of the workload process as a physical guide, and simple level crossing theorems, to derive model equations for the steady-state pdf. A potential application is to the processing of electronic signals with error free components and components that require later confirmation before joining the queue. The confirmation is the arrival of the next signal.展开更多
文摘Purpose-The purpose of this paper is to eliminate the fluctuations in train arrival and departure times caused by skewed distributions in interval operation times.These fluctuations arise from random origin and process factors during interval operations and can accumulate over multiple intervals.The aim is to enhance the robustness of high-speed rail station arrival and departure track utilization schemes.Design/methodologylapproach-To achieve this objective,the paper simulates actual train operations,incorporating the fluctuations in interval operation times into the utilization of arrival and departure tracks at the station.The Monte Carlo simulation method is adopted to solve this problem.This approach transforms a nonlinear model,which includes constraints from probability distribution functions and is difficult to solve directly,into a linear programming model that is easier to handle.The method then linearly weights two objectives to optimize the solution.Findings-Through the application of Monte Carlo simulation,the study successfully converts the complex nonlinear model with probability distribution function constraints into a manageable linear programming model.By continuously adjusting the weighting coefficients of the linear objectives,the method is able to optimize the Pareto solution.Notably,this approach does not require extensive scene data to obtain a satisfactory Pareto solution set.Originality/value-The paper contributes to the field by introducing a novel method for optimizing high-speed rail station arrival and departure track utilization in the presence of fluctuations in interval operation times.The use of Monte Carlo simulation to transform the problem into a tractable linear programming model represents a significant advancement.Furthermore,the method's ability to produce satisfactory Pareto solutions without relying on extensive data sets adds to its practical value and applicability in real-world scenarios.
基金supported by the National Natural Science Foundation of China(Nos.U1233101,71271113)the Fundamental Research Funds for the Central Universities(No.NS2016062)
文摘Terminal airspace(TMA)is the airspace centering several military and civil aviation airports with complex route structure,limited airspace resources,traffic flow,difficult management and considerable airspace complexity.A scientific and rational sectorization of TMA can optimize airspace resources,and sufficiently utilize the control of human resources to ensure the safety of TMA.The functional sectorization model was established based on the route structure of arriving and departing aircraft as well as controlling requirements.Based on principles of sectorization and topological relations within a network,the arrival and departure sectorization model was established,using tree based ant colony algorithm(ACO)searching.Shanghai TMA was taken as an example to be sectorizaed,and the result showed that this model was superior to traditional ones when arrival and departure routes were separated at dense airport terminal airspace.
基金supported by the National Natural Science Foundation of China(No.61039001)the State Technology Supporting Plan(No.2011BAH24B08)the Fundamental Research Funds for the Central Universities (No.ZXH2011A002)
文摘In order to improve safety,economy efficiency and design automation degree of air route in terminal airspace,Three-dimensional(3D)planning of routes network is investigated.A waypoint probability search method is proposed to optimize individual flight path.Through updating horizontal pheromones by negative feedback factors,an antcolony algorithm of path searching in 3Dterminal airspace is implemented.The principle of optimization sequence of arrival and departure routes is analyzed.Each route is optimized successively,and the overall optimization of the whole route network is finally achieved.A case study shows that it takes about 63 sto optimize 8arrival and departure routes,and the operation efficiency can be significantly improved with desirable safety and economy.
基金supported by the National Natural Science Foundation of China(No.71401072)the National Natural Science Foundation of Jiangsu Province(No.BK20130814)the Foundation of Jiangsu Innovation Program for Graduate Education(the Fundamental Research Funds for the Central Universities,No.SJLX15_0128)
文摘A combined arrival and departure scheduling problem is investigated for multi-airport system to alleviate the problem of airspace congestion and flight delay.Firstly,the combined scheduling problem for multi-airport system is defined through in-depth analysis of the characteristics of arrival and departure operations.Then,several constraints are taken into account,such as wake vortex separation,transfer separation,release separation,and separation in different runway operational modes.Furthermore,the scheduling model is constructed and simulated annealing algorithm is proposed by minimizing the total delay.Finally,Shanghai multi-airport system is chosen to conduct the simulation and validation.And the simulation results indicate that the proposed method is able to effectively improve the efficiency of arrival and departure operations for multi-airport system.
文摘We consider a variant of M/M/1 where customers arrive singly or in pairs. Each single and one member of each pair is called primary;the other member of each pair is called secondary. Each primary joins the queue upon arrival. Each secondary is delayed in a separate area, and joins the queue when “pushed” by the next arriving primary. Thus each secondary joins the queue followed immediately by the next primary. This arrival/delay mechanism appears to be new in queueing theory. Our goal is to obtain the steady-state probability density function (pdf) of the workload, and related quantities of interest. We utilize a typical sample path of the workload process as a physical guide, and simple level crossing theorems, to derive model equations for the steady-state pdf. A potential application is to the processing of electronic signals with error free components and components that require later confirmation before joining the queue. The confirmation is the arrival of the next signal.
