A multi-period dial-a-ride problem with driver consistency

Dial-a-ride services provide disabled and elderly people with a personalized mode of transportation to preserve their mobility. Typically, several users with different pickup and dropoff locations are transported on a vehicle simultaneously. The focus in dial-a-ride problems (DARPs) is mainly on minimizing routing cost. Service quality has been taken into account in the models by imposing time windows and limiting the maximum ride time of each user. We extend the classical DARP by an additional feature of service quality referred to as driver consistency. Customers of dial-a-ride services are often sensitive to changes in their daily routine. This aspect includes the person who is providing the transportation service, i.e., the driver of the vehicle. Our problem, called the driver consistent dial-a-ride problem (DC-DARP), considers driver consistency by bounding the maximum number of different drivers that transport a user over a multi-period planning horizon.We propose different formulations of the problem and examine their efficiency when applied in a Branch-and-Cut fashion. Additionally, we develop a large neighborhood search algorithm that generates near-optimal solutions in a short amount of time.Over 1000 instances are generated with close reference to real world scenarios. Extensive computational experiments are conducted in order to assess the quality of the solution approaches and to provide insights into the new problem. Results reveal that the cost of offering driver consistency varies greatly in magnitude. Depending on the instance, the cost of assigning one driver to each user can be up to 27.98% higher compared to a low-cost solution. However, routing cost increases by not more than 5.80% if users are transported by at least two drivers.     

Effects of contracting on cost efficiency in US fixed-route bus transit service

Contracted service comprises a significant proportion of total operating expenses in the provision of fixed-route bus transit service in the US. Despite its importance, the literature on the economic effects of transit service contracting has been limited to only a few studies since the mid-1990s, and is inconclusive due to problems with the nature and methodology of the past studies.This paper examines how the cost efficiency of providing fixed-route bus transit service varies by the degree of contracting. I make several improvements to previous studies and conduct a regression analysis that: (1) addresses the endogeneity problem between the contracting decision and cost efficiency, (2) differentiates between agencies that contract out only a portion of service from those that contract out all service, (3) takes into account the moderating effects of several factors on the effect of contracting on cost efficiency, and (4) uses a relatively larger set of cross-sectional time-series data constructed from the National Transit Database from 1992 to 2000.The analysis results show that the combined effects of contracting lower operating costs by $4.09 and $2.89 per vehicle hour for partial and full-contracting agencies, respectively, in the average case. These average cost savings translate into 7.8% and 5.5%, using the average operating cost per vehicle hour of $53.06. However, this improvement is not universal, because the effects of contracting on cost efficiency vary by factors such as peak-to-base ratio, agency size, the wage gap between bus operators in the public and private sectors, and agency type.     

A revised branch‐and‐price algorithm for dial‐a‐ride problems with the consideration of time‐dependent travel cost

Developing demand responsive transit systems are important with regard to meeting the travel needs for elderly people. Although Dial‐a‐ride Problems (DARP) have been discussed for several decades, most researchers have worked to develop algorithms with low computational cost under the minimal total travel costs, and fewer studies have considered how changes in travel time might affect the vehicle routes and service sequences. Ignoring such variations in travel time when design vehicle routes and schedules might lead to the production of inefficient vehicle routes, as well as incorrect actual vehicle arrival times at the related nodes. The purpose of this paper is to construct a DARP formulation with consideration of time‐dependent travel times and utilizes the traffic simulation software, DynaTAIWAN, to simulate the real traffic conditions in order to obtain the time‐dependent travel time matrices. The branch‐and‐price approach is introduced for the time‐dependent DARP and tested by examining the sub‐network of Kaohsiung City, Taiwan. The numerical results reveal that the length of the time window can significantly affect the vehicle routes and quantitative measurements. As the length of the time window increases, the objective value and the number of vehicles will reduce significantly. However, the CPU time, the average pickup delay time, the average delivery delay time and the average actual ride time (ART)/direct ride time (DRT) will increase significantly as the length of the time window increases. Designing the vehicle routes to reduce operating costs and satisfy the requirements of customers is a difficult task, and a trade‐off must be made between these goals. Copyright © 2014 John Wiley & Sons, Ltd.     

Transportation service procurement problem with transit time

