<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
		<id>https://www.scipedia.com/wd/index.php?action=history&amp;feed=atom&amp;title=Preis_et_al_2018a</id>
		<title>Preis et al 2018a - Revision history</title>
		<link rel="self" type="application/atom+xml" href="https://www.scipedia.com/wd/index.php?action=history&amp;feed=atom&amp;title=Preis_et_al_2018a"/>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Preis_et_al_2018a&amp;action=history"/>
		<updated>2026-04-30T18:45:40Z</updated>
		<subtitle>Revision history for this page on the wiki</subtitle>
		<generator>MediaWiki 1.27.0-wmf.10</generator>

	<entry>
		<id>https://www.scipedia.com/wd/index.php?title=Preis_et_al_2018a&amp;diff=192179&amp;oldid=prev</id>
		<title>Scipediacontent: Scipediacontent moved page Draft Content 353170987 to Preis et al 2018a</title>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Preis_et_al_2018a&amp;diff=192179&amp;oldid=prev"/>
				<updated>2021-01-28T17:23:43Z</updated>
		
		<summary type="html">&lt;p&gt;Scipediacontent moved page &lt;a href=&quot;/public/Draft_Content_353170987&quot; class=&quot;mw-redirect&quot; title=&quot;Draft Content 353170987&quot;&gt;Draft Content 353170987&lt;/a&gt; to &lt;a href=&quot;/public/Preis_et_al_2018a&quot; title=&quot;Preis et al 2018a&quot;&gt;Preis et al 2018a&lt;/a&gt;&lt;/p&gt;
&lt;table class=&quot;diff diff-contentalign-left&quot; data-mw=&quot;interface&quot;&gt;
				&lt;tr style='vertical-align: top;' lang='en'&gt;
				&lt;td colspan='1' style=&quot;background-color: white; color:black; text-align: center;&quot;&gt;← Older revision&lt;/td&gt;
				&lt;td colspan='1' style=&quot;background-color: white; color:black; text-align: center;&quot;&gt;Revision as of 17:23, 28 January 2021&lt;/td&gt;
				&lt;/tr&gt;&lt;tr&gt;&lt;td colspan='2' style='text-align: center;' lang='en'&gt;&lt;div class=&quot;mw-diff-empty&quot;&gt;(No difference)&lt;/div&gt;
&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;</summary>
		<author><name>Scipediacontent</name></author>	</entry>

	<entry>
		<id>https://www.scipedia.com/wd/index.php?title=Preis_et_al_2018a&amp;diff=192178&amp;oldid=prev</id>
		<title>Scipediacontent: Created page with &quot; == Abstract ==  Classification yards play an important role in railroad networks for operating single wagonload transportation. Here, inbound trains are disassembled, the rai...&quot;</title>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Preis_et_al_2018a&amp;diff=192178&amp;oldid=prev"/>
				<updated>2021-01-28T17:23:39Z</updated>
		
		<summary type="html">&lt;p&gt;Created page with &amp;quot; == Abstract ==  Classification yards play an important role in railroad networks for operating single wagonload transportation. Here, inbound trains are disassembled, the rai...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;&lt;br /&gt;
== Abstract ==&lt;br /&gt;
&lt;br /&gt;
Classification yards play an important role in railroad networks for operating single wagonload transportation. Here, inbound trains are disassembled, the rail cars are sorted and then assembled to form outbound trains. The efficient and resource-conserving operation of shunting yards has a profound impact on the quality and profitability of single wagonload rail freight services. Preparing production schedules for classification yards that ensure punctuality and efficiency is a challenging task that becomes even harder with the specification of customer-oriented, digital supported transportation plans for each wagon.&amp;lt;br&amp;gt; Against this background we introduce a decision support approach that helps yard managers to find optimal schedules for the resource allocation in the yard. The main component is an optimization approach that involves time constraints and capacity restrictions as well as an objective function that represents goals depending on planning level. At the strategic level of planning, these goals are determined by the utilization of resources (e.g. engines, staff, tracks). However, during the operation, including ad-hoc disturbances, it is useful to minimize the loss of quality instead (e.g. tardiness, missing connections). Besides the mathematical formulation of the problem we discuss solution methods, introduce an optimization framework and outline computational results that show the economical potential.&amp;lt;br&amp;gt; Furthermore, we discuss the opportunities of real-time control and outline the path towards fully automated classification yards. With this work we support the transforming process of the railway freight transport system to meet the prospective challenges in the digital era.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Original document ==&lt;br /&gt;
&lt;br /&gt;
The different versions of the original document can be found in:&lt;br /&gt;
&lt;br /&gt;
* [https://zenodo.org/record/1483764 https://zenodo.org/record/1483764] under the license http://creativecommons.org/licenses/by-nc-nd/4.0/legalcode&lt;br /&gt;
&lt;br /&gt;
* [https://zenodo.org/record/1483764 https://zenodo.org/record/1483764],&lt;br /&gt;
: [http://dx.doi.org/10.5281/zenodo.1483763 http://dx.doi.org/10.5281/zenodo.1483763] under the license http://creativecommons.org/licenses/by-nc-nd/4.0/legalcode&lt;br /&gt;
&lt;br /&gt;
* [https://zenodo.org/record/1483764 https://zenodo.org/record/1483764],&lt;br /&gt;
: [http://dx.doi.org/10.5281/zenodo.1483764 http://dx.doi.org/10.5281/zenodo.1483764] under the license http://creativecommons.org/licenses/by-nc-nd/4.0/legalcode&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
DOIS: 10.5281/zenodo.1483764 10.5281/zenodo.1483763&lt;/div&gt;</summary>
		<author><name>Scipediacontent</name></author>	</entry>

	</feed>