Planning process for an operational management platform for a public transport

This work addresses the planning process of a public passenger transport operator, including the generation of schedules and services for vehicles and drivers, in the framework of a previously agreed service. This problem will be studied in the context of all stages of the planning process: parameterization, preparation, production of performance indicators and the generation of results for different operational scenarios.info:eu-repo/semantics/publishedVersio

Planning process for an operational management platform for a public transport

This work addresses the planning process of a public passenger transport operator, including the generation of schedules and services for vehicles and drivers, in the framework of a previously agreed service. This problem will be studied in the context of all stages of the planning process: parameterization, preparation, production of performance indicators and the generation of results for different operational scenarios.info:eu-repo/semantics/publishedVersio

GRASP algorithms for the robust railway network design problem

This paper analyzes the solvability of a railway network design problem and its robust version. These problems are modeled as integer linear programming problems with binary variables, and their solutions provide topological railway networks maximizing the trip coverage in the presence of a competing mode, both assuming that the network works fine and that links can fail, respectively. Since these problems are computationally intractable for realistic sizes, GRASP heuristics are proposed for finding good feasible solutions. The results obtained in a computational experience indicate that our GRASP algorithms are suitable for railway network design problems. © 2011 Springer Science+Business Media, LLC.We would like to thank the Spanish Ministerio de Fomento under grant PT-2007-003, Ministerio de Ciencia y Educacion under grant MTM2009-14243, the Junta de Andalucia under grant P09-TEP-5022 for supporting this research, the FEDER funds of the European Union and TUSSAM (Seville, Spain). Special thanks are due to two anonymous referees for their valuable comments.García-Archilla, B.; Lozano, AJ.; Mesa, JA.; Perea Rojas Marcos, F. (2011). GRASP algorithms for the robust railway network design problem. Journal of Heuristics. 19(2):399-422. https://doi.org/10.1007/s10732-011-9185-zS399422192Baaj, M., Mahmassani, H.: An AI-based approach for transit route system planning and design. J. Adv. Transp. 25(2), 187–210 (1991)Cancela, H., Robledo, F., Rubino, G.: A grasp algorithm with tree based local search for designing a survivable wide area network backbone. J. Comput. Sci. Technol. 4(1), 52–58 (2004)Díaz, J.A., Luna, D., Luna, R.: A grasp heuristic for the manufacturing cell formation problem. TOP (2011). doi: 10.1007/s11750-010-0159-3Feo, T., Resende, M.: A probabilistic heuristic for a computationally difficult set covering problem. Oper. Res. Lett. 8, 67–71 (1989)Goossens, J., van Hoesel, C., Kroon, L.: A branch-and-cut approach for solving railway line-planning problems. Transp. Sci. 38, 379–393 (2004)Institute of Electrical and Electronics Engineers: IEEE Standard Computer Dictionary: A Compilation of IEEE Standard Computer Glossaries (1990)Laporte, G., Mesa, J., Perea, F.: A game theoretic framework for the robust railway transit network design problem. Transp. Res., Part B, Methodol. 44, 447–459 (2010)Laporte, G., Marín, A., Mesa, J., Perea, F.: Designing robust rapid transit networks with alternative routes. J. Adv. Transp. 45, 54–65 (2011)Marín, A., García-Ródenas, R.: Location of infrastructure in urban railway networks. Comput. Oper. Res. 36, 1461–1477 (2009)Marín, A., Jaramillo, P.: Urban rapid transit network design: accelerated Benders decomposition. Ann. Oper. Res. 169(1), 35–53 (2009)Marín, A., Mesa, J.A., Perea, F.: Integrating robust railway network design and line planning under failures. Lect. Notes Comput. Sci. 5868, 273–292 (2009)Mauttone, A., Urquhart, M.E.: A route set construction algorithm for the transit network design problem. Comput. Oper. Res. 36, 2440–2449 (2009)Murphey, R., Pardalos, P., Pitsoulis, L.: A GRASP for the multitarget multisensor tracking problem. In: Networks. Discrete Mathematics and Theoretical Computer Science Series, vol. 40, pp. 277–302. American Mathematical Society, Providence (1998)Nesmachnow, S., Cancela, H., Alba, E.: Evolutionary algorithms applied to reliable communication network design. Eng. Optim. 39(7), 831–855 (2007)Schöbel, A., Scholl, S.: Line planning with minimal transfers. In: 5th Workshop on Algorithmic Methods and Models for Optimization of Railways, Number 06901 in Dagstuhl Seminar Proceedings (2006

