首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 15 毫秒
1.
    
A new timetable must be calculated in real-time when train operations are perturbed. Although energy consumption is becoming a central issue both from the environmental and economic perspective, it is usually neglected in the timetable recalculation. In this paper, we formalize the real-time Energy Consumption Minimization Problem (rtECMP). It finds in real-time the driving regime combination for each train that minimizes energy consumption, respecting given routing and precedences between trains. In the possible driving regime combinations, train routes are split in subsections for which one of the regimes resulting from the Pontryagin’s Maximum Principle is to be chosen. We model the trade-off between minimizing energy consumption and total delay by considering as objective function their weighted sum. We propose an algorithm to solve the rtECMP, based on the solution of a mixed-integer linear programming model. We test this algorithm on the Pierrefitte-Gonesse control area, which is a critical area in France with dense mixed traffic. The results show that the problem is tractable and an optimal solution of the model tackled can often be found in real-time for most instances.  相似文献   

2.
    
In a platoon, vehicles travel one after another with small intervehicle distances; trailing vehicles in a platoon save fuel because they experience less aerodynamic drag. This work presents a coordinated platooning model with multiple speed options that integrates scheduling, routing, speed selection, and platoon formation/dissolution in a mixed-integer linear program that minimizes the total fuel consumed by a set of vehicles while traveling between their respective origins and destinations. The performance of this model is numerically tested on a grid network and the Chicago-area highway network. We find that the fuel-savings factor of a multivehicle system significantly depends on the time each vehicle is allowed to stay in the network; this time affects vehicles’ available speed choices, possible routes, and the amount of time for coordinating platoon formation. For problem instances with a large number of vehicles, we propose and test a heuristic decomposed approach that applies a clustering algorithm to partition the set of vehicles and then routes each group separately. When the set of vehicles is large and the available computational time is small, the decomposed approach finds significantly better solutions than does the full model.  相似文献   

3.
    
Aviation is a mode with high fuel consumption per passenger mile and has significant environmental impacts. It is important to seek ways to reduce fuel consumption by the aviation sector, but it is difficult to improve fuel efficiency during the en-route cruise phase of flight because of technology barriers, safety requirements, and the mode of operations of air transportation. Recent efforts have emphasized the development of innovative Aircraft Ground Propulsion Systems (AGPS) for electrified aircraft taxi operations. These new technologies are expected to significantly reduce aircraft ground-movement-related fuel burn and emissions. This study compares various emerging AGPS systems and presents a comprehensive review on the merits and demerits of each system, followed with the local environmental impacts assessment of these systems. Using operational data for the 10 busiest U.S. airports, a comparison of environmental impacts is performed for four kinds of AGPS: conventional, single engine-on, external, and on-board systems. The results show that there are tradeoffs in fuel and emissions among these emerging technologies. On-board system shows the best performance in the emission reduction, while external system shows the least fuel burn. Compared to single-engine scenario, external AGPS shows the reduction of HC and CO emissions but the increase of NOx emission. When a general indicator is considered, on-board AGPS shows the best potential of reducing local environmental impacts. The benefit-cost analysis shows that both external and on-board systems are worth being implemented and the on-board system appeals to be more beneficial.  相似文献   

4.
    
Train dispatching is vital for the punctuality of train services, which is critical for a train operating company (TOC) to maintain its competitiveness. Due to the introduction of competition in the railway transport market, the issue of discrimination is attracting more and more attention. This paper focuses on delivering non-discriminatory train dispatching solutions while multiple TOCs are competing in a rail transport market, and investigating impacting factors of the inequity of train dispatching solutions. A mixed integer linear programming (MILP) model is first proposed, in which the inequity of competitors (i.e., trains and TOCs) is formalized by a set of constraints. In order to provide a more flexible framework, a model is further reformulated where the inequity of competitors is formalized as the maximum individual deviation of competitors’ delay cost from average delay cost in the objective function. Complex infrastructure capacity constraints are considered and modelled through a big M-based approach. The proposed models are solved by a standard MILP solver. A set of comprehensive experiments is conducted on a real-world dataset adapted from the Dutch railway network to test the efficiency, effectiveness, and applicability of the proposed models, as well as determine the trade-off between train delays and delay equity.  相似文献   

5.
    
