Real-time airport surface movement planning: Minimizing aircraft emissions

This paper presents a study towards the development of a real-time taxi movement planning system that seeks to optimize the timed taxiing routes of all aircraft on an airport surface, by minimizing the emissions that result from taxiing aircraft operations. To resolve this online planning problem, one of the most commonly employed operations research methods for large-scale problems has been successfully used, viz., mixed-integer linear programming (MILP). The MILP formulation implemented herein permits the planning system to update the total taxi planning every 15 s, allowing to respond to unforeseen disturbances in the traffic flow. Extensive numerical experiments involving a realistic (hub) airport environment bear out that an estimated environmental benefit of 1–3 percent per emission product can be obtained. This research effort clearly demonstrates that a surface movement planning system capable of minimizing the emissions in conjunction with the total taxiing time can be beneficial for airports that face dense surface traffic and stringent environmental requirements.     

A hierarchical line planning approach for a large-scale high speed rail network: The China case

Planning a set of train lines in a large-scale high speed rail (HSR) network is typically influenced by issues of longer travel distance, high transport demand, track capacity constraints, and a non-periodic timetable. In this paper, we describe an integrated hierarchical approach to determine line plans by defining the stations and trains according to two classes. Based on a bi-level programming model, heuristics are developed for two consecutive stages corresponding to each classification. The approach determines day-period based train line frequencies as well as a combination of various stopping patterns for a mix of fast trunk line services between major stations and a variety of slower body lines that offer service to intermediate stations, so as to satisfy the predicted passenger transport demand. Efficiencies of the line plans described herein concern passenger travel times, train capacity occupancy, and the number of transfers. Moreover, our heuristics allow for combining many additional conflicting demand–supply factors to design a line plan with predominantly cost-oriented and/or customer-oriented objectives. A range of scenarios are developed to generate three line plans for a real-world example of the HSR network in China using a decision support system. The performance of potential train schedules is evaluated to further examine the feasibility of the obtained line plans through graphical timetables.     

Numerical study on fatigue crack growth at a web-stiffener of ship structural details by an objected-oriented approach in conjunction with ABAQUS

It is necessary to manage the fatigue crack growth (FCG) once those cracks are detected during in-service inspections. This is particular critical as high strength steels are being used increasingly in ship and offshore structures. In this paper, a simulation program (FCG-System) is developed utilizing the commercial software ABAQUS with its object-oriented programming interface to simulate the fatigue crack path and to compute the corresponding fatigue life. In order to apply FCG-System in large-scale marine structures, the substructure modeling technique is integrated in the system under the consideration of structural details and load shedding during crack growth. Based on the nodal forces and nodal displacements obtained from finite element analysis, a formula for shell elements to compute stress intensity factors is proposed in the view of virtual crack closure technique. Neither special singular elements nor the collapsed element technique is used at the crack tip. The established FCG-System cannot only treat problems with a single crack, but also handle problems with multiple cracks in case of simultaneous but uneven growth. The accuracy and the robustness of FCG-System are demonstrated by two illustrative examples. No stability and convergence difficulties have been encountered in these cases and meanwhile, insensitivity to the mesh size is confirmed. Therefore, the FCG-System developed by authors could be an efficient tool to perform fatigue crack growth analysis on marine structures.     

Itinerary choice and advance ticket booking for high-speed-railway network services

This paper formulates and examines the passenger flow assignment (itinerary choice) problem in high-speed railway (HSR) systems with multiple-class users and multiple-class seats, given the train schedules and time-varying travel demand. In particular, we take into account advance booking cost of travelers in the itinerary choice problem. Rather than a direct approach to model advance booking cost with an explicit cost function, we consider advance booking cost endogenously, which is determined as a part of the passenger choice equilibrium. We show that this equilibrium problem can be formulated as a linear programming (LP) model based on a three-dimension network representation of time, space, and seat class. At the equilibrium solution, a set of Lagrange multipliers for the LP model are obtained, which are associated with the rigid in-train passenger capacity constraints (limited numbers of seats). We found that the sum of the Lagrange multipliers along a path in the three-dimension network reflects the advance booking cost of tickets (due to advance/early booking to guarantee availability) perceived by the passengers. Numerical examples are presented to demonstrate and illustrate the proposed model for the passenger assignment problem.     

The dynamic shortest path problem with time-dependent stochastic disruptions

