ACS-TS: TRAIN SCHEDULING USING ANT COLONY SYSTEM

This paper develops an algorithm for the train scheduling problem using the ant colony system metaheuristic called ACS-TS. At first, a mathematical model for a kind of train scheduling problem is developed and then the algorithm based on ACS is presented to solve the problem. The problem is consider...

Full description

Saved in:
Bibliographic Details
Published in:Journal of applied mathematics & decision sciences 2006-01, Vol.2006 (3), p.9
Main Authors: Ghoseiri, Keivan, Morshedsolouk, Fahimeh
Format: Article
Language:English
Subjects:
Algorithms
Mathematical models
Scheduling
Trains
Traveling salesman problem
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 3
container_start_page 9
container_title Journal of applied mathematics & decision sciences
container_volume 2006
creator Ghoseiri, Keivan
Morshedsolouk, Fahimeh
description This paper develops an algorithm for the train scheduling problem using the ant colony system metaheuristic called ACS-TS. At first, a mathematical model for a kind of train scheduling problem is developed and then the algorithm based on ACS is presented to solve the problem. The problem is considered as a traveling salesman problem (TSP) wherein cities represent the trains. ACS determines the sequence of trains dispatched on the graph of the TSP. Using the sequences obtained and removing the collisions incurred, train scheduling is determined. Numerical examples in small and medium sizes are solved using ACS-TS and compared to exact optimum solutions to check for quality and accuracy. Comparison of the solutions shows that ACS-TS results in good quality and time savings. A case study is presented to illustrate the solution. [PUBLICATION ABSTRACT]
format article
fullrecord <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_211218050</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1548908991</sourcerecordid><originalsourceid>FETCH-proquest_journals_2112180503</originalsourceid><addsrcrecordid>eNpjYuA0MrA00DU2NjNngbNNLTkYuIqLswwMjAwtTSw5GQwcnYN1Q4KtFEKCHD39FIKdPVxdQn08_dwVQoNBpKNfiIKzv4-_X6RCcGRwiKsvDwNrWmJOcSovlOZmUHJzDXH20C0oyi8sTS0uic_KLy3KA0rFGxkaGhlaGJgaGBOlCACray7s</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>211218050</pqid></control><display><type>article</type><title>ACS-TS: TRAIN SCHEDULING USING ANT COLONY SYSTEM</title><source>EBSCOhost Business Source Ultimate</source><creator>Ghoseiri, Keivan ; Morshedsolouk, Fahimeh</creator><creatorcontrib>Ghoseiri, Keivan ; Morshedsolouk, Fahimeh</creatorcontrib><description>This paper develops an algorithm for the train scheduling problem using the ant colony system metaheuristic called ACS-TS. At first, a mathematical model for a kind of train scheduling problem is developed and then the algorithm based on ACS is presented to solve the problem. The problem is considered as a traveling salesman problem (TSP) wherein cities represent the trains. ACS determines the sequence of trains dispatched on the graph of the TSP. Using the sequences obtained and removing the collisions incurred, train scheduling is determined. Numerical examples in small and medium sizes are solved using ACS-TS and compared to exact optimum solutions to check for quality and accuracy. Comparison of the solutions shows that ACS-TS results in good quality and time savings. A case study is presented to illustrate the solution. [PUBLICATION ABSTRACT]</description><identifier>ISSN: 2090-3359</identifier><identifier>EISSN: 2090-3367</identifier><language>eng</language><publisher>New York: Asia University, Taiwan</publisher><subject>Algorithms ; Mathematical models ; Scheduling ; Trains ; Traveling salesman problem</subject><ispartof>Journal of applied mathematics &amp; decision sciences, 2006-01, Vol.2006 (3), p.9</ispartof><rights>Copyright Lawrence Erlbaum Associates, Inc. 2006</rights><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,777,781</link.rule.ids></links><search><creatorcontrib>Ghoseiri, Keivan</creatorcontrib><creatorcontrib>Morshedsolouk, Fahimeh</creatorcontrib><title>ACS-TS: TRAIN SCHEDULING USING ANT COLONY SYSTEM</title><title>Journal of applied mathematics &amp; decision sciences</title><description>This paper develops an algorithm for the train scheduling problem using the ant colony system metaheuristic called ACS-TS. At first, a mathematical model for a kind of train scheduling problem is developed and then the algorithm based on ACS is presented to solve the problem. The problem is considered as a traveling salesman problem (TSP) wherein cities represent the trains. ACS determines the sequence of trains dispatched on the graph of the TSP. Using the sequences obtained and removing the collisions incurred, train scheduling is determined. Numerical examples in small and medium sizes are solved using ACS-TS and compared to exact optimum solutions to check for quality and accuracy. Comparison of the solutions shows that ACS-TS results in good quality and time savings. A case study is presented to illustrate the solution. [PUBLICATION ABSTRACT]</description><subject>Algorithms</subject><subject>Mathematical models</subject><subject>Scheduling</subject><subject>Trains</subject><subject>Traveling salesman problem</subject><issn>2090-3359</issn><issn>2090-3367</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2006</creationdate><recordtype>article</recordtype><recordid>eNpjYuA0MrA00DU2NjNngbNNLTkYuIqLswwMjAwtTSw5GQwcnYN1Q4KtFEKCHD39FIKdPVxdQn08_dwVQoNBpKNfiIKzv4-_X6RCcGRwiKsvDwNrWmJOcSovlOZmUHJzDXH20C0oyi8sTS0uic_KLy3KA0rFGxkaGhlaGJgaGBOlCACray7s</recordid><startdate>20060101</startdate><enddate>20060101</enddate><creator>Ghoseiri, Keivan</creator><creator>Morshedsolouk, Fahimeh</creator><general>Asia University, Taiwan</general><scope>JQ2</scope></search><sort><creationdate>20060101</creationdate><title>ACS-TS: TRAIN SCHEDULING USING ANT COLONY SYSTEM</title><author>Ghoseiri, Keivan ; Morshedsolouk, Fahimeh</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_2112180503</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2006</creationdate><topic>Algorithms</topic><topic>Mathematical models</topic><topic>Scheduling</topic><topic>Trains</topic><topic>Traveling salesman problem</topic><toplevel>online_resources</toplevel><creatorcontrib>Ghoseiri, Keivan</creatorcontrib><creatorcontrib>Morshedsolouk, Fahimeh</creatorcontrib><collection>ProQuest Computer Science Collection</collection><jtitle>Journal of applied mathematics &amp; decision sciences</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Ghoseiri, Keivan</au><au>Morshedsolouk, Fahimeh</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>ACS-TS: TRAIN SCHEDULING USING ANT COLONY SYSTEM</atitle><jtitle>Journal of applied mathematics &amp; decision sciences</jtitle><date>2006-01-01</date><risdate>2006</risdate><volume>2006</volume><issue>3</issue><spage>9</spage><pages>9-</pages><issn>2090-3359</issn><eissn>2090-3367</eissn><abstract>This paper develops an algorithm for the train scheduling problem using the ant colony system metaheuristic called ACS-TS. At first, a mathematical model for a kind of train scheduling problem is developed and then the algorithm based on ACS is presented to solve the problem. The problem is considered as a traveling salesman problem (TSP) wherein cities represent the trains. ACS determines the sequence of trains dispatched on the graph of the TSP. Using the sequences obtained and removing the collisions incurred, train scheduling is determined. Numerical examples in small and medium sizes are solved using ACS-TS and compared to exact optimum solutions to check for quality and accuracy. Comparison of the solutions shows that ACS-TS results in good quality and time savings. A case study is presented to illustrate the solution. [PUBLICATION ABSTRACT]</abstract><cop>New York</cop><pub>Asia University, Taiwan</pub></addata></record>
fulltext fulltext
identifier ISSN: 2090-3359
ispartof Journal of applied mathematics & decision sciences, 2006-01, Vol.2006 (3), p.9
issn 2090-3359
2090-3367
language eng
recordid cdi_proquest_journals_211218050
source EBSCOhost Business Source Ultimate
subjects Algorithms
Mathematical models
Scheduling
Trains
Traveling salesman problem
title ACS-TS: TRAIN SCHEDULING USING ANT COLONY SYSTEM
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-17T12%3A08%3A42IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=ACS-TS:%20TRAIN%20SCHEDULING%20USING%20ANT%20COLONY%20SYSTEM&rft.jtitle=Journal%20of%20applied%20mathematics%20&%20decision%20sciences&rft.au=Ghoseiri,%20Keivan&rft.date=2006-01-01&rft.volume=2006&rft.issue=3&rft.spage=9&rft.pages=9-&rft.issn=2090-3359&rft.eissn=2090-3367&rft_id=info:doi/&rft_dat=%3Cproquest%3E1548908991%3C/proquest%3E%3Cgrp_id%3Ecdi_FETCH-proquest_journals_2112180503%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=211218050&rft_id=info:pmid/&rfr_iscdi=true