PEV storage in multi-bus scheduling problems

Author(s):  
Ilan Momber ◽  
German Morales-Espana ◽  
Andres Ramos ◽  
Tomas Gomez
2014 ◽  
Vol 5 (2) ◽  
pp. 1079-1087 ◽  
Author(s):  
Ilan Momber ◽  
German Morales-Espana ◽  
Andres Ramos ◽  
Tomas Gomez

2014 ◽  
Vol 2014 ◽  
pp. 1-10 ◽  
Author(s):  
Mohammad Hadi Almasi ◽  
Sina Mirzapour Mounes ◽  
Suhana Koting ◽  
Mohamed Rehan Karim

A growing concern for public transit is its inability to shift passenger’s mode from private to public transport. In order to overcome this problem, a more developed feeder bus network and matched schedules will play important roles. The present paper aims to review some of the studies performed on Feeder Bus Network Design and Scheduling Problem (FNDSP) based on three distinctive parts of the FNDSP setup, namely, problem description, problem characteristics, and solution approaches. The problems consist of different subproblems including data preparation, feeder bus network design, route generation, and feeder bus scheduling. Subsequently, descriptive analysis and classification of previous works are presented to highlight the main characteristics and solution methods. Finally, some of the issues and trends for future research are identified. This paper is targeted at dealing with the FNDSP to exhibit strategic and tactical goals and also contributes to the unification of the field which might be a useful complement to the few existing reviews.


Author(s):  
Mohamadreza Banihashemi ◽  
Ali Haghani

A procedure is presented for solving real-world large-scale multiple depot vehicle scheduling (MDVS) problems considering the route time constraints (RTCs). The procedure is applied to some test problems and then to a real-world problem. The real-world problem is the transit bus scheduling problem of the mass transit administration (MTA) in Baltimore, Maryland. The RTCs are added to the MDVS problem to account for real-world operational restrictions such as fuel consumption. Formulation of the MDVS problem, the set of constraints for considering the time restriction, and a heuristic procedure for solving the MDVS problems with RTCs are discussed. Application of the proposed procedures in solving bus scheduling problems in large cities requires a reduction in size of those problems in terms of number of variables and constraints. Two techniques are proposed to decrease the size of the real-world problems. Combining these techniques results in a strategy to reduce the MTA problem size into a manageable and solvable size. The solutions to the reduced size problems are further improved by solving a series of single depot vehicle scheduling problems for each of the MTA depots. The final results from the proposed model are compared with the MTA’s January 1998 schedule. The comparison indicates that the proposed model improves on the MTA schedules in all aspects. The improvements are 7.90 percent in the number of vehicles, 4.66 percent in the operational time, and 5.77 percent in the total cost.


2015 ◽  
Vol 29 (6) ◽  
pp. 2689-2696 ◽  
Author(s):  
Ming Wei ◽  
Xuewu Chen ◽  
Bo Sun ◽  
Yao-Yao Zhu

OR Spectrum ◽  
2005 ◽  
Vol 27 (4) ◽  
pp. 507-523 ◽  
Author(s):  
Vitali Gintner ◽  
Natalia Kliewer ◽  
Leena Suhl

Sign in / Sign up

Export Citation Format

Share Document