Algorithmic Methods for Railway Optimization


Book Description

This state-of-the-art survey features papers that were selected after an open call following the International Dagstuhl Seminar on Algorithmic Methods for Railway Optimization. The second part of the volume constitutes the refereed proceedings of the 4th International Workshop on Algorithmic Methods and Models for Optimization of Railways. The 17 full papers presented here were carefully reviewed and selected from numerous submissions.




Handbook of Optimization in the Railway Industry


Book Description

This book promotes the use of mathematical optimization and operations research methods in rail transportation. The editors assembled thirteen contributions from leading scholars to present a unified voice, standardize terminology, and assess the state-of-the-art. There are three main clusters of articles, corresponding to the classical stages of the planning process: strategic, tactical, and operational. These three clusters are further subdivided into five parts which correspond to the main phases of the railway network planning process: network assessment, capacity planning, timetabling, resource planning, and operational planning. Individual chapters cover: Simulation Capacity Assessment Network Design Train Routing Robust Timetabling Event Scheduling Track Allocation Blocking Shunting Rolling Stock Crew Scheduling Dispatching Delay Propagation




Optimization-Based Methods for Revising Train Timetables with Focus on Robustness


Book Description

With increase in the use of railway transport, ensuring robustness in railway timetables has never been this important. In a dense railway timetable even a small disturbance can propagate easily and affect trains' arrival and departure times. In a robust timetable small delays are absorbed and knock-on effects are prevented effectively. The aim of this thesis is to study how optimization tools can support the generation of robust railway traffic timetables. We address two Train Timetabling Problems (TTP) and for both problems we apply Mixed Integer Linear Programming (MILP) to solve them from network management perspectives. The first problem is how robustness in a given timetable can be assessed and ensured. To tackle this problem, a headway-based method is introduced. The proposed method is implemented in real timetables and evaluated from performance perspectives. Furthermore, the impact of the proposed method on capacity utilization, heterogeneity and the speed of trains, is monitored. Results show that the proposed method can improve robustness without imposing major changes in timetables. The second problem addressed in the thesis is how robustness can be assessed and maintained in a given timetable when allocating additional traffic and maintenance slots. Different insertion strategies are studied and their consequences on capacity utilization and on the properties of the timetables are analyzed. Two different insertion strategies are considered: i) simultaneous and ii) stepwise insertion. The results show that inserting the additional trains simultaneously usually results in generating more optimal solutions. However, solving this type of problem is computationally challenging. We also observed that the existing robustness metrics cannot capture the essential properties of having more robust timetables. Therefore we proposed measuring Channel Width, Channel Width Forward, Channel Width Behind and Track Switching. Furthermore, the experimental analysis of the applied MILP model shows that some cases are computationally hard to solve and there is a need to decrease the computation time. Hence several valid inequalities are developed and their effects on the computation time are analyzed. This thesis contains three papers which are appended. The results of this thesis are of special interests for railway traffic planners and it would support their working process. However, railway traffic operators and passengers also benefit from this study.




Efficient Algorithms


Book Description

This Festschrift volume, published in honor of Kurt Mehlhorn on the occasion of his 60th birthday, contains 28 papers written by his former Ph.D. students and colleagues as well as by his former Ph.D. advisor, Bob Constable. The volume's title is a translation of the title of Kurt Mehlhorn's first book, "Effiziente Algorithmen", published by Teubner-Verlag in 1977. This Festschrift demonstrates how the field of algorithmics has developed and matured in the decades since then. The papers included in this volume are organized in topical sections on models of computation and complexity; sorting and searching; combinatorial optimization with applications; computational geometry and geometric graphs; and algorithm engineering, exactness and robustness.




Research Methods and Solutions to Current Transport Problems


Book Description

The book is dedicated as an auxiliary literature for academic staff of universities, research institutes, as well as for students of transport teaching. The aim of the conference was to present the achievements of national and foreign research and scientific centers dealing with the issues of rail, road, air and sea transport in technical and technological aspects, as well as organization and integration of the environment conducting research and education in the discipline of civil engineering and transport. International Scientific Conference Transport of the 21st Century was held in Ryn, Poland, in the 9th–12th of June 2019. The research areas of the conference were as follows: • transport infrastructure and communication engineering, • construction and operation of means of transport, • logistics engineering and transport technology, • organization and planning of transport, including public transport, • traffic control systems in transport, • transport telematics and intelligent transportation systems, • smart city and electromobility, • safety engineering and ecology in transport, • automation of means of transport. It also used by specialists from central and local government authorities in the area of deepening knowledge of modern technologies and solutions used for planning, managing and operating transport.




Integrated Optimization in Public Transport Planning