In this work, we investigate transit time in transportation service procurement, which is conducted by shippers using auctions to purchase transportation service from carriers in the planning stage. Besides cost, we find that many shippers are most concerned with transit time in practice; shorter transit time indicates better transportation service. To minimize both the total cost and transit time, the problem faced by shippers is the biobjective transportation service procurement problem with transit time. To solve the problem, we introduce a biobjective integer programming model that can also accommodate some important business constraints. A biobjective branch-and-bound algorithm that finds all extreme supported nondominated solutions is developed. To speed up the algorithm, two fast feasibility checks, a network flow model for particular subproblems, and lower bounds from relaxation are proposed. In addition, a sophisticated heuristic is introduced to meet shipper’s requirements in some situations. Computational experiments on evaluating the performance of the algorithms are conducted on a set of test instances that are generated from practical data.     

Boundedly rational user equilibria (BRUE): Mathematical formulation and solution sets

Boundedly rational user equilibria (BRUE) represent traffic flow distribution patterns where travellers can take any route whose travel cost is within an ‘indifference band’ of the shortest path cost. Those traffic flow patterns satisfying the above condition constitute a set, named the BRUE solution set. It is important to obtain all the BRUE flow patterns, because it can help predict the variation of the link flow pattern in a traffic network under the boundedly rational behavior assumption. However, the methodology of constructing the BRUE set has been lacking in the established literature. This paper fills the gap by constructing the BRUE solution set on traffic networks with fixed demands. After defining ε-BRUE, where ε is the indifference band for the perceived travel cost, we formulate the ε-BRUE problem as a nonlinear complementarity problem (NCP), so that a BRUE solution can be obtained by solving a BRUE–NCP formulation. To obtain the BRUE solution set encompassing all BRUE flow patterns, we propose a methodology of generating acceptable path set which may be utilized under the boundedly rational behavior assumption. We show that with the increase of the indifference band, the acceptable path set that contains boundedly rational equilibrium flows will be augmented, and the critical values of indifference band to augment these path sets can be identified by solving a family of mathematical programs with equilibrium constraints (MPEC) sequentially. The BRUE solution set can then be obtained by assigning all traffic demands to the acceptable path set. Various numerical examples are given to illustrate our findings.     

Optimal scheduling of a taxi fleet with mixed electric and gasoline vehicles to service advance reservations

This study addresses the problem of scheduling a fleet of taxis that are appointed to solely service customers with advance reservations. In contrast to previous studies that have dealt with the planning and operations of a taxi fleet with only electric vehicles (EVs), we consider that most taxi companies may have to operate with fleets comprised of both gasoline vehicles (GVs) and plug-in EVs during the transition from GV to (complete) EV taxi fleets. This paper presents an innovative multi-layer taxi-flow time-space network which effectively describes the movements of the taxis in the dimensions of space and time. An optimization model is then developed based on the time-space network to determine an optimal schedule for the taxi fleet. The objective is to minimize the total operating cost of the fleet, with a set of operating constraints for the EVs and GVs included in the model. Given that the model is formulated as an integer multi-commodity network flow problem, which is characterized as NP-hard, we propose two simple but effective decomposition-based heuristics to efficiently solve the problem with practical sizes. Test instances generated based on the data provided by a Taiwan taxi company are solved to evaluate the solution algorithms. The results show that the gaps between the objective values of the heuristic solutions and those of the optimal solutions are less than 3%, and the heuristics require much less time to obtain the good quality solutions. As a result, it is shown that the model, coupled with the algorithms, can be an effective planning tool to assist the company in routing and scheduling its fleet to service reservation customers.     

Bus routing strategies in a transit market: A case study of Hong Kong

Conventionally, the objective of transit routing is often set either to minimize the total operational cost, subject to a given level of service quality, or to maximize the service quality at a given acceptable cost. In a deregulated, commercial‐based environment however, such as bus and railway operations in cities of the UK and Hong Kong where several private firms compete in route‐based or area‐based market, routing becomes one of the means for higher returns rather than just for cost saving. In such a case, how do the transit providers set up their routes for profit‐maximization? Will the routing based on the provider's objective meet the user's objective? How do government regulations and policies affect the choice of transit provider's routing strategy? To answer these questions, we first examine the relationship between the objectives of users and transit providers, set up criteria for transit routing quality, and then investigate the possible routing configurations/patterns for a hypothetical case. These criteria include (1) the load factor of transit, (2) the level of route directness, (3) the level of route overlapping, and (4) the total number of routes and (5) the average of route length. These measures are finally applied to a real case in Hong Kong to examine the route changes of Kowloon Motor Bus from 1975 to 1995. The result of the empirical case reveais how key measures such as load factor are controlled by the bus operator and affected by government policies and how the bus routing pattern was adjusted to meet users' need. Facing the dilemma as evident in Hong Kong between the route directness and the efficiency of road use, we suggest that a rational multi‐modal routing structure be put in place if an institutional solution is introduced so that bus and other transit modes can form a sharing program or an alliance.     