Operations research in passenger railway transportation

In this paper, we give an overview of state-of-the-art OperationsResearch models and techniques used in passenger railwaytransportation. For each planning phase (strategic, tactical andoperational), we describe the planning problems arising there anddiscuss some models and algorithms to solve them. We do not onlyconsider classical, well-known topics such as timetabling, rollingstock scheduling and crew scheduling, but we also discuss somerecently developed topics as shunting and reliability oftimetables.Finally, we focus on several practical aspects for each of theseproblems at the largest Dutch railway operator, NS Reizigers.passenger railway transportation;operation research;planning problems

Integrated Optimization of Service-Oriented Train Plan and Schedule on Intercity Rail Network with Varying Demand

For a better service level of a train operating plan, we propose an integrated optimization method of train planning and train scheduling, which generally are optimized, respectively. Based on the cost analysis of both passengers travelling and enterprises operation, and the constraint analysis of trains operation, we construct a multiobjective function and build an integrated optimization model with the aim of reducing both passenger travel costs and enterprise operating costs. Then, a solving algorithm is established based on the simulated annealing algorithm. Finally, using as an example the Changzhutan intercity rail network, as an example we analyze the optimized results and the influence of the model parameters on the results

The line planning routing game

In this paper, we propose a novel algorithmic approach to solve line planning problems. To this end, we model the line planning problem as a game where the passengers are players which aim at minimizing individual objective functions composed of travel time, transfer penalties, and a share of the overall cost of the solution. To find equilibria of this routing game, we use a best-response algorithm. We investigate, under which conditions on the line planning model a passenger’s best-response can be calculated efficiently and which properties are needed to guarantee convergence of the best-response algorithm. Furthermore, we determine the price of anarchy which bounds the objective value of an equilibrium with respect to a system- optimal solution of the line planning problem. For problems where best-responses cannot be found efficiently, we propose heuristic methods. We demonstrate our findings on some small computational examples

High-Speed Train Stop-Schedule Optimization Based on Passenger Travel Convenience

The stop-schedules for passenger trains are important to the operation planning of high-speed trains, and they decide the quality of passenger service and the transportation efficiency. This paper analyzes the specific manifestation of passenger travel convenience and proposes the concepts of interstation accessibility and degree of accessibility. In consideration of both the economic benefits of railway corporations and the travel convenience of passengers, a multitarget optimization model is established. The model aims at minimizing stop cost and maximizing passenger travel convenience. Several constraints are applied to the model establishment, including the number of stops made by individual trains, the frequency of train service received by each station, the operation section, and the 0-1 variable. A hybrid genetic algorithm is designed to solve the model. Both the model and the algorithm are validated through case study

Determining and Evaluating Alternative Line Plans in (Near) Out-of-Control Situations

From time to time, large disruptions cause heavily utilized railway networks to get in a state of (near) out-of-control, in which hardly any trains are able to run as the result of a lack of accurate and up-to-date information available to dispatchers. In this paper, we develop and test disruption management strategies for dealing with these situations. First, we propose an algorithm that finds an alternative line plan that can be operated in the affected part of the railway network. As the line plan should be feasible with respect to infrastructural and resource restrictions, we integrate these aspects in the algorithm in a Benders'-like fashion. Second, to operate the railway system within the disrupted region, we propose several local train dispatching strategies requiring varying degrees of exibility and coordination. Computational experiments based on disruptions in the Dutch railway network indicate that the algorithm performs well, finding workable and passenger oriented line plans within a couple of minutes. Moreover, we also demonstrate in a simulation study that the produced line plans can be operated smoothly without depending on central coordination