Multiple objective optimization of the fleet sizing problem for road freight transportation

A fleet sizing problem (FSP) in a road freight transportation company with heterogeneous fleet and its own technical back‐up facilities is considered in the paper. The mathematical model of the decision problem is formulated in terms of multiple objective mathematical programming based on queuing theory. Technical and economical criteria as well as interests of different stakeholders are taken into account in the problem formulation. The solution procedure is composed of two steps. In the first one a sample of Pareto‐optimal solutions is generated by an original program called MEGROS. In the second step this set is reviewed and evaluated, according to the Decision Maker's (DM's) model of preferences. The evaluation of solutions is carried out with an application of an interactive multiple criteria analysis method, called Light Beam Search (LBS). Finally, the DM selects the most desirable, compromise solution.     

Strategic evacuation planning with pedestrian guidance and bus routing: a mixed integer programming model and heuristic solution

This paper presents a mathematical model to plan emergencies in a densely populated urban zone where a certain numbers of pedestrians depend on transit for evacuation. The proposed model features an integrated operational framework, which simultaneously guides evacuees through urban streets and crosswalks (referred to as “the pedestrian network”) to designated pickup points (e.g., bus stops), and routes a fleet of buses at different depots to those pick‐up points and transports evacuees to their destinations or safe places. In this level, the buses are routed through the so‐called “vehicular network.” An integrated mixed integer linear program that can effectively take into account the interactions between the aforementioned two networks is formulated to find the maximal evacuation efficiency in two networks. Because the large instances of the proposed model are mathematically difficult to solve to optimality, a two‐stage heuristic is developed to solve larger instances of the model. Results from hundreds of numerical examples analysis indicate that proposed heuristic works well in providing (near) optimal or feasibly good solutions for medium‐scale to large‐scale instances that may arise in real transit‐based evacuation situations in a much shorter amount of computational time compared with cplex (can find optimal/feasible solutions for only five instances within 3 hours of running). Copyright © 2016 John Wiley & Sons, Ltd.     

Development of a probabilistic model to optimize disseminated real‐time bus arrival information for pre‐trip passengers

In the advent of Advanced Traveler Information Systems (ATIS), the total wait time of passengers for buses may be reduced by disseminating real‐time bus arrival times for the next or series of buses to pre‐trip passengers through various media (e.g., internet, mobile phones, and personal digital assistants). A probabilistic model is desirable and developed in this study, while realistic distributions of bus and passenger arrivals are considered. The disseminated bus arrival time is optimized by minimizing the total wait time incurred by pre‐trip passengers, and its impact to the total wait time under both late and early bus arrival conditions is studied. Relations between the optimal disseminated bus arrival time and major model parameters, such as the mean and standard deviation of arrival times for buses and pre‐trip passengers, are investigated. Analytical results are presented based on Normal and Lognormal distributions of bus arrivals and Gumbel distribution of pre‐trip passenger arrivals at a designated stop. The developed methodology can be practically applied to any arrival distributions of buses and passengers.     

Pruning and ranking the Pareto optimal set,application for the dynamic multi‐objective network design problem

Solving the multi‐objective network design problem (MONDP) resorts to a Pareto optimal set. This set can provide additional information like trade‐offs between objectives for the decision making process, which is not available if the compensation principle would be chosen in advance. However, the Pareto optimal set of solutions can become large, especially if the objectives are mainly opposed. As a consequence, the Pareto optimal set may become difficult to analyze and to comprehend. In this case, pruning and ranking becomes attractive to reduce the Pareto optimal set and to rank the solutions to assist the decision maker. Because the method used, may influence the eventual decisions taken, it is important to choose a method that corresponds best with the underlying decision process and is in accordance with the qualities of the data used. We provided a review of some methods to prune and rank the Pareto optimal set to illustrate the advantages and disadvantages of these methods. The methods are applied using the outcome of solving the dynamic MONDP in which minimizing externalities of traffic are the objectives, and dynamic traffic management measures are the decision variables. For this, we solved the dynamic MONDP for a realistic network of the city Almelo in the Netherlands using the non‐dominated sorting genetic algorithm II. For ranking, we propose to use a fuzzy outranking method that can take uncertainties regarding the data quality and the perception of decision makers into account; and for pruning, a method that explicitly reckons with significant trade‐offs has been identified as the more suitable method to assist the decision making process. Copyright © 2012 John Wiley & Sons, Ltd.     