Cost scaling based successive approximation algorithm for the traffic assignment problem

This paper presents a cost scaling based successive approximation algorithm, called ε-BA (ε-optimal bush algorithm), to solve the user equilibrium traffic assignment problem by successively refining ε-optimal flows. As ε reduces to zero, the user equilibrium solution is reached. The proposed method is a variant of bush-based algorithms, and also a variant of the min-mean cycle algorithm to solve the min-cost flow by successive approximation. In ε-BA, the restricted master problem, implying traffic equilibration restricted on a bush, is solved to ε-optimality by cost scaling before bush reconstruction. We show that ε-BA can reduce the number of flow operations substantially in contrast to Dial’s Algorithm B, as the former operates flows on a set of deliberately selected cycles whose mean values are sufficiently small. Further, the bushes can be constructed effectively even if the restricted master problem is not solved to a high level of convergence, by leveraging the ε-optimality condition. As a result, the algorithm can solve a highly precise solution with faster convergence on large-scale networks compared to our implementation of Dial’s Algorithm B.     

A math-heuristic algorithm for the integrated air service recovery

A sophisticated flight schedule might be easily disrupted due to adverse weather, aircraft mechanical failures, crew absences, etc. Airlines incur huge costs stemming from such flight schedule disruptions in addition to the serious inconveniences experienced by passengers. Therefore, an efficient recovery solution that simultaneously decreases an airline's recovery cost while simultaneously mitigating passenger dissatisfaction is of great importance to the airline industry. In this paper, we study the integrated airline service recovery problem in which the aircraft and passenger schedule recovery problems are simultaneously addressed, with the objective of minimizing aircraft recovery and operating costs, passenger itinerary delay cost, and passenger itinerary cancellation cost.Recognizing the inherent difficulty in modeling the integrated airline service recovery problem within a single formulation (due to its huge solution space and quick response requirement), we propose a three-stage sequential math-heuristic framework to efficiently solve this problem, wherein the flight schedules and aircraft rotations are recovered in the first stage, Then, a flight rescheduling problem and passenger schedule recovery problems are iteratively solved in the next two stages. Time-space network flow representations, along with mixed-integer programming formulations, and algorithms that take advantages of the underlying problem structures, are proposed for each of three stages. This algorithm was tested on realistic data provided by the ROADEF 2009 challenge and the computational results reveal that our algorithm generated the best solution in nearly 72% of the test instances, and a near-optimal solution was achieved in the remaining instances within an acceptable timeframe. Furthermore, we also ran additional computational runs to explore the underlying characteristics of the proposed algorithm, and the recorded insights can serve as a useful guide during practical implementations of this algorithm.     

Service quality––developing a service quality index in the provision of commercial bus contracts

The measurement of service quality continues to be a challenging research theme and one of great practical importance to service providers and regulatory agencies. The key challenges begin with the identification of the set of potentially important dimensions of service quality perceived by passengers, current and potential. We then have to establish a way of measuring each attribute and identifying their relative importance in the overall calculation of satisfaction associated with existing service levels. Once a set of relevant attributes has been identified, this information can be integrated into programs such as monitoring and benchmarking, and even in contract specification. This paper, building on earlier research by the authors, investigates ways of quantifying service quality and comparing the levels within and between bus operators. The importance of establishing suitable market segments and the need to scale the service quality index for each operator to make meaningful comparisons is highlighted.     

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.     

Solving the bicriterion routing and scheduling problem for hazardous materials distribution

