Loading…

An Optimization-Based Decision Support Tool for Incremental Train Timetabling

We consider the typical workflow of a route planner in the context of short-term train timetabling, that is, the incremental process of adjusting a timetable for the next day or up to the next year. This process usually alternates between (1) making rough modifications to an existing timetable (e.g....

Full description

Saved in:
Bibliographic Details
Main Authors: Kloster, Oddvar, Luteberget, Bjørnar Steinnes, Mannino, Carlo, Sartor, Giorgio
Format: Article
Language:eng ; nor
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Kloster, Oddvar
Luteberget, Bjørnar Steinnes
Mannino, Carlo
Sartor, Giorgio
description We consider the typical workflow of a route planner in the context of short-term train timetabling, that is, the incremental process of adjusting a timetable for the next day or up to the next year. This process usually alternates between (1) making rough modifications to an existing timetable (e.g., shifting the departure of a train by half an hour) and then (2) making small adjustments to regain feasibility (e.g., reduce or increase the dwell time of some trains in some stations). The most time-consuming element of this process is related to the second step, that is to manually eliminate all conflicts that may arise after a timetable has been modified. In this work, we propose a mixed-integer programming model tailored to solve precisely this problem, that is to find a conflict-free timetable that is as close as possible to a given one. Previous related work mostly focused on creating complex models to produce “optimal” timetables from scratch, which ultimately resulted in little to no practical applications. By using a simpler model, and by trusting route planners in steering the process towards a timetable with the desired qualities, we can get closer to handle real-life instances. The model has been integrated in a user interface that was tested and validated by Norwegian route planners to plan the yearly timetable of a busy railway line in Norway.
format article
fullrecord <record><control><sourceid>cristin</sourceid><recordid>TN_cdi_cristin_nora_10852_109580</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>10852_109580</sourcerecordid><originalsourceid>FETCH-LOGICAL-c57N-c2e619ca6d66f5906c09c146cb8927df0422212ce136ea199a5c072a9cbc15583</originalsourceid><addsrcrecordid>eNotjEtuwyAUAFm0UqM0d-ACSPAw2CzT9BcpTRb1Pnp-xhWSDRbQTU_fSO1mRrOZO7YBa0GAMfaB7UoJg2yatnON1hv2sY_8stawhB-sIUXxhMWP_NlTKLfkn9_rmnLlfUozn1Lmx0jZLz5WnHmfMUTeh8VXHOYQvx7Z_YRz8bt_b1n_-tIf3sXp8nY87E-CTHsWBN4qR2hHayfjpCXpSDWWhs5BO06yAQAF5JW2HpVzaEi2gI4GUsZ0esv435ZyKDXEa0wZr0p2Bm50ppP6F9bOR24</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>An Optimization-Based Decision Support Tool for Incremental Train Timetabling</title><source>NORA - Norwegian Open Research Archives</source><source>Springer Nature</source><source>Alma/SFX Local Collection</source><creator>Kloster, Oddvar ; Luteberget, Bjørnar Steinnes ; Mannino, Carlo ; Sartor, Giorgio</creator><creatorcontrib>Kloster, Oddvar ; Luteberget, Bjørnar Steinnes ; Mannino, Carlo ; Sartor, Giorgio</creatorcontrib><description>We consider the typical workflow of a route planner in the context of short-term train timetabling, that is, the incremental process of adjusting a timetable for the next day or up to the next year. This process usually alternates between (1) making rough modifications to an existing timetable (e.g., shifting the departure of a train by half an hour) and then (2) making small adjustments to regain feasibility (e.g., reduce or increase the dwell time of some trains in some stations). The most time-consuming element of this process is related to the second step, that is to manually eliminate all conflicts that may arise after a timetable has been modified. In this work, we propose a mixed-integer programming model tailored to solve precisely this problem, that is to find a conflict-free timetable that is as close as possible to a given one. Previous related work mostly focused on creating complex models to produce “optimal” timetables from scratch, which ultimately resulted in little to no practical applications. By using a simpler model, and by trusting route planners in steering the process towards a timetable with the desired qualities, we can get closer to handle real-life instances. The model has been integrated in a user interface that was tested and validated by Norwegian route planners to plan the yearly timetable of a busy railway line in Norway.</description><identifier>ISSN: 2662-2556</identifier><language>eng ; nor</language><creationdate>2023</creationdate><rights>info:eu-repo/semantics/openAccess</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>230,314,780,784,885,4024,26567</link.rule.ids></links><search><creatorcontrib>Kloster, Oddvar</creatorcontrib><creatorcontrib>Luteberget, Bjørnar Steinnes</creatorcontrib><creatorcontrib>Mannino, Carlo</creatorcontrib><creatorcontrib>Sartor, Giorgio</creatorcontrib><title>An Optimization-Based Decision Support Tool for Incremental Train Timetabling</title><description>We consider the typical workflow of a route planner in the context of short-term train timetabling, that is, the incremental process of adjusting a timetable for the next day or up to the next year. This process usually alternates between (1) making rough modifications to an existing timetable (e.g., shifting the departure of a train by half an hour) and then (2) making small adjustments to regain feasibility (e.g., reduce or increase the dwell time of some trains in some stations). The most time-consuming element of this process is related to the second step, that is to manually eliminate all conflicts that may arise after a timetable has been modified. In this work, we propose a mixed-integer programming model tailored to solve precisely this problem, that is to find a conflict-free timetable that is as close as possible to a given one. Previous related work mostly focused on creating complex models to produce “optimal” timetables from scratch, which ultimately resulted in little to no practical applications. By using a simpler model, and by trusting route planners in steering the process towards a timetable with the desired qualities, we can get closer to handle real-life instances. The model has been integrated in a user interface that was tested and validated by Norwegian route planners to plan the yearly timetable of a busy railway line in Norway.</description><issn>2662-2556</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>3HK</sourceid><recordid>eNotjEtuwyAUAFm0UqM0d-ACSPAw2CzT9BcpTRb1Pnp-xhWSDRbQTU_fSO1mRrOZO7YBa0GAMfaB7UoJg2yatnON1hv2sY_8stawhB-sIUXxhMWP_NlTKLfkn9_rmnLlfUozn1Lmx0jZLz5WnHmfMUTeh8VXHOYQvx7Z_YRz8bt_b1n_-tIf3sXp8nY87E-CTHsWBN4qR2hHayfjpCXpSDWWhs5BO06yAQAF5JW2HpVzaEi2gI4GUsZ0esv435ZyKDXEa0wZr0p2Bm50ppP6F9bOR24</recordid><startdate>2023</startdate><enddate>2023</enddate><creator>Kloster, Oddvar</creator><creator>Luteberget, Bjørnar Steinnes</creator><creator>Mannino, Carlo</creator><creator>Sartor, Giorgio</creator><scope>3HK</scope></search><sort><creationdate>2023</creationdate><title>An Optimization-Based Decision Support Tool for Incremental Train Timetabling</title><author>Kloster, Oddvar ; Luteberget, Bjørnar Steinnes ; Mannino, Carlo ; Sartor, Giorgio</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c57N-c2e619ca6d66f5906c09c146cb8927df0422212ce136ea199a5c072a9cbc15583</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng ; nor</language><creationdate>2023</creationdate><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Kloster, Oddvar</creatorcontrib><creatorcontrib>Luteberget, Bjørnar Steinnes</creatorcontrib><creatorcontrib>Mannino, Carlo</creatorcontrib><creatorcontrib>Sartor, Giorgio</creatorcontrib><collection>NORA - Norwegian Open Research Archives</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Kloster, Oddvar</au><au>Luteberget, Bjørnar Steinnes</au><au>Mannino, Carlo</au><au>Sartor, Giorgio</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>An Optimization-Based Decision Support Tool for Incremental Train Timetabling</atitle><date>2023</date><risdate>2023</risdate><issn>2662-2556</issn><abstract>We consider the typical workflow of a route planner in the context of short-term train timetabling, that is, the incremental process of adjusting a timetable for the next day or up to the next year. This process usually alternates between (1) making rough modifications to an existing timetable (e.g., shifting the departure of a train by half an hour) and then (2) making small adjustments to regain feasibility (e.g., reduce or increase the dwell time of some trains in some stations). The most time-consuming element of this process is related to the second step, that is to manually eliminate all conflicts that may arise after a timetable has been modified. In this work, we propose a mixed-integer programming model tailored to solve precisely this problem, that is to find a conflict-free timetable that is as close as possible to a given one. Previous related work mostly focused on creating complex models to produce “optimal” timetables from scratch, which ultimately resulted in little to no practical applications. By using a simpler model, and by trusting route planners in steering the process towards a timetable with the desired qualities, we can get closer to handle real-life instances. The model has been integrated in a user interface that was tested and validated by Norwegian route planners to plan the yearly timetable of a busy railway line in Norway.</abstract><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 2662-2556
ispartof
issn 2662-2556
language eng ; nor
recordid cdi_cristin_nora_10852_109580
source NORA - Norwegian Open Research Archives; Springer Nature; Alma/SFX Local Collection
title An Optimization-Based Decision Support Tool for Incremental Train Timetabling
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-27T08%3A06%3A10IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-cristin&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=An%20Optimization-Based%20Decision%20Support%20Tool%20for%20Incremental%20Train%20Timetabling&rft.au=Kloster,%20Oddvar&rft.date=2023&rft.issn=2662-2556&rft_id=info:doi/&rft_dat=%3Ccristin%3E10852_109580%3C/cristin%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c57N-c2e619ca6d66f5906c09c146cb8927df0422212ce136ea199a5c072a9cbc15583%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true