Optimization of bus allocation to depots by minimizing dead kilometers

In metropolitan cities, public transportation service plays a vital role in mobility of people, and it has to introduce new routes more frequently due to the fast development of the city in terms of population growth and city size. Whenever there is introduction of new route or increase in frequency of buses, the non‐revenue kilometers covered by the buses increases as depot and route starting/ending points are at different places. This non‐revenue kilometers or dead kilometers depends on the distance between depot and route starting point/ending point. The dead kilometers not only results in revenue loss but also results in an increase in the operating cost because of the extra kilometers covered by buses. Reduction of dead kilometers is necessary for the economic growth of the public transportation system. Therefore, in this study, the attention is focused on minimizing dead kilometers by optimizing allocation of buses to depots depending upon the shortest distance between depot and route starting/ending points. We consider also depot capacity and time period of operation during allocation of buses to ensure parking safety and proper maintenance of buses. Mathematical model is developed considering the aforementioned parameters, which is a mixed integer program, and applied to Bangalore Metropolitan Transport Corporation (BMTC) routes operating presently in order to obtain optimal bus allocation to depots. Database for dead kilometers of depots in BMTC for all the schedules are generated using the Form‐4 (trip sheet) of each schedule to analyze depot‐wise and division‐wise dead kilometers. This study also suggests alternative locations where depots can be located to reduce dead kilometers. Copyright © 2015 John Wiley & Sons, Ltd.     

Assessing the quality of intercity road transportation of passengers: An exploratory study in Brazil

In Brazil, buses represent the main mode of public transportation. However, in recent years intercity and interstate bus companies have been facing a growing competition with other forms of transportation such as bus companies competitors, illegal transportation companies, chartered buses, and, more recently, air companies. In this scenario characterized by growing competition, it is essential to evaluate the quality of road transportation of passengers. In order to contribute to the analysis of this issue, this paper presents a methodological approach to assess the quality of intercity road transportation of passengers, according to the customers’ perspective. By conducting a case study in a city of almost 500,000 inhabitants from the interior of Rio de Janeiro, an Importance–Satisfaction Analysis (ISA) and an assignment procedure were used in order to obtain: (i) the main factors (criteria) that influence the quality of service intercity road transportation of passengers, (ii) the importance degree of criteria related to road transportation of passengers, (iii) the satisfaction of the users of road transportation under the considered criteria, (iv) the critical criteria/items, and (v) the categories which best represent the quality of service intercity road transportation according to the passengers’ perspective. Finally, several possible corrective actions to improve the quality of services considering each critical item/criterion were highlighted and special recommendations were done for the critical process (ticket sales).     

Assessment of hybrid‐drive bus fuel savings for Brazilian urban transit

Buses are the main transit mode in Brazil, transporting more than 55 million passengers per day. Most of these vehicles run on diesel oil causing a dependence on oil, extensive greenhouse gas emissions and increasing air pollution in urban areas. In order to improve this situation, options for Brazilian cities include the use of alternative fuels and new propulsion technologies, such as hybrid vehicles. This paper proposes a procedure for evaluating the performance of a recently developed hybrid‐drive technology. A simple procedure is presented to compare hybrid‐drive buses with conventional diesel buses in urban operations, particularly with respect to fuel economy. Next the potential for reducing diesel oil consumption through the use of hybrid‐drive buses is assessed. Field tests carried out by the authors indicate that fuel consumption improvement through the use of hybrid‐drive buses would certainly exceed 20%, resulting in lower fuel costs and carbon dioxide (CO₂) emissions.     

Optimization of bus routing strategies for evacuation