Book Description

This book is one of the first to include an extensive discussion of integrated public transport planning. In times of growing urban populations and increasing environmental awareness, the importance of optimizing public transport systems is ever-developing. Three different aspects are presented: line planning, timetabling, and vehicle scheduling. Classically, challenges concerning these three aspects of planning are solved sequentially. Due to their high interdependence, the author presents a clear and detailed analysis of innovative, integrated models with accompanied numerical experiments performed to assess, and often support, the benefits of integration. The book will appeal to a wide readership ranging from graduate students to researchers.




Algorithms and Data Structures


Book Description

The refereed proceedings of the 8th International Workshop on Algorithms and Data Structures, WADS 2003, held in Ottawa, Ontario, Canada, in July/August 2003. The 40 revised full papers presented together with 4 invited papers were carefully reviewed and selected from 126 submissions. A broad variety of current aspects in algorithmics and data structures is addressed.




Metaheuristics for Scheduling in Industrial and Manufacturing Applications


Book Description

During the past decades scheduling has been among the most studied op- mization problemsanditisstillanactiveareaofresearch!Schedulingappears in many areas of science, engineering and industry and takes di?erent forms depending on the restrictions and optimization criteria of the operating en- ronments [8]. For instance, in optimization and computer science, scheduling has been de?ned as “the allocation of tasks to resources over time in order to achieve optimality in one or more objective criteria in an e?cient way” and in production as “production schedule, i. e. , the planning of the production or the sequence of operations according to which jobs pass through machines and is optimal with respect to certain optimization criteria. ” Although there is a standardized form of stating any scheduling problem, namely “e?cient allocation ofn jobs onm machines –which can process no more than one activity at a time– with the objective to optimize some - jective function of the job completion times”, scheduling is in fact a family of problems. Indeed, several parameters intervene in the problem de?nition: (a) job characteristics (preemptive or not, precedence constraints, release dates, etc. ); (b) resource environment (single vs. parallel machines, un- lated machines, identical or uniform machines, etc. ); (c) optimization criteria (minimize total tardiness, the number of late jobs, makespan, ?owtime, etc. ; maximize resource utilization, etc. ); and, (d) scheduling environment (static vs. dynamic,intheformerthenumberofjobstobeconsideredandtheirready times are available while in the later the number of jobs and their charact- istics change over time).




Experimental Algorithms


Book Description

The Workshop on Experimental Algorithms, WEA, is intended to be an int- national forum for research on the experimental evaluation and engineering of algorithms, as well as in various aspects of computational optimization and its applications. The emphasis of the workshop is the use of experimental me- ods to guide the design, analysis, implementation, and evaluation of algorithms, heuristics, and optimization programs. WEA 2008 was held at the Provincetown Inn, Provincetown, MA, USA, on May 30 – June 1, 2008. This was the seventh workshop of the series, after Rome (2007),Menorca(2006),Santorini(2005),RiodeJaniero(2004),Asconia(2003), and Riga (2001). This volume contains all contributed papers accepted for presentation at the workshop. The 26 contributed papers were selected by the Program Committee onthebasisofatleastthreerefereereports,somecontributedbytrustedexternal referees. In addition to the 26 contributed papers, the program contained two invited talks. Camil Demetrescu, of the University of Rome “La Sapienza,” spoke on “Visualization in Algorithm Engineering.” David S. Johnson of AT & T Labs – Research, gave a talk on “Bin Packing: From Theory to Experiment and Back Again.” We would like to thank the authors who responded to the call for papers, our invited speakers, the members of the ProgramCommittee, the external referees, and the Organizing Committee members for making this workshop possible.




Timetable Planning and Information Quality


Book Description

The book comprises a number of research papers presented at several Computers in Railways Conferences. It has been compiled by Ingo A. Hansen, President of the International Association of Railway Operations Research (IAROR) and comprises selected papers originating from different countries, such as Denmark, France, Germany, Japan, Italy, Netherlands, Sweden and Switzerland. The papers give an overview of the current state-of-the-art analytical approaches, methods and simulation tools for the modelling and analysis of network timetables, the distribution of train delays and real-time rescheduling of perturbed operations. The topics include e.g. railway capacity estimation according to the UIC norm 406, train punctuality analysis based on standard track occupation and clearance data, and boarding, alighting and distribution of passengers along suburban trains, as well as fast recognition and resolution of conflicts between train movements in case of disturbances by means of real-time speed adaptation, re-ordering or re-routing. The book can serve as an introduction to the theory of railway traffic, timetable design, operations analysis, simulation, safety and control for Master and PhD students from engineering faculties and professionals working in the railway industry.