The dynamic shortest path problem with time-dependent stochastic disruptions consists of finding a route with a minimum expected travel time from an origin to a destination using both historical and real-time information. The problem is formulated as a discrete time finite horizon Markov decision process and it is solved by a hybrid Approximate Dynamic Programming (ADP) algorithm with a clustering approach using a deterministic lookahead policy and value function approximation. The algorithm is tested on a number of network configurations which represent different network sizes and disruption levels. Computational results reveal that the proposed hybrid ADP algorithm provides high quality solutions with a reduced computational effort.     

A linear programming formulation for autonomous intersection control within a dynamic traffic assignment and connected vehicle environment

This paper develops a novel linear programming formulation for autonomous intersection control (LPAIC) accounting for traffic dynamics within a connected vehicle environment. Firstly, a lane based bi-level optimization model is introduced to propagate traffic flows in the network, accounting for dynamic departure time, dynamic route choice, and autonomous intersection control in the context of system optimum network model. Then the bi-level optimization model is transformed to the linear programming formulation by relaxing the nonlinear constraints with a set of linear inequalities. One special feature of the LPAIC formulation is that the entries of the constraint matrix has only {−1, 0, 1} values. Moreover, it is proved that the constraint matrix is totally unimodular, the optimal solution exists and contains only integer values. It is also shown that the traffic flows from different lanes pass through the conflict points of the intersection safely and there are no holding flows in the solution. Three numerical case studies are conducted to demonstrate the properties and effectiveness of the LPAIC formulation to solve autonomous intersection control.     

A multi‐objective approach to the parcel express service delivery problem

Parcel express service in many countries assumes door‐to‐door delivery of parcels and small packages in the fastest possible way. Delivery companies usually organize hub delivery networks, as flows between hubs are characterized by the economy of scale effect. At hubs, parcels are exchanged across vans, trucks, and planes. To organize parcel delivery in a specific region, the parcel delivery company must make appropriate decisions about the total number of parcel delivery hubs, their locations, and the allocation of demand for facilities' services to facilities. These issues are modeled in this paper as a multi‐objective problem. The model developed is based on compromise programming and genetic algorithms. We also demonstrate in the paper an interactive manner in which a defined problem can be solved. The proposed model could be implemented in large‐scale networks. The paper also shows a case study of parcel delivery service in Serbia. Copyright © 2013 John Wiley & Sons, Ltd.     

Vehicle routing with roaming delivery locations

We propose the vehicle routing problem with roaming delivery locations (VRPRDL) to model an innovation in last-mile delivery where a customer’s order is delivered to the trunk of his car. We develop construction and improvement heuristics for the VRPRDL based on two problem-specific techniques: (1) efficiently optimizing the delivery locations for a fixed customer delivery sequence and (2) efficiently switching a predecessor’s or successor’s delivery location during the insertion or deletion of a customer in a route. Furthermore, we conduct an extensive computation study to assess and quantify the benefits of trunk delivery in a variety of settings. The study reveals that a significant reduction in total distance travelled can be achieved, especially when trunk delivery is combined with traditional home delivery, which has both economic and environmental benefits.     

Real options and flexibility analysis in design and management of one-way mobility on-demand systems using decision rules

This study explores the concepts of real options and flexibility analysis as an approach to address uncertain demand growth in mobility on-demand (MoD) vehicle-sharing systems, with the goal of improving expected lifecycle performance. As MoD systems are gaining popularity worldwide, they inevitably face significant uncertainty in terms of needs and customer demands. Designing, planning capacity deployment, and operating such system can be challenging, and require significant capital investments for companies and cities. Two distinct real options analysis (ROA) models are developed to evaluate and optimize flexible strategies for these systems, relying on a novel methodological approach to value flexibility based on decision rules. The decision-rule-based approach differs from standard ROA approaches used to quantify the value of flexibility in irreversible investment projects, typically based on dynamic programming. It emulates the decision-making process by capturing mathematically a triggering mechanism that determines when it is best to exercise the flexibilities embedded in the system design. Two prevalent types of MoD systems are studied in this paper as demonstration of the methodological framework: a station-based system where customers must pick up and return the vehicle at specific locations, and a free-floating system, where customers may pick up and drop the car anywhere within a certain area. A simulation-based approach is used to analyze the station-based system, which models the rebalancing operations from a micro-level perspective. The approach consists of a discrete event simulator for performance estimation, and an optimization algorithm for design space exploration that integrates a population-based search algorithm with Optimal Computing Budget Allocation (OCBA). For the free-floating system, an analytical model is developed where the decision rule is formulated into and solved using stochastic mixed integer programming (MIP). The study provides guidance to system operators on potential strategies for deploying MoD systems, considering explicitly uncertainty and flexibility as a value enhancing mechanism.