Efficient transportation of evacuees during an emergency has long been recognized as a challenging issue. This paper investigates emergency evacuation strategies that rely on public transit, where buses run continuously, rather than fixed route, based upon the spatial and temporal information of evacuee needs. We formulated an optimal bus operating strategy that minimizes the exposed casualty time rather than operational cost, as a deterministic mixed‐integer program, and investigated the solution algorithm. A Lagrangian‐relaxation‐based solution algorithm was developed for the proposed model. Numerical experiments with different problem sizes were conducted to evaluate the method. Copyright © 2013 John Wiley & Sons, Ltd.     

Enablers and Barriers to the Adoption of Alternatively Powered Buses

Abstract

This paper seeks to identify enablers and barriers that stimulate or prevent the adoption of alternatively powered buses (APBs) in cities. The research method concentrates on an in‐depth analysis of 21 European demonstration case studies of APBs. Considerable differences exist between these cities due to the different reference situation. The type of measurement and the situation in the demonstration cities influence the exact fuel consumption and emission reduction. Variables that could enable the adoption of all types of APBs are: (1) the compatibility with previously introduced ideas; (2) the already available necessary supporting infrastructure in the city; (3) a changed external appearance of the APB; (4) the acceptance of the APBs by passengers and bus drivers; and (5) political support in the city regarding the APBs. The main variables that could be determined as barriers are: the relative economic advantage (the outline of costs is higher than that of conventional buses); and the understanding of the APB for bus drivers and mechanics (because special training is needed for both groups).     

Multi-criteria approach for the selection of alternative options for environmentally sustainable transport system in Delhi

The present study examines the impact of including various qualitative criteria for the selection of alternative transportation options in Delhi. Three alternative transport options viz. 4-stroke 2-wheelers, CNG cars and CNG buses are prioritized based on six different criteria––energy saving potential (energy), emission reduction potential (environment), cost of operation (cost), availability of technology (technology), adaptability of the option (adaptability) and barriers to implementation (barrier). Based on quantitative criteria ‘energy’, ‘environment’ and ‘cost’, CNG car showed more potential in contributing to environmentally sustainable transport system in Delhi followed by 4-stroke 2-wheelers and CNG buses. Qualitative criteria viz. ‘technology’, ‘adaptability’ and ‘barriers’ in prioritization process resulted in higher priority for 4-stroke 2-wheelers followed by CNG bus and CNG car. Integrated quantitative and qualitative criteria gave a contrasting result as compared to that of the conventional quantitative approach and qualitative approach with highest priority for CNG bus followed by 4-stroke 2-wheelers and CNG car. This could explain the reasons for failure of many potential alternative urban transport options.     

A self-adaptive method to equalize headways: Numerical analysis and comparison

In uncontrolled bus systems, buses tend to bunch due to the stochastic nature of traffic flows and passenger demand at bus stops. Although schedules and priori target methods introduce slack time to delay buses at control points to maintain constant headways between successive buses, too much slack required delay passengers on-board. In addition, these methods focus on regular headways and do not consider the rates of convergence of headways after disturbances. We propose a self-adaptive control scheme to equalize the headways of buses with little slack in a single line automatically. The proposed method only requires the information from the current bus at the control point and both its leading and following buses. This elegant method is shown to regulate headways faster than existing methods. In addition, compared to previous self-equalizing methods, the proposed method can improve the travel time of buses by about 12%, while keeping the waiting time of passengers almost the same.     

Optimally combined headway and timetable reliable public transport system

This paper presents a model-based multiobjective control strategy to reduce bus bunching and hence improve public transport reliability. Our goal is twofold. First, we define a proper model, consisting of multiple static and dynamic components. Bus-following model captures the longitudinal dynamics taking into account the interaction with the surrounding traffic. Furthermore, bus stop operations are modeled to estimate dwell time. Second, a shrinking horizon model predictive controller (MPC) is proposed for solving bus bunching problems. The model is able to predict short time-space behavior of public transport buses enabling constrained, finite horizon, optimal control solution to ensure homogeneity of service both in time and space. In this line, the goal with the selected rolling horizon control scheme is to choose a proper velocity profile for the public transport bus such that it keeps both timetable schedule and a desired headway from the bus in front of it (leading bus). The control strategy predicts the arrival time at a bus stop using a passenger arrival and dwell time model. In this vein, the receding horizon model predictive controller calculates an optimal velocity profile based on its current position and desired arrival time. Four different weighting strategies are proposed to test (i) timetable only, (ii) headway only, (iii) balanced timetable - headway tracking and (iv) adaptive control with varying weights. The controller is tested in a high fidelity traffic simulator with realistic scenarios. The behavior of the system is analyzed by considering extreme disturbances. Finally, the existence of a Pareto front between these two objectives is also demonstrated.     

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.     

