Dynamic change of aircraft seat condition for fast boarding

Aircraft boarding is a process mainly impacted by the boarding sequence, individual passenger behavior and the amount of hand luggage. Whereas these aspects are widely addressed in scientific research and considered in operational improvements, the influence of infrastructural changes is only focused upon in the context of future aircraft design. The paper provides a comprehensive analysis of the innovative approach of a Side-Slip Seat, which allows passengers to pass each other during boarding. The seat holds the potential to reduce the boarding time by approx. 20%, even considering operational constraints, such as passenger conformance to the proposed boarding strategy. A validated stochastic boarding model is extended to analyze the impact of the Side-Slip Seat. The implementation of such fundamental change inside the aircraft cabin demands for adapted boarding strategies, in order to cover all the benefits that accompany this new dynamic seating approach. To reasonably identify efficient strategies, an evolutionary algorithm is used to systematically optimize boarding sequences. As a result, the evolutionary algorithm depicts that operationally relevant boarding strategies implementing the Side-Slip Seat should differentiate between the left and the right side of the aisle, instead of the current operationally preferred boarding from the back to the front.     

The airline perturbation problem: considering disrupted passengers

Abstract

When airlines are faced with some unforeseen short-term events, they have to reconstruct their flight schedules. Although aircraft recovery decisions affect passengers, these disrupted passengers and recovering them have not been explicitly considered in most previous aircraft recovery models. This paper presents an assignment model for airline schedule recovery which recovers both aircraft and disrupted passengers simultaneously, using a rolling horizon time framework. Our model examines possible flight retiming, aircraft swapping, over-flying, ferrying, utilization of reserve aircraft, cancellation and passenger reassignment to generate an efficient schedule recovery plan. The model ensures that the schedule returns to normal within a certain time and the objective is to minimize operational recovery aircraft cost, cancellation and delay cost as well as disrupted passenger cost. The model is tested using a data-set with two disruption scenarios. The computational results show that it is capable of handling the integrated aircraft and passenger recovery problem successfully.     

Passenger travel characteristics and bus operational states: a study based on IC card and GPS data in Yinchuan,China

ABSTRACT

In recent years, public transport has been developing rapidly and producing large amounts of traffic data. Emerging big data-mining techniques enable the application of these data in a variety of ways. This study uses bus intelligent card (IC card) data and global positioning system (GPS) data to estimate passenger boarding and alighting stations. First, an estimation model for boarding stations is introduced to determine passenger boarding stations. Then, the authors propose an innovative uplink and downlink information identification model (UDI) to generate information for estimating alighting stations. Subsequently, the estimation model for the alighting stations is introduced. In addition, a transfer station identification model is also developed to determine transfer stations. These models are applied to Yinchuan, China to analyze passenger flow characteristics and bus operations. The authors obtain passenger flows based on stations (stops), bus lines, and traffic analysis zones (TAZ) during weekdays and weekends. Moreover, average bus operational speeds are obtained. These findings can be used in bus network planning and optimization as well as bus operation scheduling.     

Stochastic transit equilibrium

We present a transit equilibrium model in which boarding decisions are stochastic. The model incorporates congestion, reflected in higher waiting times at bus stops and increasing in-vehicle travel time. The stochastic behavior of passengers is introduced through a probability for passengers to choose boarding a specific bus of a certain service. The modeling approach generates a stochastic common-lines problem, in which every line has a chance to be chosen by each passenger. The formulation is a generalization of deterministic transit assignment models where passengers are assumed to travel according to shortest hyperpaths. We prove existence of equilibrium in the simplified case of parallel lines (stochastic common-lines problem) and provide a formulation for a more general network problem (stochastic transit equilibrium). The resulting waiting time and network load expressions are validated through simulation. An algorithm to solve the general stochastic transit equilibrium is proposed and applied to a sample network; the algorithm works well and generates consistent results when considering the stochastic nature of the decisions, which motivates the implementation of the methodology on a real-size network case as the next step of this research.     

Models of bus boarding and alighting dynamics

Understanding the dynamics of boarding/alighting activities and its impact on bus dwell times is crucial to improving bus service levels. However, research is limited as conventional data collection methods are both time and labour intensive. In this paper, we present the first use of smart card data to study passenger boarding/alighting behaviour and its impact on bus dwell time. Given the nature of these data, we focus on passenger activity time and do not account for the time necessary to open and close doors. We study single decker, double decker and articulated buses and identify the specific effects of floor/entrance type, number of activities and occupancy on both boarding and alighting dynamics. A linear relationship between average boarding and alighting times and their respective standard deviations is also found, whereas the variability of boarding and alighting time decreases with the number of passengers boarding and alighting. After observing the cumulative boarding/alighting processes under different occupancy conditions, we propose a new model to estimate passenger activity time, by introducing critical occupancy – a parameter incorporating the friction between boarding/alighting and on-board passengers. We conduct regression analyses with the proposed and another popular model for simultaneous boarding/alighting processes, finding that the critical occupancy plays a significant role in determining the regime of boarding and alighting processes and the overall activity time. Our results provide potential implications for practice and policy, such as identifying optimal vehicle type for a particular route and modelling transit service reliability.     

