?url_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Adc&rft.relation=http%3A%2F%2Fmiis.maths.ox.ac.uk%2Fmiis%2F264%2F&rft.title=Shunting+passenger+trains%3A+getting+ready+for+departure&rft.creator=van+den+Akker%2C+Marjan&rft.creator=Baarsma%2C+Hilbrandt&rft.creator=Hurink%2C+Johann&rft.creator=Modelski%2C+Maciej&rft.creator=Jan+Paulus%2C+Jacob&rft.creator=Reijnen%2C+Ingrid&rft.creator=Roozemond%2C+Dan&rft.creator=Schreuder%2C+Jan&rft.subject=Transport+and+Automotive&rft.description=In+this+paper+we+consider+the+problem+of+shunting+train+units+on+a+railway+station.+Train+units+arrive+at+and+depart+from+the+station+according+to+a+given+train+schedule+and+in+between+the+units+may+have+to+be+stored+at+the+station.+The+assignment+of+arriving+to+departing+train+units+(called+matching)+and+the+scheduling+of+the+movements+to+realize+this+matching+is+called+shunting.+The+goal+is+to+realize+the+shunting+using+a+minimal+number+of+shunt+movements.%0D%0A%0D%0AFor+a+restricted+version+of+this+problem+an+ILP+approach+has+been+presented+in+the+literature.+In+this+paper%2C+we+consider+the+general+shunting+problem+and+derive+a+greedy+heuristic+approach+and+an+exact+solution+method+based+on+dynamic+programming.+Both+methods+are+flexible+in+the+sense+that+they+allow+the+incorporation+of+practical+planning+rules+and+may+be+extended+to+cover+additional+requirements+from+practice.&rft.date=2008&rft.type=Study+Group+Report&rft.type=NonPeerReviewed&rft.format=application%2Fpdf&rft.language=en&rft.identifier=http%3A%2F%2Fmiis.maths.ox.ac.uk%2Fmiis%2F264%2F1%2Fns.pdf&rft.format=application%2Fpdf&rft.language=en&rft.identifier=http%3A%2F%2Fmiis.maths.ox.ac.uk%2Fmiis%2F264%2F2%2Fns-report.pdf&rft.identifier=++van+den+Akker%2C+Marjan+and+Baarsma%2C+Hilbrandt+and+Hurink%2C+Johann+and+Modelski%2C+Maciej+and+Jan+Paulus%2C+Jacob+and+Reijnen%2C+Ingrid+and+Roozemond%2C+Dan+and+Schreuder%2C+Jan++(2008)+Shunting+passenger+trains%3A+getting+ready+for+departure.++%5BStudy+Group+Report%5D+++++