This paper develops various chance-constrained models for optimizing the probabilistic network design problem (PNDP), where we differentiate the quality of service (QoS) and measure the related network performance under uncertain demand. The upper level problem of PNDP designs continuous/discrete link capacities shared by multi-commodity flows, and the lower level problem differentiates the corresponding QoS for demand satisfaction, to prioritize customers and/or commodities. We consider PNDP variants that have either fixed flows (formulated at the upper level) or recourse flows (at the lower level) according to different applications. We transform each probabilistic model into a mixed-integer program, and derive polynomial-time algorithms for special cases with single-row chance constraints. The paper formulates benchmark stochastic programming models by either enforcing to meet all demand or penalizing unmet demand via a linear penalty function. We compare different models and approaches by testing randomly generated network instances and an instance built on the Sioux–Falls network. Numerical results demonstrate the computational efficacy of the solution approaches and derive managerial insights.  相似文献   

6.
This paper proposes a global optimization algorithm for solving a mixed (continuous/discrete) transportation network design problem (MNDP), which is generally expressed as a mathematical programming with equilibrium constraint (MPEC). The upper level of the MNDP aims to optimize the network performance via both expansion of existing links and addition of new candidate links, whereas the lower level is a traditional Wardrop user equilibrium (UE) problem. In this paper, we first formulate the UE condition as a variational inequality (VI) problem, which is defined from a finite number of extreme points of a link-flow feasible region. The MNDP is approximated as a piecewise-linear programming (P-LP) problem, which is then transformed into a mixed-integer linear programming (MILP) problem. A global optimization algorithm based on a cutting constraint method is developed for solving the MILP problem. Numerical examples are given to demonstrate the efficiency of the proposed method and to compare the results with alternative algorithms reported in the literature.  相似文献   

7.
    
In this paper, we consider the continuous road network design problem with stochastic user equilibrium constraint that aims to optimize the network performance via road capacity expansion. The network flow pattern is subject to stochastic user equilibrium, specifically, the logit route choice model. The resulting formulation, a nonlinear nonconvex programming problem, is firstly transformed into a nonlinear program with only logarithmic functions as nonlinear terms, for which a tight linear programming relaxation is derived by using an outer-approximation technique. The linear programming relaxation is then embedded within a global optimization solution algorithm based on range reduction technique, and the proposed approach is proved to converge to a global optimum.  相似文献   

8.
    
We propose a heuristic algorithm to build a railway line plan from scratch that minimizes passenger travel time and operator cost and for which a feasible and robust timetable exists. A line planning module and a timetabling module work iteratively and interactively. The line planning module creates an initial line plan. The timetabling module evaluates the line plan and identifies a critical line based on minimum buffer times between train pairs. The line planning module proposes a new line plan in which the time length of the critical line is modified in order to provide more flexibility in the schedule. This flexibility is used during timetabling to improve the robustness of the railway system. The algorithm is validated on the DSB S-tog network of Copenhagen, which is a high frequency railway system, where overtakings are not allowed. This network has a rather simple structure, but is constrained by limited shunt capacity. While the operator and passenger cost remain close to those of the initially and (for these costs) optimally built line plan, the timetable corresponding to the finally developed robust line plan significantly improves the minimum buffer time, and thus the robustness, in eight out of ten studied cases.  相似文献   

9.
    

A moving sidewalk system installed at an airport pier finger is analyzed. The optimal length of the moving sidewalk and the optimal spacing between the access points which minimize the total cost of the system are obtained using methods of calculus, for a number of cases based on the different proportions of arriving, departing and transferring passengers and for two different types of moving sidewalks: elevated, at‐grade.

The optimal length of the moving sidewalk is shown to be linearly related to the length of the concourse, and to the total passenger demand. The effect due to preticketed transferees is insignificant.

The optimal spacing between access points is shown to be proportional to the square‐root of either the cost of an access escalator or the cost of inconvenience to a passenger due to an intermediate gap, depending on the moving sidewalk system under consideration. It also changes with the percentage of preticketed transferees.  相似文献   

