Switching service types for multi-region bus systems

Conventional fixed-route bus services are generally preferred to flexible-route services at high demand densities, and vice versa. This paper formulates the problem of integrating conventional and flexible services that connect a main terminal to multiple local regions over multiple time periods. The system’s vehicle size, route spacing (for conventional services), service area (for flexible services), headways and fleet sizes are jointly optimized to minimize the sum of supplier costs and user costs. The route spacing for conventional bus services and service area for flexible bus services are also optimized for each region. The proposed solution method, which uses a genetic algorithm and analytic optimization, finds good solutions quickly. Numerical examples and sensitivity analyses confirm that the single fleet variable-type bus service may outperform either the single fleet conventional bus service or the single fleet flexible bus service when demand densities vary substantially among regions and time periods.     

The time-dependent pollution-routing problem

The Time-Dependent Pollution-Routing Problem (TDPRP) consists of routing a fleet of vehicles in order to serve a set of customers and determining the speeds on each leg of the routes. The cost function includes emissions and driver costs, taking into account traffic congestion which, at peak periods, significantly restricts vehicle speeds and increases emissions. We describe an integer linear programming formulation of the TDPRP and provide illustrative examples to motivate the problem and give insights about the tradeoffs it involves. We also provide an analytical characterization of the optimal solutions for a single-arc version of the problem, identifying conditions under which it is optimal to wait idly at certain locations in order to avoid congestion and to reduce the cost of emissions. Building on these analytical results we describe a novel departure time and speed optimization algorithm for the cases when the route is fixed. Finally, using benchmark instances, we present results on the computational performance of the proposed formulation and on the speed optimization procedure.     

Integrating bus services with mixed fleets

Conventional bus service (with fixed routes and schedules) has lower average cost than flexible bus service (with demand-responsive routes) at high demand densities. At low demand densities flexible bus service has lower average costs and provides convenient door-to-door service. Bus size and operation type are related since larger buses have lower average cost per passenger at higher demand densities. The operation type and other decisions are jointly optimized here for a bus transit system connecting a major terminal to local regions. Conventional and flexible bus sizes, conventional bus route spacings, areas of service zones for flexible buses, headways, and fleet sizes are jointly optimized in multi-dimensional nonlinear mixed integer optimization problems. To solve them, we propose a hybrid approach, which combines analytic optimization with a Genetic Algorithm. Numerical analysis confirms that the proposed method provides near-optimal solutions and shows how the proposed Mixed Fleet Variable Type Bus Operation (MFV) can reduce total cost compared to alternative operations such as Single Fleet Conventional Bus (SFC), Single Fleet Flexible Bus (SFF), Mixed Fleet Conventional Bus (MFC) and Mixed Fleet Flexible Bus (MFF). With consistent system-wide bus sizes, capital costs are reduced by sharing fleets over times and over regions. The sensitivity of results to several important parameters is also explored.     

The fleet size and mix dial-a-ride problem with reconfigurable vehicle capacity

This paper introduces a fleet size and mix dial-a-ride problem with multiple passenger types and a heterogeneous fleet of reconfigurable vehicles. In this new variant of the dial-a-ride problem, en-route modifications of the vehicle’s inner configuration are allowed. The main consequence is that the vehicle capacity is defined by a set of configurations and the choice of vehicle configuration is associated with binary decision variables.The problem is modeled as a mixed-integer program derived from the model of the heterogeneous dial-a-ride problem. Vehicle reconfiguration is a lever to efficiently reduce transportation costs, but the number of passengers and vehicle fleet setting make this problem intractable for exact solution methods. A large neighborhood search metaheuristic combined with a set covering component with a reactive mechanism to automatically adjust its parameters is therefore proposed. The resulting framework is evaluated against benchmarks from the literature, used for similar routing problems. It is also applied to a real case, in the context of the transportation of disabled children from their home to medical centers in the city of Lyon, France.     

Charging infrastructure demands of shared-use autonomous electric vehicles in urban areas

