The demand-dependent optimization of regular train timetables.

*(English)*Zbl 1152.90435
Liberti, Leo (ed.) et al., Workshop on graphs and combinatorial optimization. Papers from the workshop, Como, Italy, May 31, 2004. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 17, 99-104 (2004).

Summary: Regular timetables, in which the trains arrive and depart at constant intervals, have been adopted in various European countries, because of the simpler and fairer service they allow. The design of such a timetable has recently received a certain attention in the literature. This paper extends the commonly adopted model to take into account the reciprocal influence between the quality of a timetable and the transport demand captured by the railway with respect to alternative means of transport. The resulting mixed-integer nonlinear model remains nonconvex even after relaxing the integrality constraints. We solve it by a branch-and-bound algorithm based on Outer Approximation and a heuristic algorithm exploiting the decomposition and reciprocal update of two submodels. Preliminary computational results concern a regional network in North-western Italy.

For the entire collection see [Zbl 1109.05009].

For the entire collection see [Zbl 1109.05009].

##### MSC:

90B35 | Deterministic scheduling theory in operations research |

90C11 | Mixed integer programming |

90C57 | Polyhedral combinatorics, branch-and-bound, branch-and-cut |

90C59 | Approximation methods and heuristics in mathematical programming |

##### Software:

PESPLib
PDF
BibTeX
XML
Cite

\textit{A. Chierici} et al., Electron. Notes Discrete Math. 17, 99--104 (2004; Zbl 1152.90435)

Full Text:
DOI

##### References:

[1] | Hooghiemstra, J.; Kroon, L.; Odijk, M.; Salomon, M.; Zwaneveld, P., Decision support systems support the search for win-win solutions in railway network design, Interfaces, 29, 2, 15-32, (1999) |

[2] | Serafini, P.; Ukovich, W., A mathematical model for periodic scheduling problems, SIAM journal on discrete mathematics, 2, 4, 550-581, (1989) · Zbl 0676.90030 |

[3] | Nachtigall, K., Periodic network optimization with different arc frequencies, Discrete applied mathematics, 69, 1-17, (1996) · Zbl 0856.90118 |

[4] | Odijk, M., A constraint generation algorithm for the construction of periodic railway timetables, Transportation science, 30, 6, 455-464, (1996) |

[5] | Kroon, L.; Peeters, L., A variable trip time model for cyclic railway timetabling, Transportation science, 37, 2, 198-212, (2003) |

[6] | Ben-Akiva, M.E.; Lerman, S.R., Discrete choice analysis: theory and application to travel demand, (1985), MIT Press Cambridge, Ma |

[7] | R. Maja, Accordo di programma per la riqualificazione e il potenziamento della linea ferroviaria Milano-Mortara, Technical report, Politecnico di Milano (1999) |

This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.