This paper presents an overview of recovery models and algorithms for real-time railway disturbance and disruption management. This area is currently an active research area in Operations Research, including real-time timetable rescheduling and real-time rescheduling of the rolling stock and crew duties. These topics are addressed in this paper. Also research dealing with the integration of more than one rescheduling phase is discussed. Currently, the developed methods have been tested mainly in an experimental setting, thereby showing promising results, both in terms of their solution quality and in terms of their computation times. The application of these models and algorithms in real-life railway systems will be instrumental for increasing the quality of the provided railway services, leading to an increased utilization of the involved railway systems.
Considers the application of returnable containers as an example of reverse logistics. A returnable container is a type of secondary packaging that can be used several times in the same form, in contrast with traditional cardboard boxes. For this equipment to be used, a system for the return logistics of the containers should be available: this system should guarantee that the containers are transported from the recipients to the next senders, and that they are cleaned and maintained, if necessary. Outlines several ways in which the return of these containers can be organized. Also includes a case study involving the design of such a return logistic system in The Netherlands. Also describes a quantitative model that can be used to support the related planning process.
The trend towards shorter delivery lead-times reduces operational efficiency and increases transportation costs for internet retailers. Mobile technology, however, creates new opportunities to organize the last-mile. In this paper, we study the concept of crowdsourced delivery that aims to use excess capacity on journeys that already take place to make deliveries. We consider a peer-to-peer platform that automatically creates matches between parcel delivery tasks and ad-hoc drivers. The platform also operates a fleet of backup vehicles to serve the tasks that cannot be served by the ad-hoc drivers. The matching of tasks, drivers and backup vehicles gives rise to a new variant of the dynamic pickup and delivery problem. We propose a rolling horizon framework and develop an exact solution approach to solve the various subproblems. In order to investigate the potential benefit of crowdsourced delivery, we conduct a wide range of computational experiments. The experiments provide insights into the viability of crowdsourced delivery under various assumptions about the environment and the behavior of the ad-hoc drivers. The results suggest that the use of ad-hoc drivers has the potential to make the last-mile more cost-efficient and can reduce the system-wide vehicle-miles.
The energy consumption of trains is highly efficient due to the low friction between steel wheels and rails, although the efficiency is also influenced largely by the driving strategy applied and the scheduled running times in the timetable. Optimal energy-efficient driving strategies can reduce operating costs significantly and contribute to a further increase of the sustainability of railway transportation. The railway sector hence shows an increasing interest in efficient algorithms for energy-efficient train control, which could be used in real-time Driver Advisory Systems (DAS) or Automatic Train Operation (ATO) systems. This paper gives an extensive literature review on energy-efficient train control (EETC) and the related topic of energy-efficient train timetabling (EETT), from the first simple models from the 1960s of a train running on a level track to the advanced models and algorithms of the last decade dealing with varying gradients and speed limits, and including regenerative braking. Pontryagin's Maximum Principle (PMP) has been applied intensively to derive optimal driving regimes that make up the optimal energy-efficient driving strategy of a train under different conditions. Still, the optimal sequence and switching points of the optimal driving regimes are not trivial in general, which led to a wide range of optimization models and algorithms to compute the optimal train trajectories and more recently to use them to optimize timetables with a trade-off between energy efficiency and travel times.
C e n t r u m v o o r W i s k u n d e e n I n f o r m a t i c a PNA Probability, Networks and Algorithms Probability, Networks and AlgorithmsA rolling stock circulation model for combining and splitting of passenger trains ABSTRACT This paper addresses the railway rolling stock circulation problem. Given the departure and arrival times as well as the expected numbers of passengers, we have to assign the rolling stock to the timetable services. We consider several objective criteria that are related to operational costs, service quality and reliability of the railway system. Our model is an extension of an existing rolling stock model for routing train units along a number of connected train lines. The extended model can also handle underway combining and splitting of trains. We illustrate our model by computational experiments based on instances of NS Reizigers, the main Dutch operator of passenger trains. AbstractThis paper addresses the railway rolling stock circulation problem. Given the departure and arrival times as well as the expected numbers of passengers, we have to assign the rolling stock to the timetable services. We consider several objective criteria that are related to operational costs, service quality and reliability of the railway system. Our model is an extension of an existing rolling stock model for routing train units along a number of connected train lines. The extended model can also handle underway combining and splitting of trains. We illustrate our model by computational experiments based on instances of NS Reizigers, the main Dutch operator of passenger trains.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.