Ride-hailing is a clear initial market for autonomous electric vehicles (AEVs) because it features high vehicle utilization levels and strong incentive to cut down labor costs. An extensive and reliable network of recharging infrastructure is the prerequisite to launch a lucrative AEV ride-hailing fleet. Hence, it is necessary to estimate the charging infrastructure demands for an AEV fleet in advance. This study proposes a charging system planning framework for a shared-use AEV fleet providing ride-hailing services in urban area. We first adopt an agent-based simulation model, called BEAM, to describe the complex behaviors of both passengers and transportation systems in urban cities. BEAM simulates the driving, parking and charging behaviors of the AEV fleet with range constraints and identifies times and locations of their charging demands. Then, based on BEAM simulation outputs, we adopt a hybrid algorithm to site and size charging stations to satisfy the charging demands subject to quality of service requirements. Based on the proposed framework, we estimate the charging infrastructure demands and calculate the corresponding economics and carbon emission impacts of electrifying a ride-hailing AEV fleet in the San Francisco Bay Area. We also investigate the impacts of various AEV and charging system parameters, e.g., fleet size, vehicle battery capacity and rated power of chargers, on the ride-hailing system’s overall costs.     

Influential vectors in fuel consumption by an urban bus operator: Bus route,driver behavior or vehicle type?

Energy costs account for an important share of the total costs of urban and suburban bus operators. The purpose of this paper is to expand empirical research on bus transit operation costs and identify the key factors that influence bus energy efficiency of the overall bus fleet of one operator and aid to the management of its resources.We estimate a set of multivariate regression models, using cross-section dataset of 488 bus drivers operating over 92 days in 2010, in 87 routes with different bus typologies, of a transit company operating in the Lisbon’s Metropolitan Area (LMA), Rodoviária de Lisboa, S.A.Our results confirm the existence of influential variables regarding energy efficiency and these are mainly: vehicle type, commercial speed, road grades over 5% and bus routes; and to a lesser extent driving events such as: sudden longitudinal decelerations and excessive engine rotation. The methodology proved to be useful for the bus operator as a decision-support tool for efficiency optimization purpose at the company level.     

Optimal timetable development for community shuttle network with metro stations

This paper investigates an issue for optimizing synchronized timetable for community shuttles linked with metro service. Considering a passenger arrival distribution, the problem is formulated to optimize timetables for multiple community shuttle routes, with the objective of minimizing passenger’s schedule delay cost and transfer cost. Two constraints, i.e., vehicle capacity and fleet size, are modeled in this paper. The first constraint is treated as soft, and the latter one is handled by a proposed timetable generating method. Two algorithms are employed to solve the problem, i.e., a genetic algorithm (GA) and a Frank–Wolfe algorithm combined with a heuristic algorithm of shifting departure times (FW-SDT). FW-SDT is an algorithm specially designed for this problem. The simulated and real-life examples confirm the feasibility of the two algorithms, and demonstrate that FW-SDT outperforms GA in both accuracy and effectiveness.     

The fleet size and mix pollution-routing problem

This paper introduces the fleet size and mix pollution-routing problem which extends the pollution-routing problem by considering a heterogeneous vehicle fleet. The main objective is to minimize the sum of vehicle fixed costs and routing cost, where the latter can be defined with respect to the cost of fuel and CO₂ emissions, and driver cost. Solving this problem poses several methodological challenges. To this end, we have developed a powerful metaheuristic which was successfully applied to a large pool of realistic benchmark instances. Several analyses were conducted to shed light on the trade-offs between various performance indicators, including capacity utilization, fuel and emissions and costs pertaining to vehicle acquisition, fuel consumption and drivers. The analyses also quantify the benefits of using a heterogeneous fleet over a homogeneous one.     

Inter-city bus routing and timetable setting under stochastic demands

Vehicle fleet routing and timetable setting are essential to the enhancement of an inter-city bus carrier’s operating cost, profit, level of service and competitiveness in the market. In past research the average passenger demand has usually served as input in the production of the final fleet routes and timetables, meaning that stochastic disturbances arising from variations in daily passenger demand in actual operations are neglected. To incorporate the stochastic disturbances of daily passenger demands that occur in actual operations, in this research, we established a stochastic-demand scheduling model. We applied a simulation technique, coupled with link-based and path-based routing strategies, to develop two heuristic algorithms to solve the model. To evaluate the performance of the proposed model and the two solution algorithms, we developed an evaluation method. The test results, regarding a major Taiwan inter-city bus operation, were good, showing that the model and the solution algorithms could be useful in practice.     