Bus journey times in medium size urban areas

The predictive accuracy of the models based on the fundamental relation between journey time and passenger demand can be improved through data disaggregation or route segmentation. Primary reason for this is the improvement in the estimates of stopping delays and delays due to passenger boarding and/or alighting (dwell time). Both Poisson and Negative Binomial model estimates of stoppings for passenger boarding and alighting are shown to improve with disaggregation. These improvements, however, contribute little to the overall predictability of the fundamental models which are useful for gaining insight into the significance and variability of the stopping delays and dwell time, or testing sensitivity to changes in the long term. Site or route specific models of journey times which have better predictive capability exist, and may be used for short-run planning. However, the interchangeability and performance over time of the latter, have to be evaluated before making definitive conclusions.     

Flight schedule punctuality control and management: a stochastic approach

The insufficiency of infrastructure capacity in an air transport system is usually blamed for poor punctuality performance when implementing flight schedules. However, investigations have revealed that ground operations of airlines have become the second major cause of flight delay at airports. A stochastic approach is used in this paper to model the operation of aircraft turnaround and the departure punctuality of a turnaround aircraft at an airport. The aircraft turnaround model is then used to investigate the punctuality problem of turnaround aircraft. Model results reveal that the departure punctuality of a turnaround aircraft is influenced by the length of scheduled turnaround time, the arrival punctuality of inbound aircraft as well as the operational efficiency of aircraft ground services. The aircraft turnaround model proposed is then employed to evaluate the endogenous schedule punctuality of two turnaround aircraft. Model results, when compared with observation data, show that the operational efficiency of aircraft ground services varies among turnarounds. Hence, it is recommended that the improvement of departure punctuality of turnaround aircraft may be achieved from two approaches: airline scheduling control and the management of operational efficiency of aircraft ground services.     

Dynamic airspace sectorisation for flight-centric operations

Today’s air traffic operations follow the paradigm of ‘flow follows structure’, which already limits the operational efficiency and punctuality of current air traffic movements. Therefore, we introduce the dynamic airspace sectorisation and consequently change this paradigm to the more appropriate approach of ‘structure follows flow’. The dynamic airspace sectorisation allows an efficient allocation of scarce resources considering operational, economic and ecological constraints in both nominal and variable air traffic conditions. Our approach clusters traffic patterns and uses evolutionary algorithms for optimisation of the airspace, focusing on high capacity utilisation through flexible use of airspace, appropriate distribution of task load for air traffic controllers and fast adaptation to changed operational constraints. We thereby offer a solution for handling non-convex airspace boundaries and provide a proof of concept using current operational airspace structures and enabling a flight-centric air traffic management. We are confident that our developed dynamic airspace sectorisation significantly contributes to the challenges of future airspace by providing appropriate structures for future 4D aircraft trajectories taking into account various operational aspects of air traffic such as temporally restricted areas, limited capacities, zones of convective weather or urban air mobility. Dynamic sectorisation is a key enabling technology in the achievement of the ambitious goals of Single European Sky and Flightpath 2050 through a reduction in coordination efforts, efficient resource allocation, reduced aircraft emissions, fewer detours, and minimisation of air traffic delays.     

Evaluation of a public transportation level of service concept

The level of service of a bus line is evaluated by its operational characteristics, particularly by the ratio between average bus travel time on a given route and the average passenger car travel time on the shortest distance between the origin and the destination of the bus in question. It is shown that the level-of-service measure may be predicted by such independent variables as route length, average distance between bus stations, number of signalized and unsignalized intersections, and the ratio between such intersections. It is hypothesized that use of other independent variables such as boarding and alighting passengers, or volume to capacity ratio on the route concerned, could improve the predictive power of the suggested models. Further research is recommended on the effect of these latter variables and other operational variables which might influence bus level of service, and also on the comparison between direct bus lines and lines which use transfer points.     

Analytical model for calibrating delay at congested bus stops

Abstract

A model is proposed to calculate the overall operating and delay times spent at bus stops due to passenger boarding and alighting and the time lost to queuing caused by bus stop saturation. A formula for line demand at each stop and the interaction between the buses themselves is proposed and applied to different bus stops depending on the number of available berths. The application of this model has quantified significant operational delays suffered by users and operator due to consecutive bus arrival at stops, even with flows below bus stop capacity.     