10.
How to optimally allocate limited freeway sensor resources is of great interest to transportation engineers. In this paper, we focus on the optimal allocation of point sensors, such as loop detectors, to minimize performance measurement errors. Although it has been shown that the minimization problem can be intuitively formulated as a nonlinear program, the formulation is so complex that only heuristic approaches can be used to solve the problem. In this paper, we transform the nonlinear program into an equivalent mixed-integer linear model. The linearized model is shown to have a graphical interpretation and can be solved using resource constrained shortest path algorithms. A customized Branch-and-Bound technique is then proposed to solve the resource constrained shortest path problem. Numerical experiments along an urban freeway corridor demonstrate that this sensor location model is successful in allocating loop detectors to improve the accuracy of travel time estimation.  相似文献   

11.
    
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.  相似文献   

12.
    
The precise guidance and control of taxiing aircraft based on four-dimensional trajectories (4DTs) has been recognised as a promising means to ensure safe and efficient airport ground movement in the context of ever growing air traffic demand. In this paper, a systematic approach for online speed profile generation is proposed. The aim is to generate fuel-efficient speed profiles respecting the timing constraints imposed by routing and scheduling, which ensures conflict-free movement of aircraft in the planning stage. The problem is first formulated as a nonlinear optimisation model, which uses a more flexible edge-based speed profile definition. A decomposed solution approach (following the framework of matheuristic) is then proposed to generate feasible speed profiles in real time. The decomposed solution approach reduces the nonlinear optimisation model into three tractable constituent problems. The control point arrival time allocation problem is solved using linear programming. The control point speed allocation problem is solved using particle swarm optimisation. And the complete speed profile between control points is determined using enumeration. Finally, improved speed profiles are generated through further optimisation upon the feasible speed profiles. The effectiveness and advantages of the proposed approach are validated using datasets of real-world airports.  相似文献   

13.
The Intergovernmental Panel on Climate Change estimates that greenhouse gas emissions (GHG) must be cut 40–70% by 2050 to prevent a greater than 2 °Celsius increase in the global mean temperature; a threshold that may avoid the most severe climate change impacts. Transportation accounts for about one third of GHG emissions in the United States; reducing these emissions should therefore be an important part of any strategy aimed at meeting the IPCC targets. Prior studies find that improvements in vehicle energy efficiency or decarbonization of the transportation fuel supply would be required for the transportation sector to achieve the IPCC targets. Strategies that could be implemented by regional transportation planning organizations are generally found to have only a modest GHG reduction potential. In this study we challenge these findings. We evaluate what it would take to achieve deep GHG emission reductions from transportation without advances in vehicle energy efficiency and fuel decarbonization beyond what is currently expected under existing regulations and market expectations. We find, based on modeling conducted in the Albuquerque, New Mexico metropolitan area that it is possible to achieve deep reductions that may be able to achieve the IPCC targets. Achieving deep reductions requires changes in transportation policy and land-use planning that go far beyond what is currently planned in Albuquerque and likely anywhere else in the United States.  相似文献   

14.
    
A methodology for optimizing variable pedestrian evacuation guidance in buildings with convex polygonal interior spaces is proposed. The optimization of variable guidance is a bi-level problem. The calculation of variable guidance based on the prediction of congestion and hazards is the upper-level problem. The prediction of congestion provided the variable guidance is the lower-level problem. A local search procedure is developed to solve the problem. The proposed methodology has three major contributions. First, a logistic regression model for guidance compliance behavior is calibrated using a virtual reality experiment and the critical factors for the behavior are identified. Second, the guidance compliance and following behaviors are considered in the lower-level problem. Third, benchmarks are calculated to evaluate the performance of optimized variable guidance, including the lower bound of the maximum evacuation time and the maximum evacuation time under a fixed guidance. Finally, the proposed methodology is validated with numerical examples. Results show that the method has the potential to reduce evacuation time in emergencies.  相似文献   

15.
    
This paper examines a practical tactical liner ship route schedule design problem, which is the determination of the arrival and departure time at each port of call on the ship route. When designing the schedule, the availability of each port in a week, i.e., port time window, is incorporated. As a result, the designed schedule can be applied in practice without or with only minimum revisions. This problem is formulated as a mixed-integer nonlinear nonconvex optimization model. In view of the problem structure, an efficient holistic solution approach is proposed to obtain global optimal solution. The proposed solution method is applied to a trans-Atlantic ship route. The results demonstrate that the port time windows, port handling efficiency, bunker price and unit inventory cost all affect the total cost of a ship route, the optimal number of ships to deploy, and the optimal schedule.  相似文献   

