A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
Filters
A Solution Method for an Assignment and Routing Problem of Vehicles for a Container Yard
2004
Transactions of the Society of Instrument and Control Engineers
Arc
represents
a route
of two-way
traffic
for
RTGs. ...
Step 8: if satisfying condition for rescheduling ( 8 )) and ( 9 ) then reschedule the assignment and routing, by using Vy. ...
He has been engaged in the design of the computer control system for the airport baggage handling system and the air cargo system. ...
doi:10.9746/sicetr1965.40.1140
fatcat:skwr6nrbnveqliavfiuedvlsfe
Integrated Train Rescheduling and Rerouting during Multidisturbances under a Quasi-Moving Block System
2021
Journal of Advanced Transportation
In order to adjust the train speed and find the best routes for trains, the set of alternative arcs and alternative arrival/departure paths are considered in the constraints, respectively. ...
It is known that it is critical for train rescheduling problem to address some uncertain disturbances to keep the normal condition of railway traffic. ...
In terms of arcs, the solid arc is called fixed arc, which can determine train routes according original plan, and the red dash arcs are the entrance deifications for trains, whose weights refer entrance ...
doi:10.1155/2021/6652531
fatcat:ppwloft4yreyhmkb6bgxef4zqi
Train Operation Rescheduling Algorithm Based on Passenger Satisfaction
2005
Quarterly Report of RTRI
In order to regard the train-rescheduling problem as a combinatorial optimization problem, we first had to clarify objective criteria of the problem. ...
Extension train route
Extend train route
Change train-set
operating schedule
Change train-set operating schedule
Change of track
Change the track of a train at a station
Change departure ...
doi:10.2219/rtriqr.46.167
fatcat:74nezv445fchnjxo4aqvkz6gzq
Rescheduling Railway Traffic Taking into Account Minimization of Passengers' Discomfort
[chapter]
2015
Lecture Notes in Computer Science
Therefore, the passenger routing aspect of the MDM problem can be modelled as a multicommodity flow problem where passengers may flow only through the arcs of F and through the active arcs of . ...
Microscopic delay management model We next introduce a MILP model for the MDM problem combining train rescheduling and passenger routing decisions. ...
doi:10.1007/978-3-319-24264-4_41
fatcat:j3vxv34m4rb4jdzpzmiwpzfmwa
A freight train dispatching approach for handling perturbations: a real case for the longest heavy-haul railway in China
2020
Smart and Resilient Transport
Purpose This paper aims to reschedule the freight train timetable in case of disturbance to restore the train services as soon as possible. ...
Moreover, two objective functions, namely, the total final delays and the consecutive delays, are minimized in the freight trains dispatching problem. ...
Problem assumptions Real-time timetable rescheduling problem in case of large-scale disrupted situations is a complexity. ...
doi:10.1108/srt-09-2020-0009
fatcat:3w4kc3gxoba4rge7npvykqrcoa
A Quasi-Robust Optimization Approach for Crew Rescheduling
2016
Transportation Science
We assume that several possibilities for the duration of the disruption are given. We solve the rescheduling problem as a two-stage optimization problem. ...
In fact, we require a prescribed number of the rescheduled resource duties to be recoverable. ...
In the following, the problem of rescheduling the crew duties in a disrupted situation is called the Operational Crew Rescheduling Problem (OCRSP). ...
doi:10.1287/trsc.2014.0545
fatcat:qgcbi7lm4rgb3d7dd4q7r75nya
A Lagrangian heuristic for the real-time vehicle rescheduling problem
2009
Transportation Research Part E: Logistics and Transportation Review
In this paper, the vehicle rescheduling problem (VRSP) is investiaged to consider operating costs, schedule disruption costs, and trip cancellation costs. ...
When a public transit vehicle breaks down on a scheduled trip, one or more vehicles need to be rescheduled to serve that trip and other service trips originally scheduled for the disabled vehicle. ...
Appendix A: NP-hardness Proof of the Single-Depot VRSP We can show that the vehicle rescheduling problem, including the trip cancellation and schedule disruption costs, is a NP-hard problem as follows. ...
doi:10.1016/j.tre.2008.09.002
fatcat:pzddhaueyrc3bjsiecwuo6pjva
Reordering and Local Rerouting Strategies to Manage Train Traffic in Real Time
2008
Transportation Science
The compound problem of routing and sequencing trains is approached iteratively computing an optimal train sequencing for given train routes, and then improving this solution by locally rerouting some ...
Traffic controllers regulate railway traffic by sequencing train movements and setting routes with the aim of ensuring smooth train behaviour and limiting as much as possible train delays. ...
This work is partially supported by the programs "Towards Reliable Mobility" of the Transport Research Centre Delft, the Dutch foundation "Next Generation Infrastructures" and ProRail. ...
doi:10.1287/trsc.1080.0247
fatcat:zabrntyjynhcdcaxeik5nooqra
Using a general-purpose Mixed-Integer Linear Programming solver for the practical solution of real-time train rescheduling
2017
European Journal of Operational Research
Using a general-purpose Mixed-Integer Linear Programming solver for the practical solution of real-time train rescheduling, Abstract At a planning level, train scheduling consists of optimizing the routing ...
A computational analysis on real cases shows that our approach can be successfully used for practical real-time train rescheduling, as it is able to deliver (almost) optimal solutions within the very tight ...
Acknowledgements We want to thanks Alstom Ferroviaria SpA for proving us all data used in the experiments. Special thanks are due to Massimo Rosti and Davide Nucci for their helpful support. ...
doi:10.1016/j.ejor.2017.04.057
fatcat:qk6dzpbqm5hdjbdyu25m3hdam4
The multi-objective railway timetable rescheduling problem
2017
Transportation Research Part C: Emerging Technologies
This research focuses on the railway timetable rescheduling problem from a macroscopic point of view in case of large disruptions. ...
We formulate the problem as an Integer Linear Program that optimizes the first objective and includes "-constraints for the two other ones. ...
propose an exact mathematical model that integrates both the timetable rescheduling problem and passenger routing. • We allow total flexibility for the new timetable and define a measure that quantifies ...
doi:10.1016/j.trc.2017.02.001
fatcat:e6btcg77ffc4ddl447ac2qdawm
Evaluating the Applicability of Advanced Techniques for Practical Real-time Train Scheduling
2014
Transportation Research Procedia
The final goal is the development of an advanced decision support system for supporting dispatchers' work and for guiding them toward near-optimal real-time re-timing, re-ordering and re-routing decisions ...
The paper focuses on the optimization system AGLIBRARY that manages trains at the microscopic level of block sections and block signals and at a precision of seconds. ...
The formulation can be extended to the problem with routing flexibility by enlarging sets F and A to contain all possible arcs for all possible train routes, and by adding for each alternative route variables ...
doi:10.1016/j.trpro.2014.10.007
fatcat:jfe2mbfk2zb4xijdj4o7cqmcgu
Hinterland freight transportation replanning model under the framework of synchromodality
2019
Transportation Research Part E: Logistics and Transportation Review
The mathematical model describes the synchronization scheme of shipment re-routing, transshipment flows at the intermediate terminals and service rescheduling. ...
A service Network Design (SND) problem lies at the core of the tactical planning process, addressing issues like the selection and scheduling of services, specification of terminal operations and routing ...
routing a unit of shipment on arc a. ...
doi:10.1016/j.tre.2019.09.014
fatcat:wjh2faypazd3pj6tc7k2tw7bia
Split Delivery-Based Routing Recovery Model for Perishable Product Distribution Delay in Time-Dependent Network
2017
ICIC Express Letters
During the execution of vehicle routing plan for perishable product distribution, unexpected disruption events may bring about transportation delay in some routes and thus cause the initial routing scheme ...
Moreover, a tabu search algorithm with novel neighborhood structures is devised to solve this problem. The effectiveness of the proposed model and algorithm is demonstrated by comparison results. ...
The authors also gratefully acknowledge the helpful comments and suggestions of the reviewers, which have improved the presentation. ...
doi:10.24507/icicel.11.10.1539
fatcat:k2xljjdlvfednbatiri4v5w3vu
A decision support system for the single-depot vehicle rescheduling problem
2007
Computers & Operations Research
The main objective of the vehicle rescheduling problem (VRSP) is to minimize operation and delay costs, while serving the passengers/cargo on the disrupted trip and completing all remaining trips that ...
We report on a prototype decision support system (DSS) that recommends solutions for the single-depot rescheduling as well as vehicle scheduling (VSP) problems, since VRSP is closely related to VSP. ...
Acknowledgements This paper was written while the second author visited the ATLAS Center at the University of Arizona, through funding by CAPES, Brazil. ...
doi:10.1016/j.cor.2005.05.022
fatcat:j57b2n3yazc37fqalqvbiapq6u
What about Train Length and Energy Efficiency of Freight Trains in Rescheduling Models?
2015
Transportation Research Procedia
The first aim of this paper is to investigate how current scheduling and rescheduling models consider train length and energy efficiency. ...
The second aim is to extend a scheduling model that considers train length and energy efficiency for drafting a rescheduling model that minimizes not only delays but also energy consumption. ...
Mazzarello and Ottaviani, 2007) long alternative arcs pre-processing (choice of paths) AG (extended to routing, D' Ariano et al., 2014) long alternative arcs force route variable to zero FP (classic ...
doi:10.1016/j.trpro.2015.09.012
fatcat:bjvcy3shbfgjjh52rjddvmrmti
« Previous
Showing results 1 — 15 out of 1,300 results