An augmented Lagrangian origin‐based algorithm for link‐capacitated traffic assignment problem

The origin‐based algorithm is embedded into the augmented Lagrangian method for the link‐capacitated traffic assignment problem. In order to solve the “nonexistence” problem due to the second partial derivatives of the augmented Lagrangian function at some specific points, the approximate expressions of the second partial derivatives are amended in the origin‐based algorithm. The graph of last common nodes is developed on the basis of the restricted single‐origin network. A method is proposed for finding n–1 last common nodes of the restricted single‐origin network, resulting in computational complexity of O(n²) in finding last common nodes. Numerical analysis on the Sioux Falls network and Chicago Sketch network demonstrated the effectiveness and characteristics of the proposed algorithm. Copyright © 2014 John Wiley & Sons, Ltd.     

A control theoretic formulation of green driving strategies based on inter-vehicle communications

Various green driving strategies have been proposed to smooth traffic flow and lower pollutant emissions and fuel consumption in stop-and-go traffic. In this paper, we present a control theoretic formulation of distributed, cooperative green driving strategies based on inter-vehicle communications (IVCs). The control variable is the advisory speed limit, which is designed to smooth a following vehicle’s speed profile without changing its average speed. We theoretically analyze the performance of a constant independent and three simple cooperative green driving strategies and present three rules for effective and robust strategies. We then develop a distributed cooperative green driving strategy, in which the advisory speed limit is first independently calculated by each individual vehicle and then averaged among green driving vehicles through IVC. By simulations with Newell’s car-following model and the Comprehensive Modal Emissions Model (CMEM), we demonstrate that such a strategy is effective and robust independently as well as cooperatively for different market penetration rates of IVC-equipped vehicles and communication delays. In particular, even when 5% of the vehicles implement the green driving strategy and the IVC communication delay is 60 s, the fuel consumption can be reduced by up to 15%. Finally we discuss some future extensions.     

International experience with speed limits during and prior to the energy crisis of 1973–4

This paper presents an artificial neural network (ANN) based method for estimating route travel times between individual locations in an urban traffic network. Fast and accurate estimation of route travel times is required by the vehicle routing and scheduling process involved in many fleet vehicle operation systems such as dial‐a‐ride paratransit, school bus, and private delivery services. The methodology developed in this paper assumes that route travel times are time‐dependent and stochastic and their means and standard deviations need to be estimated. Three feed‐forward neural networks are developed to model the travel time behaviour during different time periods of the day‐the AM peak, the PM peak, and the off‐peak. These models are subsequently trained and tested using data simulated on the road network for the City of Edmonton, Alberta. A comparison of the ANN model with a traditional distance‐based model and a shortest path algorithm is then presented. The practical implication of the ANN method is subsequently demonstrated within a dial‐a‐ride paratransit vehicle routing and scheduling problem. The computational results show that the ANN‐based route travel time estimation model is appropriate, with respect to accuracy and speed, for use in real applications.     

Passenger waiting time and information acquisition using automatic vehicle location for verification

Bus riders utilize a variety of information media to learn how to travel to their destinations and to learn when they should arrive at bus stops. As part of the OCTA (Orange County Transit Authority) Transit Probe evaluation, 1199 passengers were surveyed to measure relationships between information acquisition and waiting time. A unique aspect of the survey was that some of the data could be correlated with automatic‐vehicle‐location (AVL) measurements of bus lateness at stops. Insights are provided as to the types of information riders acquire based on the nature of the trip and demographic characteristics. Insights are also provided as to factors affecting perceived waiting time. We found age group, whether a person needs to arrive at a destination by a specific time, primary language, and whether the person is a first‐time user of the bus line to be significant causal factors.     

The treatment of traffic in the Dutch environmental outlooks: the role of science in policy making and policy evaluation