Hazardous materials routing and scheduling decisions involve the determination of the minimum cost and/or risk routes for servicing the demand of a given set of customers. This paper addresses the bicriterion routing and scheduling problem arising in hazardous materials distribution planning. Under the assumption that the cost and risk attributes of each arc of the underlying transportation network are time-dependent, the proposed routing and scheduling problem pertains to the determination of the non-dominated time-dependent paths for servicing a given and fixed sequence of customers (intermediate stops) within specified time windows. Due to the heavy computational burden for solving this bicriterion problem, an alternative algorithm is proposed that determines the k-shortest time-dependent paths. Moreover an algorithm is provided for solving the bicriterion problem. The proximity of the solutions of the k-shortest time-dependent path problem with the non-dominated solutions is assessed on a set of problems developed by the authors.     

The recoverable robust facility location problem

This work deals with a facility location problem in which location and allocation (transportation) policy is defined in two stages such that a first-stage solution should be robust against the possible realizations (scenarios) of the input data that can only be revealed in a second stage. This solution should be robust enough so that it can be recovered promptly and at low cost in the second stage. In contrast to some related modeling approaches from the literature, this new recoverable robust model is more general in terms of the considered data uncertainty; it can address situations in which uncertainty may be present in any of the following four categories: provider-side uncertainty, receiver-side uncertainty, uncertainty in-between, and uncertainty with respect to the cost parameters.For this novel problem, a sophisticated branch-and-cut framework based on Benders decomposition is designed and complemented by several non-trivial enhancements, including scenario sorting, dual lifting, branching priorities, matheuristics and zero-half cuts. Two large sets of instances that incorporate spatial and demographic information of countries such as Germany and US (transportation) and Bangladesh and the Philippines (disaster management) are introduced. They are used to analyze in detail the characteristics of the proposed model and the obtained solutions as well as the effectiveness, behavior and limitations of the designed algorithm.     

Determining structural route components from GPS traces

Analysis of GPS traces shows that people often do not use the least cost path through the transportation network while making trips. This leads to the question which structural path characteristics can be used to construct realistic route choice sets for use in traffic simulation models. In this paper, we investigate the hypothesis that, for utilitarian trips, the route between origin and destination consists of a small number of concatenated least cost paths. The hypothesis is verified by analyzing routes extracted from large sets of recorded GPS traces which constitute revealed preference information. Trips have been extracted from the traces and for each trip the path in the transportation network is determined by map matching. This is followed by a path decomposition phase for which the algorithm constitutes the first contribution of this paper. There are multiple ways to split a given path in a directed graph into a minimal number of subpaths of minimal cost. By calculating two specific path splittings, it is possible to identify subsets of the vertices (splitVertexSuites) that can be used to generate every possible minimum path splitting by taking one vertex from each such subset. As a second contribution, we show how the extracted information is used in microscopic travel simulation. The distribution for the size of the minimum decomposition, extracted from the GPS traces, can be used in constrained enumeration methods for route choice set generation. The sets of vertices that can act as boundary vertices separating consecutive route parts contain way points (landmarks) having a particular meaning to their user. The paper explains the theoretical aspects of route splitting as well as the process to extract splitVertexSuites from big data. It reports statistical distributions extracted from sets of GPS traces for both multimodal person movements and unimodal car trips.     

Access control policies without inside queues: Their properties and public policy implications

An access control policy that eliminates all queues beyond the entry points to a network has obvious benefits, which include smooth travel and predictable travel times inside the network. Yet it has never been proven, to the best of our knowledge, whether excluding inside queues yields sub-optimal network performance or, in other words, allowing inside queues can actually further reduce the system travel cost. Moreover, it is not clear whether an optimal control policy derived from efficiency considerations can also be a fair policy to all road users. This paper provide answers to these questions in the context of a monocentric network. By analyzing the structure of the access control problem considering all feasible policies (with/without inside queues), we show that the minimal system cost realizable by access control can be obtained without directly solving a non-convex optimization program, and can indeed always be achieved by a control policy excluding all of the inside queues. These optimal policies are defined by a polyhedral set and a Finite Generation Algorithm can be applied to derive the analytical form of this set. The optimal policies are not unique in general, thus making it possible to achieve both minimal system cost and fairness simultaneously.     

Evolution of public transit modes in a commuter corridor

