Optimization models for the single delay management problem in public transportation

Heilporn, Géraldine; Giovanni, Luigi De; Labbé, Martine

doi:10.1016/j.ejor.2006.10.065

Cited by 51 publications

(15 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Metaheuristic and exact algorithms are the most commonly used algorithms to solve the problem of vehicle delays in order to minimize the PWT at the station, to minimize the total travel time and for defining an optimum schedule that minimizes the total delay of vehicles [44][45][46][47][48][49].…”

Section: Discussionmentioning

confidence: 99%

Optimization Methods in Modern Transportation Systems

2018

View full text Add to dashboard Cite

Abstract:One of the greatest challenges in the public transportation network is the optimization of the passengers waiting time, where it is necessary to find a compromise between the satisfaction of the passengers and the requirements of the transport companies. This paper presents a detailed review of the available literature dealing with the problem of passenger transport in order to optimize the passenger waiting time at the station and to meet the requirements of companies (maximize profits or minimize cost). After a detailed discussion, the paper clarifies the most important objectives in solving a timetabling problem: the requirements and satisfaction of passengers, passenger waiting time and capacity of vehicles. At the end, the appropriate algorithms for solving the set of optimization models are presented.

show abstract

Section: Discussionmentioning

confidence: 99%

Optimization Methods in Modern Transportation Systems

2018

View full text Add to dashboard Cite

show abstract

“…Additionally, an exact solution algorithm is proposed that splits the problem into independent subproblems and solves them individually. Heilporn et al (2008) derive a variable reduction for the DM problem in Schöbel (2001). They model the DM problem in two versions by neglecting departure events and therefore reducing the number of decision variables.…”

Section: Macroscopic Deterministic Models [ ] + [ ]mentioning

confidence: 99%

A review on railway delay management

König

2020

Public Transp

View full text Add to dashboard Cite

Passengers traveling by train may need to change trains on their route. If the focal train of a passenger is late, the passenger might miss his connection and has to decide how to continue his trip. Delay management addresses the question whether the connecting train should wait (or not) for the delayed passengers. If the connecting train waits, delays would get transferred through the network. In literature, several works consider delays and their impact on railways and how to reschedule disturbed plans. We focus on works, aiming to minimize passenger inconvenience as it is done in delay management. In the last two decades, dozens of works considering the delay management problem have emerged, tackling the problem in different ways. In this paper, an overview on the existing literature is given, and a new classification is introduced. We provide a taxonomy scheme for railway problems at an operational level and show how the field of delay management fits to other parts of the planning process. Moreover, limitations of the delay management approaches are discussed and future research opportunities are suggested.

show abstract

“…We summarize the two MILP models and the valid inequalities presented in Heilporn et al (2008) and De Giovanni et al (2014).…”

Section: Basic Formulations and Valid Inequalitiesmentioning

confidence: 99%

“…• u p = d vp if all connections on path p ∈ P are maintained 0 otherwise. Assuming, without loss of generality, that the initial delay occurs at node 1, the MILP1 formulation is as follows (Heilporn et al 2008, De Giovanni et al 2014:…”

Section: Basic Formulations and Valid Inequalitiesmentioning

confidence: 99%

Strengthened Formulations and Valid Inequalities for Single Delay Management in Public Transportation

Sasso

Giovanni

2019

Transportation Science

Self Cite

View full text Add to dashboard Cite

The delay management problem arises in public transportation networks, often characterized by the necessity of connections between different vehicles. The attractiveness of public transportation networks is strongly related to the reliability of connections, which can be missed when delays or other unpredictable events occur. Given a single initial delay at one node of the network, the delay management problem is to determine which vehicles have to wait for the delayed ones, with the aim of minimizing the dissatisfaction of the passengers. In this paper, we present strengthened mixed integer linear programming formulations and new families of valid inequalities. The implementation of branch-and-cut methods and tests on a benchmark of instances taken from real networks show the potential of the proposed formulations and cuts.

show abstract

Optimization models for the single delay management problem in public transportation

Cited by 51 publications

References 4 publications

Optimization Methods in Modern Transportation Systems

Optimization Methods in Modern Transportation Systems

A review on railway delay management

Strengthened Formulations and Valid Inequalities for Single Delay Management in Public Transportation

Contact Info

Product

Resources

About