A cost-based maritime container assignment model

A recently proposed frequency-based maritime container assignment model (Bell et al., 2011) seeks an assignment of full and empty containers to paths that minimises expected container travel time, whereas containers are in practice more likely to be assigned to minimise expected cost. A cost-based container assignment model is proposed here. It is assumed that routes and service frequencies are given so ship operating costs are also fixed. The objective is to assign containers to routes to minimise container handling costs, container rental and inventory costs. The constraints in the model are extended to include route as well as port capacities. It is shown that the problem remains a linear program. A numerical example is presented to illustrate the properties of the model. The paper concludes by considering the many applications of the proposed maritime container assignment model.     

Jointly optimizing cost, service, and environmental performance in demand-responsive transit scheduling

In certain fleet systems, the environmental impacts of operation are, to some extent, a controllable function of vehicle routing and scheduling decisions. However, little prior work has considered environmental impacts in fleet vehicle routing and scheduling optimization, in particular, where the impacts were assessed systematically utilizing life-cycle impact assessment methodologies such as those described by the Society of Environmental Chemistry and Toxicology. Here a methodology is presented for the joint optimization of cost, service, and life-cycle environmental consequences in vehicle routing and scheduling, which we develop for a demand-responsive (paratransit or dial-a-ride) transit system. We demonstrate through simulation that, as a result of our methodology, it is possible to reduce environmental impacts substantially, while increasing operating costs and service delays only slightly.     

Design framework of large-scale one-way electric vehicle sharing systems: A continuum approximation model

This paper proposes a Continuum Approximation (CA) model for design of a one-way Electrical Vehicle (EV) sharing system that serves a metropolitan area. This model determines the optimal EV sharing station locations and the corresponding EV fleet sizes to minimize the comprehensive system cost, including station construction investment, vehicle charging, transportation and vehicle balancing, under stochastic and dynamic trip demands. This is a very complex problem due to the NP-hard nature of location design, the large number of individual users, and the stochasticity and dynamics of generated trips. Further, the considerable charging time required by EVs distinguishes this problem from traditional car sharing problems where a vehicle is immediately available for pickup after being dropped at a station. We find that the CA approach can overcome these modeling challenges by decomposing the studied area into a number of small neighborhoods that each can be approximated by an Infinite Homogeneous Plane (IHP). We find that the system cost of an IHP is a unimodal function of the station service area size and can be efficiently solved in a sub-linear time by the bisection algorithm. Then integrating the solutions of all IHPs yields an approximate solution to the original heterogeneous area. With numerical experiments, we show that the CA solution is able to estimate the total system cost of the discrete counterpart solution efficiently with good accuracy, even for large-scale heterogeneous problems. This implies that the proposed CA approach is capable of providing a near-optimum solution to the comprehensive design of a practical large-scale EV sharing system. With this model, we also conduct sensitivity analysis to reveal insights into how cost components and system design vary with key parameter values. As far as the author’s knowledge, this study is the first work that addresses design of an EV sharing system considering both longer-term location and fleet size planning and daily vehicle operations. The proposed CA model also extends the CA methodology literature from traditional location problems with stationary demand, single-facility based service to EV sharing problems considering dynamic demands, OD trips, and nonlinear vehicle charging times.     

Transit network design with allocation of green vehicles: A genetic algorithm approach

The use of fossil fuels in transportation generates harmful emissions that accounts for nearly half of the total pollutants in urban areas. Dealing with this issue, local authorities are dedicating specific efforts to seize the opportunity offered by new fuels and technological innovations in achieving a cleaner urban mobility. In fact, authorities are improving environmental performances of their public transport fleet by procuring cleaner vehicles, usually called low and zero emission vehicles (LEV and ZEV, respectively). Nevertheless there seems to be a lack of methodologies for supporting stakeholders in decisions related to the introduction of green vehicles, whose allocation should be performed since the network design process in order to optimize their available green capacity.In this paper, the problem of clean vehicle allocation in an existing public fleet is faced by introducing a method for solving the transit network design problem in a multimodal, demand elastic urban context dealing with the impacts deriving from transportation emissions.The solving procedure consists of a set of heuristics which includes a routine for route generation and a genetic algorithm for finding a sub-optimal set of routes with the associated frequencies.     

