dc.contributor.advisor Alp, Osman dc.contributor.author Karakaya, Banu dc.date.accessioned 2016-01-08T18:06:56Z dc.date.available 2016-01-08T18:06:56Z dc.date.issued 2008 dc.identifier.uri http://hdl.handle.net/11693/14748 dc.description Ankara : The Department of Industrial Engineering and the Institute of Engineering and Science of Bilkent University, 2008. en_US dc.description Thesis (Master's) -- Bilkent University, 2008. en_US dc.description Includes bibliographical references leaves 54-56. en_US dc.description.abstract In this study, we examine the shortest path problem under the possibility of en_US “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. dc.description.statementofresponsibility Karakaya, Banu en_US dc.format.extent xi, 85 leaves en_US dc.language.iso English en_US dc.rights info:eu-repo/semantics/openAccess en_US dc.subject Shortest Path Problem en_US dc.subject Labeling Algorithm en_US dc.subject Shortest Path en_US dc.subject Re-routing en_US dc.subject Routing en_US dc.subject.lcc QA402.5 .K373 2008 en_US dc.subject.lcsh Routers (Computer networks) en_US dc.subject.lcsh Algorithms. en_US dc.subject.lcsh Combinatorial optimization. en_US dc.subject.lcsh Network analysis (Planning) en_US dc.subject.lcsh Paths and cycles (Graph theory) en_US dc.subject.lcsh Critical path analysis (Planning)--Mathematical models. en_US dc.title Shortest path problem with re-routing en-route en_US dc.type Thesis en_US dc.department Department of Industrial Engineering en_US dc.publisher Bilkent University en_US dc.description.degree M.S. en_US
﻿