Berth assignment planning for multi‐line bus stops

In this paper, we study an important problem that arises with the fast development of public transportation systems: when a large number of bus lines share the same bus stop, a long queue of buses often forms when they wait to get into the stop in rush hours. This causes a significant increase of bus delay and a notable drop of traffic capacity near the bus stop. Various measures had been proposed to relieve the congestions near bus stops. However, all of them require considerable financial budgets and construction time costs. In this paper, with the concept of berth assignment redesign, a simulation‐based heuristic algorithm is proposed to make full use of exiting bus berths. In this study, a trustable simulation platform is designed, and the major influencing factors for bus stop operations are considered. The concept of risk control is also introduced to better evaluate the performance of different berth arrangement plans and makes an appropriate trade‐off between the system's efficiency and stability. Finally, a heuristic algorithm is proposed to find a sub‐optimal berth assignment plan. Tests on a typical bus stop show that this algorithm is efficient and fast. The sub‐optimal berth assignment plan obtained by this algorithm could make remarkable improvements to an actual bus stop. Copyright © 2013 John Wiley & Sons, Ltd.     

Using non-real-time Automatic Vehicle Location data to improve bus services

Although real-time Automatic Vehicle Location (AVL) data is being utilised successfully in the UK, little notice has been given to the benefits of historical (non-real-time) AVL data. This paper illustrates how historical AVL data can be used to identify segments of a bus route which would benefit most from bus priority measures and to improve scheduling by highlighting locations at which the greatest deviation from schedule occurs. A new methodology which uses historical AVL data and on-bus passenger counts to calculate the passenger arrival rate at stops along a bus route has been used to estimate annual patronage and the speed of buses as they move between stops. Estimating the patronage at stops using AVL data is more cost-effective than conventional methods (such as surveys at stops which require much more manpower) but retains the benefits of accuracy and stop-specific estimates of annual patronage. The passenger arrival rate can then be used to calculate how long buses spend at stops. If the time buses spend at stops is removed from the total time it takes the bus to traverse a link, the remaining amount of time can be assumed to be the time the bus spends moving and hence the moving speed of the bus can be obtained. It was found that estimation of patronage and the speed of buses as they move between stops using AVL data produced results which were comparable with those obtained by other methods. However the main point to note is that this new method of estimating patronage has the potential to provide a larger and superior data set than is otherwise available, at very low cost.     

Analogy of fixed route shared taxi (taxi khattee) and bus services under various demand density and economical conditions

Taxi khattee is a fixed route unregulated shared taxi. It is a very common mode of transportation in Iran. Fixed route, unscheduled operation, open, unlimited pick‐up and drop‐off locations, and share ride are common features of taxi khattees. Low passenger capacity and working in high demand corridors provides for the possibility of high service frequencies any time of the day. Taxi khattees are similar to jitneys, which are obsolete or illegal in many countries. The aim of this research is to design transit network of an area using taxi khattees in addition to buses. The methodology employed in this paper simultaneously considers the costs to the users and operators on the one hand, and those of the public non‐users on the other hand. Taxi khattees are used in the design of a multimodal network along with buses to characterize the appropriate economic domain for their use. Moreover, their operation indices are compared against those of buses. A sensitivity analysis is carried out on various performance measures. Results show taxi khattees should be used in areas where population density is low, work force is inexpensive, social costs are not considered in fare calculation, and users' value of time is high. The study contradicts the common belief that since taxi khattees provide a high frequency compared to buses, they are economically plausible to use in a transit fleet. Copyright © 2011 John Wiley & Sons, Ltd.     

Real-time control of buses for schedule coordination at a terminal

