In order to ease congestion and ground delays in major hub airports, an aircraft taxiing scheduling optimization model is proposed with schedule time as the object function. In the new model, the idea of a classical j...In order to ease congestion and ground delays in major hub airports, an aircraft taxiing scheduling optimization model is proposed with schedule time as the object function. In the new model, the idea of a classical job shop-schedule problem is adopted and three types of special aircraft-taxi conflicts are considered in the constraints. To solve such nondeterministic polynomial time-complex problems, the immune clonal selection algorithm（ICSA） is introduced. The simulation results in a congested hour of Beijing Capital International Airport show that, compared with the first-come-first-served（FCFS） strategy, the optimization-planning strategy reduces the total scheduling time by 13.6 min and the taxiing time per aircraft by 45.3 s, which improves the capacity of the runway and the efficiency of airport operations.展开更多
Most current crowdsourced logistics aim to minimize systems cost and maximize delivery capacity,but the efforts of crowdsourcers such as drivers are almost ignored.In the delivery process,drivers usually need to take ...Most current crowdsourced logistics aim to minimize systems cost and maximize delivery capacity,but the efforts of crowdsourcers such as drivers are almost ignored.In the delivery process,drivers usually need to take long-distance detours in hitchhiking rides based package deliveries.In this paper,we propose an approach that integrates offline trajectory data mining and online route-and-schedule optimization in the hitchhiking ride scenario to find optimal delivery routes for packages and drivers.Specifically,we propose a two-phase framework for the delivery route planning and scheduling.In the first phase,the historical trajectory data are mined offline to build the package transport network.In the second phase,we model the delivery route planning and package-taxi matching as an integer linear programming problem and solve it with the Gurobi optimizer.After that,taxis are scheduled to deliver packages with optimal delivery paths via a newly designed scheduling strategy.We evaluate our approach with the realworld datasets;the results show that our proposed approach can complete citywide package deliveries with a high success rate and low extra efforts of taxi drivers.展开更多
基金Supported by the Basic Scientific Research Projects of the Central University of China(ZXH2010D010)the National Natural Science Foundation of China(60979021/F01)~~
文摘In order to ease congestion and ground delays in major hub airports, an aircraft taxiing scheduling optimization model is proposed with schedule time as the object function. In the new model, the idea of a classical job shop-schedule problem is adopted and three types of special aircraft-taxi conflicts are considered in the constraints. To solve such nondeterministic polynomial time-complex problems, the immune clonal selection algorithm（ICSA） is introduced. The simulation results in a congested hour of Beijing Capital International Airport show that, compared with the first-come-first-served（FCFS） strategy, the optimization-planning strategy reduces the total scheduling time by 13.6 min and the taxiing time per aircraft by 45.3 s, which improves the capacity of the runway and the efficiency of airport operations.
基金This work was supported in part by the National Natural Science Foundation of China(Grant No.61872050)in part by the Chongqing Basic and Frontier Research Program(cstc2018jcyjAX0551)+2 种基金Foundation of Chongqing Municipal Key Laboratory of Institutions of Higher Education([2017]3)Foundation of Chongqing Development and Reform Commission(2017[1007])Foundation of Chongqing Three Gorges University.Sijing Cheng and Chao Chen contributed equally to this work.Wei Zhang is the corresponding authors for this paper.
文摘Most current crowdsourced logistics aim to minimize systems cost and maximize delivery capacity,but the efforts of crowdsourcers such as drivers are almost ignored.In the delivery process,drivers usually need to take long-distance detours in hitchhiking rides based package deliveries.In this paper,we propose an approach that integrates offline trajectory data mining and online route-and-schedule optimization in the hitchhiking ride scenario to find optimal delivery routes for packages and drivers.Specifically,we propose a two-phase framework for the delivery route planning and scheduling.In the first phase,the historical trajectory data are mined offline to build the package transport network.In the second phase,we model the delivery route planning and package-taxi matching as an integer linear programming problem and solve it with the Gurobi optimizer.After that,taxis are scheduled to deliver packages with optimal delivery paths via a newly designed scheduling strategy.We evaluate our approach with the realworld datasets;the results show that our proposed approach can complete citywide package deliveries with a high success rate and low extra efforts of taxi drivers.