The Dutch National Institute of Public Health and Environmental Protection publishes Environmental Outlooks in which 25‐year projections are made. These Outlooks quantifying the environmental problems, form the scientific basis for Dutch environmental policy. Traffic and transport is one of the main sectors causing environmental problems. The emissions and energy use of all relevant categories (road traffic, non‐road traffic) are based on model simulations with models. This paper describes the main models used.

If present policy is implemented only a minority of the environmental targets will be met.

If a sustainable transport system for the Netherlands means a large reducton in CO₂ emissions and energy use after 2010 a stronger emphasis on both technical and non‐technical measures (such as land‐use planning combined with public transport improvements) for the period until 2010 is needed than proposed in the Second Transport Structure Plan, unless a sustainable energy source becomes available.     

Modelling Complex Activity‐Travel Scheduling Decisions: Procedure for the Simultaneous Estimation of Activity Generation and Duration Functions

Abstract

Activity generation is a key factor in individual's choices of trip frequency and trip purpose. This paper describes the results of an experiment conducted to estimate functions of several temporal factors on individuals' propensity to schedule a given activity on a given day. The theory on which the experimental design is based states that the probability of scheduling an activity is a complex and continuous function of how long ago the activity was lastly performed, the duration constraints for the activity and the amount of available time in the activity schedule of the day considered. Aurora, an existing model of activity scheduling, assumes S‐shaped utility functions for the history as well as the duration functions, whereas most time‐use studies assume monotonically decreasing marginal utilities. The stated‐choice experiment involves a range of flexible activities and a large sample of individuals to measure the utility effects of a set of carefully chosen levels for the factors and tests these specific assumptions. The results suggest that the amount of discretionary time on a day has no significant impact on the scheduling decisions provided that enough time is available for the activity. The effects of other factors are as expected and show diminishing marginal utilities. We find mixed evidence for an initial phase of increasing marginal returns as assumed in an S‐shaped function.     

A G/G(n)/C/C state‐dependent simulation model for metro station corridor width design

Metro station corridor and passengers are described as a G/G(n)/C/C state‐dependent queuing system with a general random arrival interval G and a general random and state‐dependent service time G(n) to offset the shortcomings in existing design methods. The corresponding G/G(n)/C/C state‐dependent discrete event simulation model is developed, and its high‐fidelity is tested. Then the optimization algorithm based on the simulation model is designed to determine corridor width. The proposed simulation optimization method and the existing analytical optimization methods, based on M/G(n)/C/C and D/D/1/C queuing models, are applied to design corridor width in a numerical example of 48 combinations of passenger flow rates and level of service (LOS). The designed corridor widths are tested in a micro‐simulation model, and the performance measure is compared. The result shows that the corridor widths obtained by the new method are 0.357 m (7.4%) larger than that of the other two methods on average; the area per passenger of the new method increases 10.53% and 11.63%, respectively, compared with that of the other two methods; the widths designed by the new method satisfy the requirement of LOS under various passenger flows, whereas 93% of the corridor widths obtained by the other two methods fail to meet the requirement of LOS, and the corridor widths designed by the new method have high elasticity coefficients of LOS‐width. Copyright © 2015 John Wiley & Sons, Ltd.     

A decision support approach to the computerisation of some operational decision problems in community transport

Community Transport (CT) in the UK operates a diverse range of services, and organisations are computerising management and operational functions. This paper describes the approach which has been taken to computerising four operational decision making functions.

The paper considers models of human decision making and problem solving, with particular reference to an information processing view of cognitive activity and to perception and memory. The design of decision support systems is also discussed.

Four decision problems are considered. For each, the paper considers how people tackle the problem, how computers can be used to tackle it and the approach which has been adopted.

For allocating trips to vehicles using a diary, the approach has been to provide a representation on screen of a manual diary. For vehicle brokerage, vehicles are presented to the operator allocating a booking in an order based on the Sequence Number, an index of how ‘difficult to book’ a vehicle is, and the distance of the vehicle's base from the start point of the trip. For the sorting of passenger pick‐ups into an efficient tour, traditional solutions to the travelling salesperson problem have been rejected in favour of a solution using spacefilling curves. Finally, for allocating dial‐a‐ride passenger trips to vehicle shifts an approach has been chosen which presents the operator with appropriate information rather than attempting to automate the scheduling.

