Integration of Train-Set Circulation and Adding Train Paths Problem Based on an Existing Cyclic Timetable
With the aim of supporting the process of scheduling a hybrid cyclic timetable and adapting traffic needs, this paper is concerned with inserting additional train paths problem for tactical and short-term planning applications with multiple objectives. Focusing on an existing cyclic timetable on a h...
Gespeichert in:
Veröffentlicht in: | IEEE access 2020, Vol.8, p.87142-87163 |
---|---|
Hauptverfasser: | , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 87163 |
---|---|
container_issue | |
container_start_page | 87142 |
container_title | IEEE access |
container_volume | 8 |
creator | Tan, Yu-Yan Jiang, Zhi-Bin Li, Ya-Xuan Wang, Ru-Xin |
description | With the aim of supporting the process of scheduling a hybrid cyclic timetable and adapting traffic needs, this paper is concerned with inserting additional train paths problem for tactical and short-term planning applications with multiple objectives. Focusing on an existing cyclic timetable on a high-speed passenger rail line, the problem is to minimize both the total adjustments for initial trains and the number of required train-sets. The timetable scheduling, train-set planning and rescheduling are three complex optimization problems respectively and usually solved in a sequential manner. In this paper, these phases are integrated in a mixed integer programming model, and the multi-objective adding train paths (ATP) model is proposed, which decides simultaneously initial trains' modifications, additional trains' schedules and train-set circulation. The tolerance of disruption for initial trains including allowed adjustment and periodic structure is taken into account in light of the practical concerns. The difficulty of this integrated problem is that train-sets circulation is usually determined after all of the train lines and timetable have been fixed. However, in the adding train paths problem, the additional trains do not exist in the initial timetable. In order to solve the problem in a reasonable time, a relaxation approach to the adding paths problem is presented. We start from fixed train-set route, and then apply flexible train-set route that provides possible alternative turning activities to decrease the number of required train-sets. A case study based on Shanghai-Hangzhou high-speed rail line in China illustrates the methodology and compares the performance of various settings of perturbation tolerance, time window and train-set applications. |
doi_str_mv | 10.1109/ACCESS.2020.2988978 |
format | Article |
fullrecord | <record><control><sourceid>proquest_ieee_</sourceid><recordid>TN_cdi_ieee_primary_9072430</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>9072430</ieee_id><doaj_id>oai_doaj_org_article_cee7b9ab6e6c46459d09ed96a2b6517f</doaj_id><sourcerecordid>2454101153</sourcerecordid><originalsourceid>FETCH-LOGICAL-c408t-d8277abee6597ae88ac7de55308847e7059d80e6f6fcf9bd7dc4457b9d4c88d33</originalsourceid><addsrcrecordid>eNpNkU9LAzEQxRdRUNRP4CXgeWuym7_HulQtCAqt55BNZmvKdqNJCvrt3XZFzGXCzO-9GXhFcUPwjBCs7uZNs1itZhWu8KxSUiohT4qLinBV1qzmp__-58V1Sls8Pjm2mLgo_HLIsIkm-zCg0KF1NH4oV5BR46Pd99PADA7NnfPDZgLQq8nvCb3G0PawQ_cmgUNHDi2-fMoHsPm2vbdo7XeQzYhdFWed6RNc_9bL4u1hsW6eyueXx2Uzfy4txTKXTlZCmBaAMyUMSGmscMBYjaWkAgRmykkMvOOd7VTrhLOUMtEqR62Urq4vi-Xk64LZ6o_odyZ-62C8PjZC3GgTs7c9aAswCk3LgVvK6eiMFTjFTdVyRkQ3et1OXh8xfO4hZb0N-ziM5-uKMkowIeywsZ4oG0NKEbq_rQTrQ0R6ikgfItK_EY2qm0nlAeBPobCoaI3rH4H8jSo</addsrcrecordid><sourcetype>Open Website</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2454101153</pqid></control><display><type>article</type><title>Integration of Train-Set Circulation and Adding Train Paths Problem Based on an Existing Cyclic Timetable</title><source>IEEE Open Access Journals</source><source>DOAJ Directory of Open Access Journals</source><source>Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals</source><creator>Tan, Yu-Yan ; Jiang, Zhi-Bin ; Li, Ya-Xuan ; Wang, Ru-Xin</creator><creatorcontrib>Tan, Yu-Yan ; Jiang, Zhi-Bin ; Li, Ya-Xuan ; Wang, Ru-Xin</creatorcontrib><description>With the aim of supporting the process of scheduling a hybrid cyclic timetable and adapting traffic needs, this paper is concerned with inserting additional train paths problem for tactical and short-term planning applications with multiple objectives. Focusing on an existing cyclic timetable on a high-speed passenger rail line, the problem is to minimize both the total adjustments for initial trains and the number of required train-sets. The timetable scheduling, train-set planning and rescheduling are three complex optimization problems respectively and usually solved in a sequential manner. In this paper, these phases are integrated in a mixed integer programming model, and the multi-objective adding train paths (ATP) model is proposed, which decides simultaneously initial trains' modifications, additional trains' schedules and train-set circulation. The tolerance of disruption for initial trains including allowed adjustment and periodic structure is taken into account in light of the practical concerns. The difficulty of this integrated problem is that train-sets circulation is usually determined after all of the train lines and timetable have been fixed. However, in the adding train paths problem, the additional trains do not exist in the initial timetable. In order to solve the problem in a reasonable time, a relaxation approach to the adding paths problem is presented. We start from fixed train-set route, and then apply flexible train-set route that provides possible alternative turning activities to decrease the number of required train-sets. A case study based on Shanghai-Hangzhou high-speed rail line in China illustrates the methodology and compares the performance of various settings of perturbation tolerance, time window and train-set applications.</description><identifier>ISSN: 2169-3536</identifier><identifier>EISSN: 2169-3536</identifier><identifier>DOI: 10.1109/ACCESS.2020.2988978</identifier><identifier>CODEN: IAECCG</identifier><language>eng</language><publisher>Piscataway: IEEE</publisher><subject>additional train ; Delays ; High speed rail ; Integer programming ; Job shop scheduling ; Mixed integer ; Optimization ; Passenger trains ; periodic structure ; Periodic structures ; Perturbation ; Rail transportation ; Rescheduling ; Schedules ; Scheduling ; Timetable ; Timetables ; tolerance of disruption ; train-set circulation ; Trains ; Windows (intervals)</subject><ispartof>IEEE access, 2020, Vol.8, p.87142-87163</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2020</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c408t-d8277abee6597ae88ac7de55308847e7059d80e6f6fcf9bd7dc4457b9d4c88d33</citedby><cites>FETCH-LOGICAL-c408t-d8277abee6597ae88ac7de55308847e7059d80e6f6fcf9bd7dc4457b9d4c88d33</cites><orcidid>0000-0002-4205-6737 ; 0000-0003-2960-7941</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/9072430$$EHTML$$P50$$Gieee$$Hfree_for_read</linktohtml><link.rule.ids>314,776,780,860,2096,4010,27610,27900,27901,27902,54908</link.rule.ids></links><search><creatorcontrib>Tan, Yu-Yan</creatorcontrib><creatorcontrib>Jiang, Zhi-Bin</creatorcontrib><creatorcontrib>Li, Ya-Xuan</creatorcontrib><creatorcontrib>Wang, Ru-Xin</creatorcontrib><title>Integration of Train-Set Circulation and Adding Train Paths Problem Based on an Existing Cyclic Timetable</title><title>IEEE access</title><addtitle>Access</addtitle><description>With the aim of supporting the process of scheduling a hybrid cyclic timetable and adapting traffic needs, this paper is concerned with inserting additional train paths problem for tactical and short-term planning applications with multiple objectives. Focusing on an existing cyclic timetable on a high-speed passenger rail line, the problem is to minimize both the total adjustments for initial trains and the number of required train-sets. The timetable scheduling, train-set planning and rescheduling are three complex optimization problems respectively and usually solved in a sequential manner. In this paper, these phases are integrated in a mixed integer programming model, and the multi-objective adding train paths (ATP) model is proposed, which decides simultaneously initial trains' modifications, additional trains' schedules and train-set circulation. The tolerance of disruption for initial trains including allowed adjustment and periodic structure is taken into account in light of the practical concerns. The difficulty of this integrated problem is that train-sets circulation is usually determined after all of the train lines and timetable have been fixed. However, in the adding train paths problem, the additional trains do not exist in the initial timetable. In order to solve the problem in a reasonable time, a relaxation approach to the adding paths problem is presented. We start from fixed train-set route, and then apply flexible train-set route that provides possible alternative turning activities to decrease the number of required train-sets. A case study based on Shanghai-Hangzhou high-speed rail line in China illustrates the methodology and compares the performance of various settings of perturbation tolerance, time window and train-set applications.</description><subject>additional train</subject><subject>Delays</subject><subject>High speed rail</subject><subject>Integer programming</subject><subject>Job shop scheduling</subject><subject>Mixed integer</subject><subject>Optimization</subject><subject>Passenger trains</subject><subject>periodic structure</subject><subject>Periodic structures</subject><subject>Perturbation</subject><subject>Rail transportation</subject><subject>Rescheduling</subject><subject>Schedules</subject><subject>Scheduling</subject><subject>Timetable</subject><subject>Timetables</subject><subject>tolerance of disruption</subject><subject>train-set circulation</subject><subject>Trains</subject><subject>Windows (intervals)</subject><issn>2169-3536</issn><issn>2169-3536</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2020</creationdate><recordtype>article</recordtype><sourceid>ESBDL</sourceid><sourceid>RIE</sourceid><sourceid>DOA</sourceid><recordid>eNpNkU9LAzEQxRdRUNRP4CXgeWuym7_HulQtCAqt55BNZmvKdqNJCvrt3XZFzGXCzO-9GXhFcUPwjBCs7uZNs1itZhWu8KxSUiohT4qLinBV1qzmp__-58V1Sls8Pjm2mLgo_HLIsIkm-zCg0KF1NH4oV5BR46Pd99PADA7NnfPDZgLQq8nvCb3G0PawQ_cmgUNHDi2-fMoHsPm2vbdo7XeQzYhdFWed6RNc_9bL4u1hsW6eyueXx2Uzfy4txTKXTlZCmBaAMyUMSGmscMBYjaWkAgRmykkMvOOd7VTrhLOUMtEqR62Urq4vi-Xk64LZ6o_odyZ-62C8PjZC3GgTs7c9aAswCk3LgVvK6eiMFTjFTdVyRkQ3et1OXh8xfO4hZb0N-ziM5-uKMkowIeywsZ4oG0NKEbq_rQTrQ0R6ikgfItK_EY2qm0nlAeBPobCoaI3rH4H8jSo</recordid><startdate>2020</startdate><enddate>2020</enddate><creator>Tan, Yu-Yan</creator><creator>Jiang, Zhi-Bin</creator><creator>Li, Ya-Xuan</creator><creator>Wang, Ru-Xin</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>ESBDL</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>7SR</scope><scope>8BQ</scope><scope>8FD</scope><scope>JG9</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>DOA</scope><orcidid>https://orcid.org/0000-0002-4205-6737</orcidid><orcidid>https://orcid.org/0000-0003-2960-7941</orcidid></search><sort><creationdate>2020</creationdate><title>Integration of Train-Set Circulation and Adding Train Paths Problem Based on an Existing Cyclic Timetable</title><author>Tan, Yu-Yan ; Jiang, Zhi-Bin ; Li, Ya-Xuan ; Wang, Ru-Xin</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c408t-d8277abee6597ae88ac7de55308847e7059d80e6f6fcf9bd7dc4457b9d4c88d33</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><topic>additional train</topic><topic>Delays</topic><topic>High speed rail</topic><topic>Integer programming</topic><topic>Job shop scheduling</topic><topic>Mixed integer</topic><topic>Optimization</topic><topic>Passenger trains</topic><topic>periodic structure</topic><topic>Periodic structures</topic><topic>Perturbation</topic><topic>Rail transportation</topic><topic>Rescheduling</topic><topic>Schedules</topic><topic>Scheduling</topic><topic>Timetable</topic><topic>Timetables</topic><topic>tolerance of disruption</topic><topic>train-set circulation</topic><topic>Trains</topic><topic>Windows (intervals)</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Tan, Yu-Yan</creatorcontrib><creatorcontrib>Jiang, Zhi-Bin</creatorcontrib><creatorcontrib>Li, Ya-Xuan</creatorcontrib><creatorcontrib>Wang, Ru-Xin</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE Open Access Journals</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Engineered Materials Abstracts</collection><collection>METADEX</collection><collection>Technology Research Database</collection><collection>Materials Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>DOAJ Directory of Open Access Journals</collection><jtitle>IEEE access</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Tan, Yu-Yan</au><au>Jiang, Zhi-Bin</au><au>Li, Ya-Xuan</au><au>Wang, Ru-Xin</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Integration of Train-Set Circulation and Adding Train Paths Problem Based on an Existing Cyclic Timetable</atitle><jtitle>IEEE access</jtitle><stitle>Access</stitle><date>2020</date><risdate>2020</risdate><volume>8</volume><spage>87142</spage><epage>87163</epage><pages>87142-87163</pages><issn>2169-3536</issn><eissn>2169-3536</eissn><coden>IAECCG</coden><abstract>With the aim of supporting the process of scheduling a hybrid cyclic timetable and adapting traffic needs, this paper is concerned with inserting additional train paths problem for tactical and short-term planning applications with multiple objectives. Focusing on an existing cyclic timetable on a high-speed passenger rail line, the problem is to minimize both the total adjustments for initial trains and the number of required train-sets. The timetable scheduling, train-set planning and rescheduling are three complex optimization problems respectively and usually solved in a sequential manner. In this paper, these phases are integrated in a mixed integer programming model, and the multi-objective adding train paths (ATP) model is proposed, which decides simultaneously initial trains' modifications, additional trains' schedules and train-set circulation. The tolerance of disruption for initial trains including allowed adjustment and periodic structure is taken into account in light of the practical concerns. The difficulty of this integrated problem is that train-sets circulation is usually determined after all of the train lines and timetable have been fixed. However, in the adding train paths problem, the additional trains do not exist in the initial timetable. In order to solve the problem in a reasonable time, a relaxation approach to the adding paths problem is presented. We start from fixed train-set route, and then apply flexible train-set route that provides possible alternative turning activities to decrease the number of required train-sets. A case study based on Shanghai-Hangzhou high-speed rail line in China illustrates the methodology and compares the performance of various settings of perturbation tolerance, time window and train-set applications.</abstract><cop>Piscataway</cop><pub>IEEE</pub><doi>10.1109/ACCESS.2020.2988978</doi><tpages>22</tpages><orcidid>https://orcid.org/0000-0002-4205-6737</orcidid><orcidid>https://orcid.org/0000-0003-2960-7941</orcidid><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | ISSN: 2169-3536 |
ispartof | IEEE access, 2020, Vol.8, p.87142-87163 |
issn | 2169-3536 2169-3536 |
language | eng |
recordid | cdi_ieee_primary_9072430 |
source | IEEE Open Access Journals; DOAJ Directory of Open Access Journals; Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals |
subjects | additional train Delays High speed rail Integer programming Job shop scheduling Mixed integer Optimization Passenger trains periodic structure Periodic structures Perturbation Rail transportation Rescheduling Schedules Scheduling Timetable Timetables tolerance of disruption train-set circulation Trains Windows (intervals) |
title | Integration of Train-Set Circulation and Adding Train Paths Problem Based on an Existing Cyclic Timetable |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-04T13%3A14%3A40IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_ieee_&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Integration%20of%20Train-Set%20Circulation%20and%20Adding%20Train%20Paths%20Problem%20Based%20on%20an%20Existing%20Cyclic%20Timetable&rft.jtitle=IEEE%20access&rft.au=Tan,%20Yu-Yan&rft.date=2020&rft.volume=8&rft.spage=87142&rft.epage=87163&rft.pages=87142-87163&rft.issn=2169-3536&rft.eissn=2169-3536&rft.coden=IAECCG&rft_id=info:doi/10.1109/ACCESS.2020.2988978&rft_dat=%3Cproquest_ieee_%3E2454101153%3C/proquest_ieee_%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2454101153&rft_id=info:pmid/&rft_ieee_id=9072430&rft_doaj_id=oai_doaj_org_article_cee7b9ab6e6c46459d09ed96a2b6517f&rfr_iscdi=true |