JavaScript is disabled for your browser. Some features of this site may not work without it.
| dc.contributor.author | Rezanova, NJ | en |
| dc.contributor.author | Ryan, David | en |
| dc.date.accessioned | 2012-02-22T23:54:04Z | en |
| dc.date.issued | 2010 | en |
| dc.identifier.citation | Computers and Operations Research 37(5):845-856 2010 | en |
| dc.identifier.issn | 0305-0548 | en |
| dc.identifier.uri | http://hdl.handle.net/2292/11637 | en |
| dc.description.abstract | The needtorecoveratraindriverscheduleoccursduringmajordisruptionsinthedailyrailwayoperations. Based ondatafromtheDanishpassengerrailwayoperatorDSBS-togA/S,asolutionmethodtothetrain driver recoveryproblem(TDRP)isdeveloped.TheTDRPisformulatedasasetpartitioningproblem.We define adisruptionneighbourhoodbyidentifyingasmallsetofdriversandtraintasksdirectlyaffectedby the disruption.Basedonthedisruptionneighbourhood,theTDRPmodelisformedandsolved.IftheTDRP solution providesafeasiblerecoveryforthedriverswithinthedisruptionneighbourhood,weconsider that theproblemissolved.However,ifafeasiblesolutionisnotfound,thedisruptionneighbourhoodis expanded byaddingfurtherdriversorincreasingtherecoverytimeperiod.FractionalsolutionstotheLP relaxation oftheTDRPareresolvedwithaconstraintbranchingstrategyusingthedepth-firstsearchof the Branch&Boundtree.TheLPrelaxationoftheTDRPpossessesstrongintegerproperties.Wepresent test scenariosgeneratedfromthehistoricalreal-lifeoperationsdataofDSBS-togA/S.Thenumerical results showthatallbutonetestedinstancesproduceintegersolutionstotheLPrelaxationoftheTDRP and solutionsarefoundwithinafewseconds. | en |
| dc.publisher | Pergamon | en |
| dc.relation.ispartofseries | Computers and Operations Research | en |
| dc.rights | Items in ResearchSpace are protected by copyright, with all rights reserved, unless otherwise indicated. Previously published items are made available in accordance with the copyright policy of the publisher. Details obtained from: http://www.sherpa.ac.uk/romeo/issn/0305-0548/ | en |
| dc.rights.uri | https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm | en |
| dc.title | The train driver recovery problem-A set partitioning based model and solution method | en |
| dc.type | Journal Article | en |
| dc.identifier.doi | 10.1016/j.cor.2009.03.023 | en |
| pubs.issue | 5 | en |
| pubs.begin-page | 845 | en |
| pubs.volume | 37 | en |
| dc.rights.holder | Copyright: Pergamon | en |
| pubs.end-page | 856 | en |
| dc.rights.accessrights | http://purl.org/eprint/accessRights/RestrictedAccess | en |
| pubs.subtype | Article | en |
| pubs.elements-id | 118440 | en |
| pubs.record-created-at-source-date | 2012-02-15 | en |
Files in this item
There are no files associated with this item.
This item appears in the following Collection(s)
-
General [11149]
Share