The paper concludes that the approach to the diary has been successful and accepted by operators, although the similar approach to the dial‐a‐ride scheduling has not, as the system has not yet been able to replace manual scheduling aids. The facility to order passenger pick‐ups is little used by operators. Finally, it is suggested that the vehicle brokerage problem may be an appropriate use of fuzzy logic.     

Managing transportation during highway reconstruction: A recommended process

Major highway reconstruction can cause significant disruptions to existing travel patterns and economic activity. Reducing these impacts on travelers, shippers, businesses and residents requires that innovative and effective transportation management actions be developed and implemented. This paper reports the major findings and recommendations of a research study on managing transportation during highway, reconstruction. The primary objectives of the study were

Not All Transfers Are Created Equal: Towards a Framework Relating Transfer Connectivity to Travel Behaviour

Abstract

Walking from origins to transit stops, transferring between transit lines and walking from transit stops to destinations—all add to the burden of transit travel, sometimes to a very large degree. Transfers in particular can be stressful and/or time‐consuming for travellers, discouraging transit use. As such, transit facilities that reduce the burdens of walking, waiting and transferring can substantially increase transit system efficacy and use. In this paper, we argue that transit planning research on transit stops and stations, and transit planning practice frequently lack a clear conceptual framework relating transit waits and transfers with what we know about travel behaviour. Therefore, we draw on the concepts of transfer penalties and value of time in the travel behaviour/economics literature to develop a framework that situates transfer penalties within the total travel generalized costs of a transit trip. For example, value of time is important in relating actual time of waiting and walking to the perceived time of travel. We also draw on research to classify factors most important to users’ perspectives and travel behaviour—transfer costs, time scheduling and five transfer facility attributes: (1) access, (2) connection and reliability, (3) information, (4) amenities, and (5) security and safety. Using this framework, we seek to explicitly relate improvements of transfer stops/stations with components of transfer penalties and changes in travel behaviour (through a reduction in transfer penalties). We conclude that the employment of such a framework can help practitioners better apply the most effective improvements to transit stops and transfer facilities.     

The demand for public transport. part II. supply and demand factors of public transport

Abstract

This two‐part article, concerned with the way public transport ridership is affected by the various relevant factors, is based on the Executive Summary of The Demand for Public Transport (Webster and Bly 1980), the report of the TRRL‐sponsored International Collaborative Study on Factors Affecting Public Transport Patronage. Part I of the article, which was concerned with the social and economic conditions in which public transport operates, showed the importance of the background factors such as income, car ownership and land use on public transport usage: it also indicated how the longer‐term impacts of the more direct demand factors (fares, service levels) often show themselves in changes in car ownership levels, activity patterns (i.e. where people live, work, shop, socialize, etc) and land‐use development.

Part II reviews the current state of knowledge on the effects of changes in fare levels and quality of service and of the introduction of various traffic and transport measures (traffic restraint, bus priority, etc): it outlines current methodology on costing public transport services and draws the supply and demand sides together in a consideration of particular strategies which are at the disposal of the operator, the planner and the policy maker.     

A subway planning bi-objective multi-period optimization model integrating timetabling and vehicle scheduling: a case study of Tehran

Due to the interaction among different planning levels and various travel demands during a day, the transit network planning is of great importance. In this paper, a bi-objective multi-period planning model is proposed for the synchronization of timetabling and vehicle scheduling. The main aim of the problem is to minimize the weighted transfer waiting time in the interchange stations along with the operational costs of vehicles. In order to demonstrate the effectiveness of the proposed integrated model, a real case study of Tehran subway is considered. The proposed model is solved by the ε-constraint method and some outstanding results are achieved.

     

Demand responsive transit systems with time-dependent demand: User equilibrium,system optimum,and management strategy