Solution methods for the taxi pooling problem

In Taiwan, taxi pooling is currently performed by some taxi companies using a trial-and-error experience-based method, which is neither effective nor efficient. There is, however, little in the literature on effective models and solution methods for solving the taxi pooling problem. Thus, in this study we employ network flow techniques and a mathematical programming method to develop a taxi pooling solution method. This method is composed of three models. First, a fleet routing/scheduling model is constructed to produce fleet/passenger routes and schedules. A solution algorithm, based on Lagrangian relaxation, a sub-gradient method and a heuristic to find the upper bound of the solution, is proposed to solve the fleet routing/scheduling model. Then, two single taxi-passenger matching models are constructed with the goals of decreasing number of passenger transfers and matching all passengers and taxis. These two taxi-passenger matching models are directly solved using a mathematical programming solver. For comparison with the solution method, we also develop another heuristic by modifying a heuristic recently proposed for solving a one-to-many taxi pooling problem. The performance of the solution method and the additional heuristic are evaluated by carrying out a case study using real data and suitable assumptions. The test results show that these two solution methods could be useful in practice.     

A computational model for the probit‐based dynamic stochastic user optimal traffic assignment problem

This paper focuses on computational model development for the probit‐based dynamic stochastic user optimal (P‐DSUO) traffic assignment problem. We first examine a general fixed‐point formulation for the P‐DSUO traffic assignment problem, and subsequently propose a computational model that can find an approximated solution of the interest problem. The computational model includes four components: a strategy to determine a set of the prevailing routes between each origin–destination pair, a method to estimate the covariance of perceived travel time for any two prevailing routes, a cell transmission model‐based traffic performance model to calculate the actual route travel time used by the probit‐based dynamic stochastic network loading procedure, and an iterative solution algorithm solving the customized fixed‐point model. The Ishikawa algorithm is proposed to solve the computational model. A comparison study is carried out to investigate the efficiency and accuracy of the proposed algorithm with the method of successive averages. Two numerical examples are used to assess the computational model and the algorithm proposed. Results show that Ishikawa algorithm has better accuracy for smaller network despite requiring longer computational time. Nevertheless, it could not converge for larger network. Copyright © 2010 John Wiley & Sons, Ltd.     

The load-dependent vehicle routing problem and its pick-up and delivery extension

The present paper examines a Vehicle Routing Problem (VRP) of major practical importance which is referred to as the Load-Dependent VRP (LDVRP). LDVRP is applicable for transportation activities where the weight of the transported cargo accounts for a significant part of the vehicle gross weight. Contrary to the basic VRP which calls for the minimization of the distance travelled, the LDVRP objective is aimed at minimizing the total product of the distance travelled and the gross weight carried along this distance. Thus, it is capable of producing sensible routing plans which take into account the variation of the cargo weight along the vehicle trips. The LDVRP objective is closely related to the total energy requirements of the vehicle fleet, making it a credible alternative when the environmental aspects of transportation activities are examined and optimized. A novel LDVRP extension which considers simultaneous pick-up and delivery service is introduced, formulated and solved for the first time. To deal with large-scale instances of the examined problems, we propose a local-search algorithm. Towards an efficient implementation, the local-search algorithm employs a computational scheme which calculates the complex weighted-distance objective changes in constant time. Solution results are presented for both problems on a variety of well-known test cases demonstrating the effectiveness of the proposed solution approach. The structure of the obtained LDVRP and VRP solutions is compared in pursuit of interesting conclusions on the relative suitability of the two routing models, when the decision maker must deal with the weighted distance objective. In addition, results of a branch-and-cut procedure for small-scale instances of the LDVRP with simultaneous pick-ups and deliveries are reported. Finally, extensive computational experiments have been performed to explore the managerial implications of three key problem characteristics, namely the deviation of customer demands, the cargo to tare weight ratio, as well as the size of the available vehicle fleet.     

Optimizing bus-size and headway in transit networks

