{"id":{"repo_id":"buffalo","oai_identifier":"oai:ubir.buffalo.edu:10477/80016"},"canonical_url":"https://search.dev.ndltd.org/etd/buffalo/oai:ubir.buffalo.edu:10477/80016","repository":{"repo_id":"buffalo","name":"Buffalo","base_url":"https://ubir.buffalo.edu/oai/request"},"display":{"title":"Shortest Path Problem with Random Rerouting","abstract":"M.S.","abstract_html":"M.S.","abstract_has_math":false,"creators":["Wei, Zhiyuan"],"institution":"State University of New York at Buffalo","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":["Nikolaev, Alexander","Industrial and Systems Engineering"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2019,"date_issued":"2019-07-30T15:11:52Z","date_published":"2019-07-30T15:11:52Z","updated_at":"2026-07-27T19:05:23Z","subjects":["industrial engineering"],"languages":["eng"],"rights":["Users of works found in University at Buffalo Institutional Repository (UBIR) are responsible for identifying and contacting the copyright owner for permission to reuse. University at Buffalo Libraries do not manage rights for copyright-protected works and cannot assist with permissions.","Copyright retained by author."],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/10477/80016","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Nikolaev, Alexander","Industrial and Systems Engineering"]},{"key":"dc:creator","label":"Author","values":["Wei, Zhiyuan"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2019-07-30T15:11:52Z","2019","2019-05-17 09:40:36"]},{"key":"dc:publisher","label":"Institution","values":["State University of New York at Buffalo"]},{"key":"dc:type","label":"Dc Type","values":["Text","Thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["industrial engineering"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["Users of works found in University at Buffalo Institutional Repository (UBIR) are responsible for identifying and contacting the copyright owner for permission to reuse. University at Buffalo Libraries do not manage rights for copyright-protected works and cannot assist with permissions.","Copyright retained by author."]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/10477/80016"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["M.S.","This paper addresses a variant of the shortest path problem with a particular type of uncertainty where the route that differs from the scheduled one might be traversed with certain probability. The shortest path problem with random rerouting is modeled as an optimization problem, where in a graph we are asked to obtain the policy that indicates the path selection at each node, such that the expected cost incurred in moving from the starting node to the destination node is minimal. A mixed-integer programming (MIP) model is constructed, and formulated into a MIP solver. With the increasing of the size of problem instances, the two-stage heuristics involved with a modified Dijkstra algorithm are designed to handle the instances where the MIP solver is failed to obtain the solution. Numerical experiments are implemented to illustrate the efficiency of the heuristics."]},{"key":"dc:format","label":"Dc Format","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Shortest Path Problem with Random Rerouting"]}]}],"canonical_facts":{"dc:contributor":["Nikolaev, Alexander","Industrial and Systems Engineering"],"dc:creator":["Wei, Zhiyuan"],"dc:date":["2019-07-30T15:11:52Z","2019","2019-05-17 09:40:36"],"dc:description":["M.S.","This paper addresses a variant of the shortest path problem with a particular type of uncertainty where the route that differs from the scheduled one might be traversed with certain probability. The shortest path problem with random rerouting is modeled as an optimization problem, where in a graph we are asked to obtain the policy that indicates the path selection at each node, such that the expected cost incurred in moving from the starting node to the destination node is minimal. A mixed-integer programming (MIP) model is constructed, and formulated into a MIP solver. With the increasing of the size of problem instances, the two-stage heuristics involved with a modified Dijkstra algorithm are designed to handle the instances where the MIP solver is failed to obtain the solution. Numerical experiments are implemented to illustrate the efficiency of the heuristics."],"dc:format":["application/pdf"],"dc:identifier":["http://hdl.handle.net/10477/80016"],"dc:language":["eng"],"dc:publisher":["State University of New York at Buffalo"],"dc:rights":["Users of works found in University at Buffalo Institutional Repository (UBIR) are responsible for identifying and contacting the copyright owner for permission to reuse. University at Buffalo Libraries do not manage rights for copyright-protected works and cannot assist with permissions.","Copyright retained by author."],"dc:subject":["industrial engineering"],"dc:title":["Shortest Path Problem with Random Rerouting"],"dc:type":["Text","Thesis"]},"updated_at":"2026-07-27T19:05:23Z"}