This paper explores how the selection of public transit modes can be optimized over a planning horizon. This conceptual analysis sacrifices geographic detail in order to better highlight the relations among important factors. First, a set of static models is proposed to identify which type of service, e.g., bus only, rail only, or bus and rail, is the most cost-effective in terms of the average trip cost for given demand. After analyzing essential factors in a long-term planning process, e.g., economies of scale in rail extension and future cost discounting, a dynamic model incorporating such considerations is formulated to optimize the decision over a planning horizon. While analytical solutions can be obtained for some decision variables, the final model is solved with a graphical method by exploring the tradeoffs between the initial and recurring costs. Major findings from this study include: (a) there exists a minimum economic length for a rail line, which can be determined numerically; (b) economies of scale favor large extensions and excess supplied capacity; (c) the rail-only service is largely dominated by the feeder-trunk service, even in the long run.     

Integrated transit services for minimum cost operation considering heterogeneous demand

Abstract

In large metropolitan areas, public transit is a major mode choice of commuters for their daily travel, which has an important role in relieving congestion on transportation corridors. The purpose of this study is to develop a model which optimizes service patterns (SPs) and frequencies that yield minimum cost transit operation. Considering a general transit route with given stops and origin-destination demand, the proposed model consists of an objective total cost function and a set of constraints to ensure frequency conservation and sufficient capacity subject to operable fleet size. A numerical example is provided to demonstrate the effectiveness of the developed model, in which the demand and facility data of a rail transit route were given. Results show that the proposed model can be applied to optimize integrated SPs and headways that significantly reduce the total cost, while the resulting performance indicators are generated.     

A proposal for cost-related and market-oriented train running charges

This paper examines some key aspects of a charging system for promoting railway transport, including charges reflecting a clear relationship with costs (transparency) and charges reflecting the quality of the infrastructure manager's service. Train running charges recover track-related costs and can help to develop a charging system that meets these requirements. To orient train running charges to the market, a method for processing track maintenance and renewal costs is proposed whereby the quality of the service provided by an infrastructure is measured according to its utility to the railway undertaking. To achieve transparency, a single indicator is used for cost planning and the subsequent levying of costs on railway undertakings. The paper includes an example of how proposed train running charges would be calculated according to data from 14 European countries. The example shows that short-distance trains generate the lowest maintenance and renewal costs, followed by long-distance trains and freight trains.     

High‐speed rail cost recovery time based on an integer optimization model

With increasing gasoline prices, electric high‐speed rail (HSR) systems represent one means to mitigate overexposure to volatile prices. However, additional research is needed related to funding this infrastructure. In this paper, we develop a new integer optimization model to address this problem and use a hypothetical case study to demonstrate the approach. The objective of the approach is to minimize the time period in which the cost of HSR construction and operation can be recovered. This is an iterative process based on an integer optimization model, whose objective function is to determine the optimum recovery time (ORT), by setting the HSR ticket price and frequency. Embedded in the optimization model is a multinomial logit model for calculating the demand for HSR as a function of these decision variables, thus capturing the effects of level of service on market share. In particular, the optimization model accounts for the role of different types of subsidies toward HSR construction (one‐time subsidies at construction, annual subsidies, and subsidies depending on frequency). This method can also help determine whether an HSR system should be built or how much subsidy should be provided given a fixed expected cost recovery time. By integrating the logit model into the objective function evaluation, the effects of ticket price and service frequency on service demand can be directly captured. Copyright © 2014 John Wiley & Sons, Ltd.     

Solving the Fleet Size and Mix Vehicle Routing Problem with Time Windows via Adaptive Memory Programming

This paper presents a novel Adaptive Memory Programming (AMP) solution approach for the Fleet Size and Mix Vehicle Routing Problem with Time Windows (FSMVRPTW). The FSMVRPTW seeks to design a set of depot returning vehicle routes to service a set of customers with known demands, for a heterogeneous fleet of vehicles with different capacities and fixed costs. Each customer is serviced only once by exactly one vehicle, within fixed time intervals that represent the earliest and latest times during the day that service can take place. The objective is to minimize the total transportation costs, or similarly to determine the optimal fleet composition and dimension following least cost vehicle routes. The proposed method utilizes the basic concept of an AMP solution framework equipped with a probabilistic semi-parallel construction heuristic, a novel solution re-construction mechanism, an innovative Iterated Tabu Search algorithm tuned for intensification local search and frequency-based long term memory structures. Computational experiments on well-known benchmark data sets illustrate the efficiency and effectiveness of the proposed method. Compared to the current state-of-the-art, the proposed method improves the best reported cumulative and mean results over most problem instances with reasonable computational requirements.