The operating cost of a demand responsive transit (DRT) system strictly depends on the quality of service that it offers to its users. An operating agency seeks to minimize operating costs while maintaining the quality of service while users experience costs associated with scheduling, waiting, and traveling within the system. In this paper, an analytical model is employed to approximate the agency's operating cost for running a DRT system with dynamic demand and the total generalized cost that users experience as a result of the operating decisions. The approach makes use of Vickrey's (1969) congestion theory to model the dynamics of the DRT system in the equilibrium condition and approximate the generalized cost for users when the operating capacity is inadequate to serve the time-dependent demand over the peak period without excess delay. The efficiency of the DRT system can be improved by optimizing one of three parameters that define the agency's operating decision: (1) the operating capacity of the system, (2) the number of passengers that have requested a pick-up and are awaiting service, and (3) the distribution of requested times for service from the DRT system. A schedule management strategy and dynamic pricing strategies are presented that can be implemented to manage demand and reduce the total cost of the DRT system by keeping the number of waiting requests optimized over the peak period. In the end, proposed optimization strategies are compared using a numerical example.     

A case study of Beijing bus crew scheduling: a variable neighborhood‐based approach

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.     

The use of GIS and relational database management systems to improve the scheduling operations of paratransit

The scheduling operations of many paratransit agencies in the United States are undertaken manually. Those customers who are eligible to travel call in their requests the day before the trip is needed. As the trip requests are received, they are entered into a list of unscheduled trips. In order to schedule these trips, the scheduler must first determine the number of drivers and shuttle buses that are available as well as the time of availability of each. The scheduler must then try to match the rides that are in “similar” areas around the “same” time to place together on the driver's schedule. As new trip requests are made, the schedulers must adjust the trips that are already scheduled to try and schedule as many trips as possible in the most efficient way.

By developing a system that would improve the scheduling system operations of, in this case, DART (Delaware Administration for Regional Transit) First State Paratransit, customers can expect to receive better service that will improve their ability to travel throughout the community. Some devices that could also improve the operations of paratransit agencies are described in this paper, such as satellite‐based Global Positioning System (GPS), radio communication systems, mobile computers, radio frequency‐based data communication systems, internet web pages, automated paratransit information systems, and card‐based data storage and transfer media. However, because paratransit systems are difficult to operate cost‐efficiently, the optimum and most cost‐efficient device must be selected. The system chosen for DART First State Paratransit includes the use of a relational database management system (RDMS) and a transportation Geographic Information System (GIS). RDMS keeps track of the database information as well as the scheduled trips and the GIS is ideal for analyzing both geographic and temporal data. This system is shown to be superior to the manual system.     

A stochastic computational model for yellow time determination and its application

This paper proposes a stochastic model to determine the yellow time according to the occurring probability of Type‐I dilemma zone (P_DZ). Unlike the conventional methods generally based on the deterministic traffic flow theory, the proposed model fully accounts for the randomness of input variables such as approaching speed, deceleration rate, perception‐and‐reaction time, and distance to stop‐line at the yellow onset. A theoretical model is firstly established, and a computational program incorporating Monte Carlo Simulation is then developed to facilitate its general solution. These two alternative solution approaches to derive P_DZ and Y are proposed, depending upon whether D/V and (τ + V/2d) follow certain analytical distributions or not. In addition, field data at a typical high‐speed highway intersection are collected to validate the model. Based on the validated model, comprehensive sensitivity analysis is conducted to look into the entire picture of the relationship between P_DZ and the distributions as well as correlations of the input variables. To demonstrate the application of the proposed model, the required yellow times for various conditions are calculated based on the acceptable levels of P_DZ, and representative application tables for typical cases are finally provided. With the aid of the proposed methodology, traffic engineers are capable of designing yellow time in a more sophisticated manner. Copyright © 2014 John Wiley & Sons, Ltd.     

Train delay and perceived-wait time: passengers' perspective

Abstract