Recently, bus transit operators have begun to adopt technologies that enable bus locations to be tracked from a central location in real-time. Combined with other technologies, such as automated passenger counting and wireless communication, it is now feasible for these operators to execute a variety of real-time strategies for coordinating the movement of buses along their routes. This paper compares control strategies that depend on technologies for communication, tracking and passenger counting, to those that depend solely on local information (e.g., time that a bus arrived at a stop, and whether other connecting buses have also arrived). We also develop methods to forecast bus arrival times, which are most accurate for lines with long headways, as is usually the case in timed transfer systems. These methods are tested in simulations, which demonstrate that technology is most advantageous when the schedule slack is close to zero, when the headway is large, and when there are many connecting buses.     

Locating fixed roadside units in a bus transport network for maximum communications probability

A key issue in solving the difficult bus-bunching problem is being able to have reliable information about the location of the buses in the network. Most advanced public transport systems have buses with GPS devices, but the problem remains of how to send reliable information from the buses to the control unit, particularly when the density of buses is low, but there are high communications reliability requirements. As a solution, we study locating roadside units (RSUs) along the route. The buses, together with the RSUs, form a linear vehicular ad-hoc network (VANET). The RSUs are deployed so to maximize the probability of a vehicle communicating with an RSU in at most two hops. Previous studies on RSU location never took into account two hops, a conceptually different type of network. Rather, they consider that a vehicle is able to communicate only directly to an RSU (one hop), which is a well-known Maximum Covering Problem, in which one of the parties is always immobile, similar to a mobile phone network. Oppositely, our method solves the problem in which two of the intervening parties are mobile and communicate with each other, not possible to solve as a Maximum Covering Problem. We estimate the probability of a vehicle accessing successfully an RSU either directly or through the relay of another vehicle. This probability is later embedded in an integer programming formulation that optimizes the RSU locations for maximum communications likelihood.Numerical examples show that the connection probability is strongly dependent on the coverage ratio of the transmitters and receivers and relatively independent on the vehicle density on the network, when densities are low. Results also show that it is possible to find some cost-efficient solutions which result in a smaller number of RSUs located while assuring a connection probability of 0.9 or higher.     

Transit user perceptions of driverless buses

This paper reports the results of a stated preference survey of regular transit users’ willingness to ride and concerns about driverless buses in the Philadelphia region. As automated technologies advance, driverless buses may offer significant efficiency, safety, and operational improvements over traditional bus services. However, unfamiliarity with automated vehicle technology may challenge its acceptance among the general public and slow the adoption of new technologies. Using a mixed logit modeling framework, this research examines which types of transit users are most willing to ride in driverless buses and whether having a transit employee on board to monitor the vehicle operations and/or provide customer service matters. Of the 891 surveyed members of University of Pennsylvania’s transit pass benefit program, two-thirds express a willingness to ride in a driverless bus when a transit employee is on board to monitor vehicle operations and provide customer service. By contrast, only 13% would agree to ride a bus without an employee on board. Males and those in younger age groups (18–34) are more willing to ride in driverless buses than females and those in older age groups. Findings suggest that, so long as a transit employee is onboard, many transit passengers will willingly board early generation automated buses. An abrupt shift to buses without employees on board, by contrast, will likely alienate many transit users.

     

A two‐leveled multi‐objective symbiotic evolutionary algorithm for the hub and spoke location problem

We consider a hub and spoke location problem (HSLP) with multiple scenarios. The HSLP consists of four subproblems: hub location, spoke location, spoke allocation, and customer allocation Under multiple scenarios, we aim to provide a set of well‐distributed solutions, close to the true Pareto optimal solutions, for decision makers. We present a novel multi‐objective symbiotic evolutionary algorithm to solve the HSLP under multiple scenarios. The algorithm is modeled as a two‐leveled structure, which we call the two‐leveled multi‐objective symbiotic evolutionary algorithm (TMSEA). In TMSEA, two main processes imitating symbiotic evolution and endosymbiotic evolution are introduced to promote the diversity and convergence of solutions. The evolutionary components suitable for each sub‐problem are defined. TMSEA is tested on a variety of test‐bed problems and compared with existing multi‐objective evolutionary algorithms. The experimental results show that TMSEA is promising in solution convergence and diversity.