Shortest path problem with re-routing en-route

Simple item page
buir.advisorAlp, Osman
dc.contributor.authorKarakaya, Banu
dc.date.accessioned2016-01-08T18:06:56Z
dc.date.available2016-01-08T18:06:56Z
dc.date.issued2008
dc.departmentDepartment of Industrial Engineeringen_US
dc.descriptionAnkara : The Department of Industrial Engineering and the Institute of Engineering and Science of Bilkent University, 2008.en_US
dc.descriptionThesis (Master's) -- Bilkent University, 2008.en_US
dc.descriptionIncludes bibliographical references leaves 54-56.en_US
dc.description.abstractIn this study, we examine the shortest path problem under the possibility of “re-routing” when an arc that is being traversed is blocked due to reasons such as road and weather conditions, congestion, accidents etc. If an incident occurs along the arc being traversed, the vehicle either waits until all effects of the incident are cleared and then follows the same path thereafter, or returns to the starting node of that arc and follows an escape route to the destination node, the latter course of action is called as “re-routing”. Also, we consider that this arc is not visited again throughout the travel along the network when an incident occurs and the alternative of not following this arc after the event is chosen. We propose a labeling algorithm to solve this specific problem. Then, a real case problem is analyzed by the proposed algorithm and several numerical studies are conducted in order to assess the sensitivity of the probability and travel time parameters.en_US
dc.description.degreeM.S.en_US
dc.description.statementofresponsibilityKarakaya, Banuen_US
dc.format.extentxi, 85 leavesen_US
dc.identifier.urihttp://hdl.handle.net/11693/14748
dc.language.isoEnglishen_US
dc.publisherBilkent Universityen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectShortest Path Problemen_US
dc.subjectLabeling Algorithmen_US
dc.subjectShortest Pathen_US
dc.subjectRe-routingen_US
dc.subjectRoutingen_US
dc.subject.lccQA402.5 .K373 2008en_US
dc.subject.lcshRouters (Computer networks)en_US
dc.subject.lcshAlgorithms.en_US
dc.subject.lcshCombinatorial optimization.en_US
dc.subject.lcshNetwork analysis (Planning)en_US
dc.subject.lcshPaths and cycles (Graph theory)en_US
dc.subject.lcshCritical path analysis (Planning)--Mathematical models.en_US
dc.titleShortest path problem with re-routing en-routeen_US
dc.typeThesisen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
0003610.pdf
Size:
418.66 KB
Format:
Adobe Portable Document Format
Download

Collections

Dept. of Industrial Engineering - Master's degree