Waiting time influences the overall perception of service quality. The passenger-perceived waiting time can determine their waiting experience. The concept of waiting time refers to the comparison between the passengers' inherent tolerance of waiting and the possible improvement scenarios. This study investigates the passengers' tolerance of waiting under various scenarios of train delays in order to improve their perceived waiting time. We propose the adoption of a modern psychometric method utilizing the Rasch model to measure a subjective latent construct known as ‘wait tolerance'. The Rasch measurement provides mathematical procedures for transforming scores from an ordinal to an interval scale to observe which scenarios can reduce certain passengers' perceived waiting time in the case of a delay. Empirical results show that ‘uncontrollable circumstances', ‘friendly staff attitudes', and ‘providing appropriate messages of apology' can improve the passenger-perceived waiting time during train delays. Likewise, distinct differences are found in the passengers' tolerance of waiting in terms of various personal characteristics, such as gender, age, and train riding frequency. The findings propose the implementation of strategies for improvement by rail system operators, as well as for regulators to define a reasonable service level in the case of train delays. The reviews show possible future innovative research orientations as well.     

The design of single allocation incomplete hub networks

The hub location problem deals with finding the location of hub facilities and allocating the demand nodes to these hub facilities so as to effectively route the demand between any origin–destination pair. In the extensive literature on this challenging network design problem, it has widely been assumed that the subgraph induced by the hub nodes is complete. Relaxation of this basic assumption constitutes the starting point of the present work. In this study, we provide a uniform modeling treatment to all the single allocation variants of the existing hub location problems, under the incomplete hub network design. No network structure other than connectivity is imposed on the induced hub network. Within this context, the single allocation incomplete p-hub median, the incomplete hub location with fixed costs, the incomplete hub covering, and the incomplete p-hub center network design problems are defined, and efficient mathematical formulations for these problems with O(n³) variables are introduced. Computational analyses with these formulations are presented on the various instances of the CAB data set and on the Turkish network.     

An energy-efficient scheduling approach to improve the utilization of regenerative energy for metro systems

Regenerative braking is an energy recovery mechanism that converts the kinetic energy during braking into electricity, also known as regenerative energy. In general, most of the regenerative energy is transmitted backward along the pantograph and fed back into the overhead contact line. To reduce the trains’ energy consumption, this paper develops a scheduling approach to coordinate the arrivals and departures of all trains located in the same electricity supply interval so that the energy regenerated from braking trains can be more effectively utilized to accelerate trains. Firstly, we formulate an integer programming model with real-world speed profiles to minimize the trains’ energy consumption with dwell time control. Secondly, we design a genetic algorithm and an allocation algorithm to find a good solution. Finally, we present numerical examples based on the real-life operation data from the Beijing Metro Yizhuang Line in Beijing, China. The results show that the proposed scheduling approach can reduce energy consumption by 6.97% and save about 1,054,388 CNY (or 169,223 USD) each year in comparison with the current timetable. Compared to the cooperative scheduling (CS) approach, the proposed scheduling approach can improve the utilization of regenerative energy by 36.16% and reduce the total energy consumption by 4.28%.     

The Vehicle Routing Problem: The Case of the Hong Kong Postal Service

Abstract

With the growth in population and development of business activities in Hong Kong, the range and level of services provided by Hongkong Post have multiplied. However, the schedule of its postal vehicles, including mail collection and delivery, is still constructed manually on a daily basis, based on the experience of staff and transportation reviews. In this paper, the problem of scheduling a set of n collection points (District Post Offices) from a depot (General Post Office) in Hong Kong Island is addressed. The objectives pursued are the maximization of resource utilization and minimization of operation costs. In other words, the variable cost is expected to be reduced. To achieve these goals, an integer linear programming (IP) model of the vehicle routing problem (VRP) is developed in an effort to obtain optimal solutions. As the model involves computational complexity, a commercial software package CPLEX is used to solve the problems efficiently. The results show that the proposed model can produce optimal vehicle routes and schedules.