Including passengers’ response to crowding in the Dutch national train passenger assignment model

Transit passengers’ response to crowded conditions has been studied empirically, yet is limitedly included in transport models currently used in the design of policy and infrastructure investments. This has consequences for the practical applicability of these models in studies on, for instance, timetabling, train capacity management strategies, project appraisal, and passenger satisfaction. Here we propose four methods to include the effect of crowding, based on existing studies on passengers’ perception and response as well as often-used crowding indicators. These four alternative methods are implemented in the train passenger assignment procedure of the Dutch national transport model, and evaluated with respect to their impacts on the model results for the Dutch railway network. The four methods relate to four different ways in which an additive trip penalty and/or time-multiplier can be incorporated in the train utility function for different travel purposes, to capture the disutility of crowding as measured by the load factor. The analyses of the test case favor the hybrid method using both a boarding penalty (capturing seat availability upon boarding) and a time-multiplier (capturing physical comfort and safety throughout the trip). This method produces consistent results, while the additional computational effort that it imposes is acceptable. Further empirical underpinning is needed to conclusively show which of these methods best captures passengers’ response behavior quantitatively (for different travel purposes and conditions).     

Determining optimal frequency and vehicle capacity for public transit routes: A generalized newsvendor model

The level of service on public transit routes is very much affected by the frequency and vehicle capacity. The combined values of these variables contribute to the costs associated with route operations as well as the costs associated with passenger comfort, such as waiting and overcrowding. The new approach to the problem that we introduce combines both passenger and operator costs within a generalized newsvendor model. From the passenger perspective, waiting and overcrowding costs are used; from the operator’s perspective, the costs are related to vehicle size, empty seats, and lost sales. Maximal passenger average waiting time as well as maximal vehicle capacity are considered as constraints that are imposed by the regulator to assure a minimal public transit service level or in order to comply with other regulatory considerations. The advantages of the newsvendor model are that (a) costs are treated as shortages (overcrowding) and surpluses (empty seats); (b) the model presents simultaneous optimal results for both frequency and vehicle size; (c) an efficient and fast algorithm is developed; and (d) the model assumes stochastic demand, and is not restricted to a specific distribution. We demonstrate the usefulness of the model through a case study and sensitivity analysis.     

Modelling public transport on‐board congestion: comparing schedule‐based and agent‐based assignment approaches and their implications

Transit systems are subject to congestion that influences system performance and level of service. The evaluation of measures to relieve congestion requires models that can capture their network effects and passengers' adaptation. In particular, on‐board congestion leads to an increase of crowding discomfort and denied boarding and a decrease in service reliability. This study performs a systematic comparison of alternative approaches to modelling on‐board congestion in transit networks. In particular, the congestion‐related functionalities of a schedule‐based model and an agent‐based transit assignment model are investigated, by comparing VISUM and BusMezzo, respectively. The theoretical background, modelling principles and implementation details of the alternative models are examined and demonstrated by testing various operational scenarios for an example network. The results suggest that differences in modelling passenger arrival process, choice‐set generation and route choice model yield systematically different passenger loads. The schedule‐based model is insensitive to a uniform increase in demand or decrease in capacity when caused by either vehicle capacity or service frequency reduction. In contrast, nominal travel times increase in the agent‐based model as demand increases or capacity decreases. The marginal increase in travel time increases as the network becomes more saturated. Whilst none of the existing models capture the full range of congestion effects and related behavioural responses, existing models can support different planning decisions. Copyright © 2016 John Wiley & Sons, Ltd.     

A heuristic model for frequency planning and aircraft routing in small size airlines

The flight schedule of an airline is the primary factor in finding the most effective and efficient deployment of the airline's resources. The flight schedule process aims at finding a set of routes with associated aircraft type, frequency of service and times of departures and arrivals in order to satisfy a specific objective such as profit maximization. In this paper, we develop a two‐phase heuristic model for airline frequency planning and aircraft routing for small size airlines. The first phase develops a frequency plan using an economic equilibrium model between passenger demand for flying a particular route and aircraft operating characteristics. The second phase uses a time‐of‐day model to develop an assignment algorithm for aircraft routing.     

An aircraft boarding model with the group behavior and the quantity of luggage

A reasonable boarding model can effectively improve the boarding efficiency. Therefore, developing boarding models/strategies to improve the boarding efficiency has been an interesting topic in the air transportation. In this paper, we incorporate the group behavior and the quantity of luggage into the boarding process, and then develop an extended boarding model to investigate the effects of the two factors on the delay time and boarding time. The numerical results show that the quantity of luggage may make each passenger’s boarding behavior more complex, while the group behavior can shorten some passengers’ delay time and the total boarding time. The results can help administrators organize the boarding process and enhance the boarding efficiency.     

