DC Element | Wert | Sprache |
dc.contributor.author | Brucker, P | |
dc.contributor.author | Heitmann, S | |
dc.contributor.author | Knust, S | |
dc.date.accessioned | 2021-12-23T15:57:30Z | - |
dc.date.available | 2021-12-23T15:57:30Z | - |
dc.date.issued | 2002 | |
dc.identifier.issn | 01716468 | |
dc.identifier.uri | https://osnascholar.ub.uni-osnabrueck.de/handle/unios/2958 | - |
dc.description.abstract | We consider the problem of rescheduling trains in the case where one track of a railway section consisting of two tracks in opposing directions is closed due to construction activities. After presenting an appropriate model for this situation we derive a polynomial algorithm for the subproblem of finding an optimal schedule with minimal latenesss if the subsequences of trains for both directions outside the construction site are fixed. Based on this algorithm we propose a local search procedure for the general problem of finding good schedules and report test results for some real world instances. | |
dc.language.iso | en | |
dc.publisher | SPRINGER-VERLAG | |
dc.relation.ispartof | OR SPECTRUM | |
dc.subject | local search | |
dc.subject | Operations Research & Management Science | |
dc.subject | OPTIMIZATION | |
dc.subject | railway | |
dc.subject | scheduling | |
dc.subject | TRAINS | |
dc.title | Scheduling railway traffic at a construction site | |
dc.type | journal article | |
dc.identifier.isi | ISI:000178308100002 | |
dc.description.volume | 24 | |
dc.description.issue | 1 | |
dc.description.startpage | 19 | |
dc.description.endpage | 30 | |
dc.publisher.place | 175 FIFTH AVE, NEW YORK, NY 10010 USA | |
dcterms.isPartOf.abbreviation | OR Spectrum | |
crisitem.author.dept | FB 06 - Mathematik/Informatik | - |
crisitem.author.deptid | fb06 | - |
crisitem.author.parentorg | Universität Osnabrück | - |
crisitem.author.netid | KnSi808 | - |