16.
    
Abstract

This paper concerns the newspaper distribution problem. It addresses the transportation of newspapers from printing plant to newsagents with distribution vehicles under various particular constraints. The objective is to minimize the distance traveled by the vehicles and/or the number of vehicles. In this study, the routes for vehicles of a leading newspaper distributor company in the Turkish press sector are examined. The problem is defined as determining optimal delivery routes for a fleet of homogeneous vehicles, starting and ending at the printing plant that is required to serve a number of geographically dispersed newsagents with known demands under capacity and time constraints, while minimizing the total distribution cost. An integar linear programming model is proposed as a solution using Cplex. Computational results demonstrate that the proposed model is fast and able to find optimal solutions for problem scenarios with up to 55 newsagents within reasonable computing times. It was found that the proposed model reduced the delivery cost by 21% on average when compared to the current manual method. The results show that this model is adequate for medium-sized distribution problems.  相似文献   

17.
文章以华东某机场的复合道面工程为例,基于沥青层模量一温度的关系,建立三维有限元模型,得到不同温度下的修正系数,并通过非线性回归分析得到修正系数与温度的关系式,同时采用实测HWD弯沉数据验证了该温度修正模型的正确性。  相似文献   

18.
Airports need to manage corporate social responsibility (CSR) strategies for sustainable development. This paper develops a new structured approach for airports to evaluate, prioritize and categorize CSR strategies, using Taiwan’s Taoyuan International Airport Corporation (TIAC) as an example. Based on TIAC’s CSR-related activities, 18 CSR strategies grouped into 5 CSR goals (corporate governance and finance, green airport and environmental management, service quality and social relationship, employee and work environment management, and safety and security) are identified using the CSR value chain and diamond framework. The pairwise comparison method used in analytic hierarchy process and the decision-making trial and evaluation laboratory method are used respectively to evaluate the relative importance, feasibility and achievability of these 18 strategies and to analyze their causal relationships via expert questionnaire surveys. A new method is developed to plan and manage the implementation of CSR strategies by incorporating the viewpoints of both internal and external stakeholders, thus reflecting the practical effects and strategic implications of the CSR implementation. The result suggests that TIAC’s CSR strategies in relation to airport safety and security, service quality and corporate governance are most significant and have a high implementation priority. This paper contributes to the airport industry and CSR research by proposing a proactive mechanism for quantitatively evaluating, prioritizing and categorizing CSR strategies.  相似文献   

19.
On the relationship between airport pricing models   总被引:1,自引:0,他引:1  
Airport pricing papers can be divided into two approaches. In the traditional approach the demand for airport services depends on airport charges and on congestion costs of both passengers and airlines; the airline market is not formally modeled. In the vertical-structure approach instead, airports provide an input for an airline oligopoly and it is the equilibrium of this downstream market which determines the airports’ demand. We prove, analytically, that the traditional approach to airport pricing is valid if air carriers have no market power, i.e. airlines are atomistic or they behave as price takers (perfect competition) and have constant marginal operational costs. When carriers have market power, this approach may result in a surplus measure that falls short of giving a true measure of social surplus. Furthermore, its use prescribes a traffic level that is, for given capacity, smaller than the socially optimal level. When carriers have market power and consequently both airports and airlines behave strategically, a vertical-structure approach appears a more reasonable approach to airport pricing issues.  相似文献   

20.
This research focuses on planning biofuel refinery locations where the total system cost for refinery investment, feedstock and product transportation and public travel is minimized. Shipment routing of both feedstock and product in the biofuel supply chain and the resulting traffic congestion impact are incorporated into the model to decide optimal locations of biofuel refineries. A Lagrangian relaxation based heuristic algorithm is introduced to obtain near-optimum feasible solutions efficiently. To further improve optimality, a branch-and-bound framework (with linear programming relaxation and Lagrangian relaxation bounding procedures) is developed. Numerical experiments with several testing examples demonstrate that the proposed algorithms solve the problem effectively. An empirical Illinois case study and a series of sensitivity analyses are conducted to show the effects of highway congestion on refinery location design and total system costs.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号