Optimization models for calculating the best size for passenger carrying vehicles in urban areas were popular during the 1980s. These studies were abandoned in the ‘90s concluding that it was more efficient to use smaller buses at higher frequencies. This article returns to this controversial question, starting from the point of view that any calculation of bus size can only be made after considering the demand for each of the routes on the system. Therefore, an optimization model for sizing the buses and setting frequencies on each route in the system is proposed in accordance with the premises detailed below. The proposed model is a bi-level optimization model with constraints on bus capacity. The model allows buses of different sizes to be assigned to public transport routes optimizing the headways on each route in accordance with observed levels of demand. At the upper level the model considers the optimization of the system’s social and operating costs, these are understood to be the sum of the user’s and operator’s costs. At the lower level there is an assignment model for public transport with constraints on vehicle capacity which balances the flows for bus sizes and headways at each iteration. By graphically representing the results of the model applied to a real case, a series of useful conclusions are reached for the management and planning of a fleet of public transport vehicles.     

A method for solving the multi‐objective transit frequency optimization problem

Frequency setting takes place at the strategic and tactical planning stages of public transportation systems. The problem consists in determining the time interval between subsequent vehicles for a given set of lines, taking into account interests of users and operators. The result of this stage is considered as input at the operational level. In general, the problem faced by planners is how to distribute a given fleet of buses among a set of given lines. The corresponding decisions determine the frequency of each line, which impacts directly on the waiting time of the users and operator costs. In this work, we consider frequency setting as the problem of minimizing simultaneously users' total travel time and fleet size, which represents the interest of operators. There is a trade‐off between these two measures; therefore, we face a multi‐objective problem. We extend an existing single‐objective formulation to account explicitly for this trade‐off, and propose a Tabu Search solving method to handle efficiently this multi‐objective variant of the problem. The proposed methodology is then applied to a real medium‐sized problem instance, using data of Puerto Montt, Chile. We consider two data sets corresponding to morning‐peak and off‐peak periods. The results obtained show that the proposed methodology is able to improve the current solution in terms of total travel time and fleet size. In addition, the proposed method is able to efficiently suggest (in computational terms) different trade‐off solutions regarding the conflicting objectives of users and operators. Copyright © 2017 John Wiley & Sons, Ltd.     

Transit-oriented autonomous vehicle operation with integrated demand-supply interaction

Autonomous vehicles (AVs) represent potentially disruptive and innovative changes to public transportation (PT) systems. However, the exact interplay between AV and PT is understudied in existing research. This paper proposes a systematic approach to the design, simulation, and evaluation of integrated autonomous vehicle and public transportation (AV + PT) systems. Two features distinguish this research from the state of the art in the literature: the first is the transit-oriented AV operation with the purpose of supporting existing PT modes; the second is the explicit modeling of the interaction between demand and supply.We highlight the transit-orientation by identifying the synergistic opportunities between AV and PT, which makes AVs more acceptable to all the stakeholders and respects the social-purpose considerations such as maintaining service availability and ensuring equity. Specifically, AV is designed to serve first-mile connections to rail stations and provide efficient shared mobility in low-density suburban areas. The interaction between demand and supply is modeled using a set of system dynamics equations and solved as a fixed-point problem through an iterative simulation procedure. We develop an agent-based simulation platform of service and a discrete choice model of demand as two subproblems. Using a feedback loop between supply and demand, we capture the interaction between the decisions of the service operator and those of the travelers and model the choices of both parties. Considering uncertainties in demand prediction and stochasticity in simulation, we also evaluate the robustness of our fixed-point solution and demonstrate the convergence of the proposed method empirically.We test our approach in a major European city, simulating scenarios with various fleet sizes, vehicle capacities, fare schemes, and hailing strategies such as in-advance requests. Scenarios are evaluated from the perspectives of passengers, AV operators, PT operators, and urban mobility system. Results show the trade off between the level of service and the operational cost, providing insight for fleet sizing to reach the optimal balance. Our simulated experiments show that encouraging ride-sharing, allowing in-advance requests, and combining fare with transit help enable service integration and encourage sustainable travel. Both the transit-oriented AV operation and the demand-supply interaction are essential components for defining and assessing the roles of the AV technology in our future transportation systems, especially those with ample and robust transit networks.     

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.