共查询到20条相似文献，搜索用时 0 毫秒
1.
In this paper we present a solution methodology based on the stochastic branch and bound algorithm to find optimal, or close to optimal, solutions to the stochastic airport runway scheduling problem. The objective of the scheduling problem is to find a sequence of aircraft operations on one or several runways that minimizes the total makespan, given uncertain aircraft availability at the runway. Enhancements to the general stochastic branch and bound algorithm are proposed and we give the specific details pertaining to runway scheduling. We show how the algorithm can be terminated early with solutions that are close to optimal, and investigate the impact of the uncertainty level. The computational experiment indicates that the sequences obtained using the stochastic branch and bound algorithm have, on average, 5–7% shorter makespans than sequences obtained using deterministic sequencing models. In addition, the proposed algorithm is able to solve instances with 14 aircraft using less than 1 min of computation time. 相似文献
2.
Milan Janic 《运输规划与技术》2013,36(5):501-520
Abstract This paper develops a heuristic algorithm for the allocation of airport runway capacity to minimise the cost of arrival and departure aircraft/flight delays. The algorithm is developed as a potential alternative to optimisation models based on linear and integer programming. The algorithm is based on heuristic (‘greedy’) criteria that closely reflect the ‘rules of thumb’ used by air traffic controllers. Using inputs such as arrival and departure demand, airport runway system capacity envelopes and cost of aircraft/flight delays, the main output minimises the cost of arrival and departure delays as well as the corresponding interdependent airport runway system arrival and departure capacity allocation. The algorithm is applied to traffic scenarios at three busy US airports. The results are used to validate the performance of the proposed heuristic algorithm against results from selected benchmarking optimisation models. 相似文献
3.
Real life situations like floods, hurricanes or chemical accidents may cause the evacuation of a certain area to rescue the affected population. To enable a fast and a safe evacuation a basic mixed-integer evacuation model has been developed that provides a reorganization of the traffic routing of a certain area for the case of an evacuation. This basic problem of evacuation minimizes the evacuation-time while prohibiting conflicts within intersections. Our evacuation model is a dynamic network flow problem with additional variables for the number and direction of used lanes and with additional complicating constraints.Because of the size of the time-expanded network, the computational effort required by standard software is already very high for tiny instances. To deal with realistic instances we propose a heuristic approach. 相似文献
4.
This paper addresses the scheduling of supply chains with interrelated factories consisting of a single vendor and multiple customers. In this research, one transporter is available to deliver jobs from vendor to customers, and the jobs can be processed by batch. The problem studied in this paper focuses on a real-case scheduling problem of a multi-location hospital supplied with a central pharmacy. The objective of this work is to minimize the total cost, while satisfying the customer’s due dates constraints. A mathematical formulation of the problem is given as a Mixed Integer Programming model. Then, a Branch-and-Bound algorithm is proposed as an exact method for solving this problem, a greedy local search is developed as a heuristic approach, and a hybrid Genetic Algorithm is presented as a meta-heuristic. Computation experiments are conducted to highlight the performance of the proposed methods. 相似文献
5.
This paper investigates the performance of accessibility‐based equity measurements in transportation and proposes a multiobjective optimization model to simulate the trade‐offs between equity maximization and cost minimization of network construction. The equity is defined as the spatial distribution of accessibilities across zone areas. Six representative indicators were formulated, including GINI coefficient, Theil index, mean log deviation, relative mean deviation, coefficient of variation, and Atkinson index, and incorporated into an equity maximization model to evaluate the performance sensitivity. A bilevel multiobjective optimization model was proposed to obtain the Pareto‐optimal solutions for link capacity enhancement in a stochastic road network design problem. A numerical analysis using the Sioux Falls data was implemented. Results verified that the equity indicators are quite sensitive to the pattern of network scenarios in the sense that the level of equity varies according to the amount of overall capacity enhancement as well as the assignment of improved link segments. The suggested multiobjective model that enables representing the Pareto‐optimal solutions can provide multiple options in the decision making of road network design. Copyright © 2012 John Wiley & Sons, Ltd. 相似文献
6.
THE U.S. AIRFREIGHT INDUSTRY, by Nawal K. Taneja. Lexington Books, Lexington, Mass., 1979. 244 pp. TRAFFIC, OPERATIONAL RESEARCH, FUTUROLOGY, by Arne Jensen. North Holland Publishing Company, Amsterdam, 1980. 321 pp. ($39.00) PROBLEMS OF THE CARLESS, by R. E. Paaswell and W. W. Recker. Praeger Publishers, New York, 1978. 190 pp. TRANSPORTATION AND THE ELDERLY, by Martin Wachs. University of California Press, Berkeley, 1980. PUBLIC TRANSPORTATION: PLANNING, OPERATIONS AND MANAGEMENT, edited by George E. Gray and Lester A Hoel. Prentice Hall, Englewood Cliffs, New Jersey, 1979. 749 pp. ETHYL ALCOHOL PRODUCTION AND USE AS A MOTOR FUEL, edited by J. K. Paul. Noyes Data Corporation, New Jersy, 1979. 354 pp ($48.00). URBAN PLANNING AND PUBLIC TRANSPORT, edited by Roy Cresswell. The Construction Press, London, 1980. 172 pp. (£15.00) 相似文献
7.
This research proposes a bi-level bi-objective model to regulate the usage of rail intermodal terminals for hazardous materials (hazmat) shipments, where government imposes tolls to deter carriers from using certain terminals. The complexity of the resulting mathematical program motivates the development of a hybrid speed-constrained multi-objective particle swarm optimization algorithm, which is then integrated with CPLEX, to solve the model. Through a real problem instance based on the intermodal service chain of Norfolk Southern in US, the toll-setting model is examined and further compared with a regular network design approach, in which certain terminals are closed to hazmat containers. The computational results show that the toll-setting policy is more practical and efficient, and the two models can be combined as a two-stage strategy in long-term hazmat transportation regulations. Additional managerial insights are derived for different stakeholders. 相似文献
8.
本文分析了大湄公河次区域合作下广西国际道路货运发展现状,提出了广西国际货运发展指导思想和总体目标,探讨了国际道路货运的发展对策。 相似文献
9.
Crew scheduling for bus drivers in large bus agencies is known to be a time‐consuming and cumbersome problem in transit operations planning. This paper investigates a new meta‐heuristics approach for solving real‐world bus‐driver scheduling problems. The drivers' work is represented as a series of successive pieces of work with time windows, and a variable neighborhood search (VNS) algorithm is employed to solve the problem of driver scheduling. Examination of the modeling procedure developed is performed by a case study of two depots of the Beijing Public Transport Group, one of the largest transit companies in the world. The results show that a VNS‐based algorithm can reduce total driver costs by up to 18.1%, implying that the VNS algorithm may be regarded as a good optimization technique to solve the bus‐driver scheduling problem. Copyright © 2015 John Wiley & Sons, Ltd. 相似文献
10.
The problem of studying public transportation systems with autonomous vehicles is challenging because of behavioral differences that make existing models poorly fit and the technical difficulties involved in studying large autonomous systems operating on a grand scale. In this paper, we propose the following: (i) an autonomous transportation network setting; (ii) a method for modeling autonomous vehicles in simulation; and (iii) a high‐performance simulation platform that allows analysis and visualization of transportation technologies. Results from microsimulation confirm theoretical benefits and improvements from employing autonomous systems in an example setting and highlight the platform's general ability to allow researchers to implement novel transportation systems and study the cost benefit variations occurring between them. Copyright © 2017 John Wiley & Sons, Ltd. 相似文献
11.
文章以物元模型为切入点,阐述了基于物元模型的公交智能化调度评价方法及算法,并通过对某高客流量线路的传统全程车调度、传统大站快车调度、公交智能化全程车调度三种调度方案的综合评价分析,验证了该方法的有效性。 相似文献
12.
In this work we propose a mechanism to optimize the capacity of the main corridor within a railway network with a radial-backbone or X-tree structure. The radial-backbone (or X-tree) structure is composed of two types of lines: the primary lines that travel exclusively on the common backbone (main corridor) and radial lines which, starting from the common backbone, branch out to individual locations. We define possible line configurations as binary strings and propose operators on them for their analysis, yielding an effective algorithm for generating an optimal design and train frequencies. We test our algorithm on real data for the high speed line Madrid–Seville. A frequency plan consistent with the optimal capacity is then proposed in order to eliminate the number of transfers between lines as well as to minimize the network fleet size, determining the minimum number of vehicles needed to serve all travel demand at maximum occupancy. 相似文献
13.
文章基于广西道路运输行业信息化建设情况,分析了制约信息化建设的主要因素,指出了广西道路运输信息化建设的思路和目标,并探讨了实现创新高效、资源共享、机制完善、服务优质的信息化可持续发展道路应采取的措施。 相似文献
14.
Long taxiing times at large airports lead to fuel wastage and dissatisfied passengers. This paper investigates the 4D taxi scheduling problem in airports to minimize the taxiing time. We propose an iterative two-stage scheduling strategy. In the first stage, all aircrafts in a current schedule period are assigned initial 4D routes. In the second stage, landing aircrafts that are unavailable to fulfil their initially assigned routes are rescheduled using a shortest path algorithm based approach. In this paper, the simplified model used in most existing literature, that depicts a runway as having a single entrance and a single exit or even sets only one point to represent both of them has been discarded. Instead, we model the fact that a runway has multiple entrance and exit points and use an emerging concept—Runway Exit Availability (REA)—to measure the probability of clearing a runway from a specific exit during a specific time interval so that the taxiing scheduling model can be much higher approximation to the practical operation. An integer programming (IP) model factoring REA is proposed for assigning 4D taxiing routes in the first stage. The IP model covers most practical constraints faced in airport taxiing procedures, such as the rear-end/head-on conflict constraint, runway-crossing constraint, take-off/landing separation constraint, and taxi-out constraint. Besides, flight holding patterns at intersections are much more realistically modelled. Furthermore, to accelerate the solving process of the IP model, we have refined the formulation using several tricks. Simulation results by proposed scheduling approach for operations at the Beijing Capital International Airport (PEK) for an entire day demonstrate a surprising taxiing time saving against the empirical data and simulation results based on a strategy similar to what being used now days while showing an acceptable running time of our approach, which supports that our approach may help in real operation in the future. 相似文献
15.
The ability of a supplier of liquefied natural gas (LNG) to deliver cargoes at desired times, while effectively managing a fleet of cryogenic vessels can significantly impact its profits. We investigate in this paper an LNG short-term delivery planning problem by considering mandatory cargoes as well as optional cargoes to select, along with the scheduling of a heterogeneous vessel fleet with controllable cruising speeds. Several technical constraints are accommodated including time windows, berth availability, bunkering restrictions, inventory, liquefaction terminal storage capacity, maximum waiting time, and planned maintenance restrictions. The objective is to maximize the net profit.We propose a mixed-integer programming formulation that includes a polynomial number of variables and constraints and accommodates all of the problem features. Also, we describe an optimization-based variable neighborhood search procedure that embeds the proposed compact formulation. To assess the quality of the generated solutions, we propose a second valid formulation with an exponential number of decision variables and we solve its linear programming relaxation using column generation. We provide the results of extensive computational results that were carried out on a set of large-scale set of realistic instances, with up to 62 vessels and 160 cargoes, provided by a major LNG producer. These results provide evidence that the proposed improvement procedure yields high-quality solutions. 相似文献
16.
17.
Highway work zones caused excessive delay to road users. To reduce user and maintenance costs, work zones shall be designed and scheduled accordingly. An analytical model is developed to jointly optimize work zone lengths and schedule as well as diverted traffic volume for highway maintenance projects, considering time‐varying demand, variable maintenance cost, and various production rates of maintenance crew. With a genetic algorithm, an iterative procedure is developed to search for the optimal solution. A numerical example is illustrated, in which various traffic mitigation plans for a highway maintenance project are evaluated. A sensitivity analysis is conducted, and results indicate the threshold volumes for various conditions (e.g., maintenance crews and capacity of the work zone) at which diverting traffic is desirable. This study demonstrates an effective approach to search for the optimal work zone schedule, which is also applicable to evaluate the effectiveness of traffic diversion plans for a pre‐planned work zone schedule. Copyright © 2012 John Wiley & Sons, Ltd. 相似文献
18.
Abstract This paper investigates the routing of pressurized tank trailers and proposes a scheduling plan which ensures the practical delivery of industrial gases under the objective of reducing transportation costs. Using constraint programming, we solve a combinatorial optimization problem that incorporates both hard and soft constraints for routing and scheduling tank trailers. Hard constraints are resource and safety/regulation constraints, whereas soft constraints are utilization and efficiency constraints. This approach enables tank-trailer routing and scheduling management to consider different combinations of parameters and view the results in ‘real-time.’ The routing and scheduling results based on a case study in Taiwan fulfil the goals of avoiding risks associated with transporting industrial gases, and attaining efficient delivery while conforming to regulations and consistent with good business practice. The results also suggest that significant economies in distribution costs are possible. 相似文献
19.
In this paper an operation mode which is based on the stop-skipping approach is studied in urban railway lines under uncertainty. In this mode, each train follows a specific stop schedule. Trains are allowed to skip any intermediate stations to increase the commercial speed and to save energy consumption. As the commercial speed increases, the number of required trains in operation reduces and results eliminating unnecessary costs. To that end, a new mathematical model is proposed to reach the optimum stop schedule patterns. In the planning step, based on the traffic studies, the headway distributions are computed for different weekdays, and holidays. However, in practice, because of many unexpected events, the traffic may alter from what is planned. Therefore, in this condition, a robust plan is required that is optimized and immunized from uncertainty. In this paper, a new robust mathematical model, as well as two heuristic algorithms including (1) a decomposition-based algorithm and (2) a Simulated Annealing (SA) based algorithm is proposed. Finally, an Iranian metro line is studied and the optimum patterns are presented and analyzed. 相似文献
20.
This paper deals with a practical tramp ship routing problem while taking into account different bunker prices at different ports, which is called the joint tramp ship routing and bunkering (JSRB) problem. Given a set of cargoes to be transported and a set of ports with different bunker prices, the proposed problem determines how to route ships to carry the cargoes and the amount of bunker to purchase at each port, in order to maximize the total profit. After building an integer linear programming model for the JSRB problem, we propose a tailored branch-and-price (B&P) solution approach. The B&P approach incorporates an efficient method for obtaining the optimal bunkering policy and a novel dominance rule for detecting inefficient routing options. The B&P approach is tested with randomly generated large-scale instances derived from real-world planning problems. All of the instances can be solved efficiently. Moreover, the proposed approach for the JSRB problem outperforms the conventional sequential planning approach and can incorporate the prediction of future cargo demand to avoid making myopic decisions. 相似文献