<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE ArticleSet PUBLIC "-//NLM//DTD PubMed 2.7//EN" "https://dtd.nlm.nih.gov/ncbi/pubmed/in/PubMed.dtd">
<ArticleSet>
<Article>
<Journal>
				<PublisherName>Sharif University of Technology</PublisherName>
				<JournalTitle>Scientia Iranica</JournalTitle>
				<Issn>1026-3098</Issn>
				<Volume>29</Volume>
				<Issue>2</Issue>
				<PubDate PubStatus="epublish">
					<Year>2022</Year>
					<Month>04</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>An optimization model for scheduling freight trains on a single-rail track</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>853</FirstPage>
			<LastPage>863</LastPage>
			<ELocationID EIdType="pii">21951</ELocationID>
			
<ELocationID EIdType="doi">10.24200/sci.2020.53538.3304</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Marie</FirstName>
					<LastName>Alaghband</LastName>
<Affiliation>University of Central Florida, Orlando, Florida, USA</Affiliation>

</Author>
<Author>
					<FirstName>B.</FirstName>
					<LastName>Farhang Moghaddam</LastName>
<Affiliation>Institute of Management and Planning Studies, Tehran, Iran</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2019</Year>
					<Month>05</Month>
					<Day>14</Day>
				</PubDate>
			</History>
		<Abstract>In many countries, a rail network consists of a series of single lines with sidings where inter-train interactions (meeting, passing) occur. An effort has been made in this paper to study two of these&lt;br /&gt;network-related issues: 1) scheduling freight trains in a single-line corridor while ensuring the interactions to happen safely and 2) allocating freight to the scheduled trains considering the freight due/release date and train’s weight/capacity. To better illustrate the real-world freight&lt;br /&gt;trains’ scheduling problems, both the scheduling and allocation problems have been addressed. Minimizing the trains’ traveling time, allocating maximum freight to the scheduled ones, and minimizing the total freight tardiness at the related destination are the objective functions of&lt;br /&gt;this study. Both problems and their solutions have been addressed separately using integer linear programming models, but an integrated novel heuristic algorithm has been proposed to solve them. The computational results demonstrated through a generated data set show both the model&lt;br /&gt;validation and the efficiency of the heuristic algorithm. This heuristic algorithm has been so designed to incorporate the practical operational railway rules with modest modification and although its outputs slightly differ from the exact solutions, it can solve both models simultaneously&lt;br /&gt;in large scale problems.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Freight Trains Scheduling</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Single Line Corridor</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Minimizing Total Tardiness</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Minimizing Train’s Travel Time</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://scientiairanica.sharif.edu/article_21951_225230eebacd1480c58f8d5ceac624d4.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
