Scheduling Extra Train Paths Into Cyclic Timetable Based on the Genetic Algorithm

In order to support the process of scheduling a hybrid cyclic timetable, this paper is devoted to inserting additional non-cyclic train paths into existing cyclic timetable. The adding train paths problem is an integration of timetable scheduling and rescheduling problem. The train dispatcher can no...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE access 2020, Vol.8, p.102199-102211
Hauptverfasser: Tan, Yu-Yan, Li, Ya-Xuan, Wang, Ru-Xin
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 102211
container_issue
container_start_page 102199
container_title IEEE access
container_volume 8
creator Tan, Yu-Yan
Li, Ya-Xuan
Wang, Ru-Xin
description In order to support the process of scheduling a hybrid cyclic timetable, this paper is devoted to inserting additional non-cyclic train paths into existing cyclic timetable. The adding train paths problem is an integration of timetable scheduling and rescheduling problem. The train dispatcher can not only modify the given timetable to manage the interruptions in existing operations, but also establish schedules for additional trains. A multi-objective model minimizing both the travel time of additional trains and the variation of existing trains is proposed in this paper. In addition, we consider both general constraints and some additional practical constraints, such as the overtaking priority constraint, reasonable adjustment of initial schedules and the scheduled connections. This problem is very difficult and must be solved in practice. A heuristic algorithm is introduced to find high-quality solutions for large-scale cases within reasonable computing time. Based on high-speed railway line in China, the case studies illustrate the methodology and compare the performance of trains. Numerical experiments indicate that the proposed solution approach to the adding train paths problem is promising.
doi_str_mv 10.1109/ACCESS.2020.2997777
format Article
fullrecord <record><control><sourceid>proquest_doaj_</sourceid><recordid>TN_cdi_proquest_journals_2454428782</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>9099803</ieee_id><doaj_id>oai_doaj_org_article_27a534a913a64fd88e683830b07c21ff</doaj_id><sourcerecordid>2454428782</sourcerecordid><originalsourceid>FETCH-LOGICAL-c408t-61789e3040c1bd8dc2b2d23f31ac3dccd6fe880163128e63b75e7941d25828383</originalsourceid><addsrcrecordid>eNpNkU1rwzAMhsPYYKXrL-jFsHM6f-TDPnah6wqFbbQ7G8dWmpQ07hwX1n8_dyljukhIeh8J3iiaEjwjBIuneVEsNpsZxRTPqBB5iJtoREkmYpay7PZffR9N-n6PQ_DQSvNR9LHRNZhT23Q7tPj2TqGtU02H3pWve7TqvEXFWbeNRtvmAF6VLaBn1YNBtkO-BrSEDnwYz9uddY2vDw_RXaXaHibXPI4-Xxbb4jVevy1XxXwd6wRzH2ck5wIYTrAmpeFG05IayipGlGZGa5NVwDkmGSOUQ8bKPIVcJMTQlFPOOBtHq4FrrNrLo2sOyp2lVY38bVi3k8qFz1qQNFcpS5QgTGVJZXjgXQi4xLmmpKoC63FgHZ39OkHv5d6eXBfelzRJk4TynNOwxYYt7WzfO6j-rhIsL1bIwQp5sUJerQiq6aBqAOBPIbAQHDP2Aznugow</addsrcrecordid><sourcetype>Open Website</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2454428782</pqid></control><display><type>article</type><title>Scheduling Extra Train Paths Into Cyclic Timetable Based on the Genetic Algorithm</title><source>IEEE Open Access Journals</source><source>DOAJ Directory of Open Access Journals</source><source>EZB-FREE-00999 freely available EZB journals</source><creator>Tan, Yu-Yan ; Li, Ya-Xuan ; Wang, Ru-Xin</creator><creatorcontrib>Tan, Yu-Yan ; Li, Ya-Xuan ; Wang, Ru-Xin</creatorcontrib><description>In order to support the process of scheduling a hybrid cyclic timetable, this paper is devoted to inserting additional non-cyclic train paths into existing cyclic timetable. The adding train paths problem is an integration of timetable scheduling and rescheduling problem. The train dispatcher can not only modify the given timetable to manage the interruptions in existing operations, but also establish schedules for additional trains. A multi-objective model minimizing both the travel time of additional trains and the variation of existing trains is proposed in this paper. In addition, we consider both general constraints and some additional practical constraints, such as the overtaking priority constraint, reasonable adjustment of initial schedules and the scheduled connections. This problem is very difficult and must be solved in practice. A heuristic algorithm is introduced to find high-quality solutions for large-scale cases within reasonable computing time. Based on high-speed railway line in China, the case studies illustrate the methodology and compare the performance of trains. Numerical experiments indicate that the proposed solution approach to the adding train paths problem is promising.</description><identifier>ISSN: 2169-3536</identifier><identifier>EISSN: 2169-3536</identifier><identifier>DOI: 10.1109/ACCESS.2020.2997777</identifier><identifier>CODEN: IAECCG</identifier><language>eng</language><publisher>Piscataway: IEEE</publisher><subject>adding additional train paths ; Computing time ; cyclic timetable ; Delays ; genetic algorithm ; Genetic algorithms ; Heuristic algorithms ; Heuristic methods ; High speed rail ; High-speed railway ; Linear programming ; mixed integer programming ; Optimal scheduling ; Rail transportation ; Rescheduling ; Schedules ; Scheduling ; Timetables ; Trains ; Travel time</subject><ispartof>IEEE access, 2020, Vol.8, p.102199-102211</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-61789e3040c1bd8dc2b2d23f31ac3dccd6fe880163128e63b75e7941d25828383</citedby><cites>FETCH-LOGICAL-c408t-61789e3040c1bd8dc2b2d23f31ac3dccd6fe880163128e63b75e7941d25828383</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/9099803$$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>Li, Ya-Xuan</creatorcontrib><creatorcontrib>Wang, Ru-Xin</creatorcontrib><title>Scheduling Extra Train Paths Into Cyclic Timetable Based on the Genetic Algorithm</title><title>IEEE access</title><addtitle>Access</addtitle><description>In order to support the process of scheduling a hybrid cyclic timetable, this paper is devoted to inserting additional non-cyclic train paths into existing cyclic timetable. The adding train paths problem is an integration of timetable scheduling and rescheduling problem. The train dispatcher can not only modify the given timetable to manage the interruptions in existing operations, but also establish schedules for additional trains. A multi-objective model minimizing both the travel time of additional trains and the variation of existing trains is proposed in this paper. In addition, we consider both general constraints and some additional practical constraints, such as the overtaking priority constraint, reasonable adjustment of initial schedules and the scheduled connections. This problem is very difficult and must be solved in practice. A heuristic algorithm is introduced to find high-quality solutions for large-scale cases within reasonable computing time. Based on high-speed railway line in China, the case studies illustrate the methodology and compare the performance of trains. Numerical experiments indicate that the proposed solution approach to the adding train paths problem is promising.</description><subject>adding additional train paths</subject><subject>Computing time</subject><subject>cyclic timetable</subject><subject>Delays</subject><subject>genetic algorithm</subject><subject>Genetic algorithms</subject><subject>Heuristic algorithms</subject><subject>Heuristic methods</subject><subject>High speed rail</subject><subject>High-speed railway</subject><subject>Linear programming</subject><subject>mixed integer programming</subject><subject>Optimal scheduling</subject><subject>Rail transportation</subject><subject>Rescheduling</subject><subject>Schedules</subject><subject>Scheduling</subject><subject>Timetables</subject><subject>Trains</subject><subject>Travel time</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>eNpNkU1rwzAMhsPYYKXrL-jFsHM6f-TDPnah6wqFbbQ7G8dWmpQ07hwX1n8_dyljukhIeh8J3iiaEjwjBIuneVEsNpsZxRTPqBB5iJtoREkmYpay7PZffR9N-n6PQ_DQSvNR9LHRNZhT23Q7tPj2TqGtU02H3pWve7TqvEXFWbeNRtvmAF6VLaBn1YNBtkO-BrSEDnwYz9uddY2vDw_RXaXaHibXPI4-Xxbb4jVevy1XxXwd6wRzH2ck5wIYTrAmpeFG05IayipGlGZGa5NVwDkmGSOUQ8bKPIVcJMTQlFPOOBtHq4FrrNrLo2sOyp2lVY38bVi3k8qFz1qQNFcpS5QgTGVJZXjgXQi4xLmmpKoC63FgHZ39OkHv5d6eXBfelzRJk4TynNOwxYYt7WzfO6j-rhIsL1bIwQp5sUJerQiq6aBqAOBPIbAQHDP2Aznugow</recordid><startdate>2020</startdate><enddate>2020</enddate><creator>Tan, Yu-Yan</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>Scheduling Extra Train Paths Into Cyclic Timetable Based on the Genetic Algorithm</title><author>Tan, Yu-Yan ; Li, Ya-Xuan ; Wang, Ru-Xin</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c408t-61789e3040c1bd8dc2b2d23f31ac3dccd6fe880163128e63b75e7941d25828383</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><topic>adding additional train paths</topic><topic>Computing time</topic><topic>cyclic timetable</topic><topic>Delays</topic><topic>genetic algorithm</topic><topic>Genetic algorithms</topic><topic>Heuristic algorithms</topic><topic>Heuristic methods</topic><topic>High speed rail</topic><topic>High-speed railway</topic><topic>Linear programming</topic><topic>mixed integer programming</topic><topic>Optimal scheduling</topic><topic>Rail transportation</topic><topic>Rescheduling</topic><topic>Schedules</topic><topic>Scheduling</topic><topic>Timetables</topic><topic>Trains</topic><topic>Travel time</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Tan, Yu-Yan</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 &amp; 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>Li, Ya-Xuan</au><au>Wang, Ru-Xin</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Scheduling Extra Train Paths Into Cyclic Timetable Based on the Genetic Algorithm</atitle><jtitle>IEEE access</jtitle><stitle>Access</stitle><date>2020</date><risdate>2020</risdate><volume>8</volume><spage>102199</spage><epage>102211</epage><pages>102199-102211</pages><issn>2169-3536</issn><eissn>2169-3536</eissn><coden>IAECCG</coden><abstract>In order to support the process of scheduling a hybrid cyclic timetable, this paper is devoted to inserting additional non-cyclic train paths into existing cyclic timetable. The adding train paths problem is an integration of timetable scheduling and rescheduling problem. The train dispatcher can not only modify the given timetable to manage the interruptions in existing operations, but also establish schedules for additional trains. A multi-objective model minimizing both the travel time of additional trains and the variation of existing trains is proposed in this paper. In addition, we consider both general constraints and some additional practical constraints, such as the overtaking priority constraint, reasonable adjustment of initial schedules and the scheduled connections. This problem is very difficult and must be solved in practice. A heuristic algorithm is introduced to find high-quality solutions for large-scale cases within reasonable computing time. Based on high-speed railway line in China, the case studies illustrate the methodology and compare the performance of trains. Numerical experiments indicate that the proposed solution approach to the adding train paths problem is promising.</abstract><cop>Piscataway</cop><pub>IEEE</pub><doi>10.1109/ACCESS.2020.2997777</doi><tpages>13</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.102199-102211
issn 2169-3536
2169-3536
language eng
recordid cdi_proquest_journals_2454428782
source IEEE Open Access Journals; DOAJ Directory of Open Access Journals; EZB-FREE-00999 freely available EZB journals
subjects adding additional train paths
Computing time
cyclic timetable
Delays
genetic algorithm
Genetic algorithms
Heuristic algorithms
Heuristic methods
High speed rail
High-speed railway
Linear programming
mixed integer programming
Optimal scheduling
Rail transportation
Rescheduling
Schedules
Scheduling
Timetables
Trains
Travel time
title Scheduling Extra Train Paths Into Cyclic Timetable Based on the Genetic Algorithm
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%3A02%3A27IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_doaj_&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Scheduling%20Extra%20Train%20Paths%20Into%20Cyclic%20Timetable%20Based%20on%20the%20Genetic%20Algorithm&rft.jtitle=IEEE%20access&rft.au=Tan,%20Yu-Yan&rft.date=2020&rft.volume=8&rft.spage=102199&rft.epage=102211&rft.pages=102199-102211&rft.issn=2169-3536&rft.eissn=2169-3536&rft.coden=IAECCG&rft_id=info:doi/10.1109/ACCESS.2020.2997777&rft_dat=%3Cproquest_doaj_%3E2454428782%3C/proquest_doaj_%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2454428782&rft_id=info:pmid/&rft_ieee_id=9099803&rft_doaj_id=oai_doaj_org_article_27a534a913a64fd88e683830b07c21ff&rfr_iscdi=true