Energy-efficient metro train rescheduling with uncertain time-variant passenger demands: An approximate dynamic programming approach

In a heavily congested metro line, unexpected disturbances often occur to cause the delay of the traveling passengers, infeasibility of the current timetable and reduction of the operational efficiency. Due to the uncertain and dynamic characteristics of passenger demands, the commonly used method to recover from disturbances in practice is to change the timetable and rolling stock manually based on the experiences and professional judgements. In this paper, we develop a stochastic programming model for metro train rescheduling problem in order to jointly reduce the time delay of affected passengers, their total traveling time and operational costs of trains. To capture the complexity of passenger traveling characteristics, the arriving ratio of passengers at each station is modeled as a non-homogeneous poisson distribution, in which the intensity function is treated as time-varying origin-to-destination passenger demand matrices. By considering the number of on-board passengers, the total energy usage is modeled as the difference between the tractive energy consumption and the regenerative energy. Then, we design an approximate dynamic programming based algorithm to solve the proposed model, which can obtain a high-quality solution in a short time. Finally, numerical examples with real-world data sets are implemented to verify the effectiveness and robustness of the proposed approaches.     

Estimation of train dwell time at short stops based on track occupation event data: A study at a Dutch railway station

Train dwell time is one of the most unpredictable components of railway operations, mainly because of the varying volumes of alighting and boarding passengers. However, for reliable estimations of train running times and route conflicts on main lines, it is necessary to obtain accurate estimations of dwell times at the intermediate stops on the main line, the so‐called short stops. This is a great challenge for a more reliable, efficient and robust train operation. Previous research has shown that the dwell time is highly dependent on the number of boarding and alighting passengers. However, these numbers are usually not available in real time. This paper discusses the possibility of a dwell time estimation model at short stops without passenger demand information by means of a statistical analysis of track occupation data from the Netherlands. The analysis showed that the dwell times are best estimated for peak and off‐peak hours separately. The peak‐hour dwell times are estimated using a linear regression model of train length, dwell times at previous stops and dwell times of the preceding trains. The off‐peak‐hour dwell times are estimated using a non‐parametric regression model, in particular, the k‐nearest neighbor model. There are two major advantages of the proposed estimation models. First, the models do not need passenger flow data, which is usually impossible to obtain in real time in practice. Second, detailed parameters of rolling stock configuration and platform layout are not required, which makes the model more generic and eases implementation. A case study at Dutch railway stations shows that the estimation accuracy is 85.8%–88.5% during peak hours and 80.1% during off‐peak hours, which is relatively high. We conclude that the estimation of dwell times at short stop stations without passenger data is possible. Copyright © 2016 John Wiley & Sons, Ltd.     

Scheduling considerations for a branching transit route

This paper addresses the impacts of different scheduling alternatives for a branching transit route. It examines different schedule alternatives that might be used to optimize the route performance in terms of the passenger traveling time distributed among branch passengers and trunk‐line passengers. The schedule alternatives considered include transit vehicle allocation to different branches, offset shifting across vehicles on different branches, and vehicle holding (slack time) in the transit vehicle schedule. With these variables, several vehicle schedules are devised and examined based on a wide variety of possible passenger boarding scenarios using deterministic service models. Test outcomes provide general conclusions about the performance of the strategies. Vehicle assignment leading to even headways among branches is generally preferred for the case of low passenger demand. However, when passenger demand is high, or the differences between the passenger demands on branches are significant, unequal vehicle assignment will be helpful to improve the overall route performance. Holding, as a proactive strategy in scheduling, has the potential to be embedded into the schedule as a type of slack time, but needs further evidence and study to determine the full set of conditions where it may be beneficial. Offset shifting does not show sufficient evidence to be an efficient strategy to improve route performance in the case of low or high passenger demand.     

A Modeling Framework for Bus Rapid Transit Operations Evaluation and Service Planning

Abstract

In this paper, we present a dynamic traffic assignment-simulation modeling framework (DYNASMART-P) to support the evaluation and planning of Bus Rapid Transit (BRT) services in urban transportation networks. The model represents the different characteristics associated with BRT operations such as: exclusive right-of-way lanes, limited-stop service, signal prioritization at congested intersections, and enhanced bus stops to reduce passenger boarding times. A set of simulation experiments is conducted using the model to study the impact of introducing a hypothetical BRT service in the Knoxville area in the State of Tennessee. In these experiments, the different operational characteristics of BRT are evaluated in terms of potential impact on transit ridership and on the interacting auto traffic. The results illustrate the advantages of BRT for increasing transit ridership and improving overall system performance.