Robust shortest path problems with two uncertain multiplicative cost coefficients

We consider a robust shortest path problem when the cost coefficient is the product of two uncertain factors. We first show that the robust problem can be solved in polynomial time by a dual‐variable enumeration with shortest path problems as subproblems. We also propose a path enumeration approach...

Full description

Saved in:
Bibliographic Details
Published inNaval research logistics Vol. 60; no. 5; pp. 375 - 394
Main Authors Kwon, Changhyun, Lee, Taehan, Berglund, Paul
Format Journal Article
LanguageEnglish
Published Hoboken Wiley Subscription Services, Inc., A Wiley Company 01.08.2013
Wiley Subscription Services, Inc
Subjects
budgeted uncertainty
Enumeration
hazardous materials transportation
Logistics
Mathematical models
Naval
Polynomials
Reproduction
robust shortest path
Shortest-path problems
Transportation
Online AccessGet full text

Cover

More Information
Summary:We consider a robust shortest path problem when the cost coefficient is the product of two uncertain factors. We first show that the robust problem can be solved in polynomial time by a dual‐variable enumeration with shortest path problems as subproblems. We also propose a path enumeration approach using a K ‐shortest paths finding algorithm that may be efficient in many real cases. An application in hazardous materials transportation is discussed, and the solution methods are illustrated by numerical examples. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013
Bibliography:Chonbuk National University in 2011
ark:/67375/WNG-N7B3DKLF-S
istex:0F5FB0BF42A2093C43805D6AD1BB806EB0680FC1
ArticleID:NAV21540
NSF - No. CMMI-1068585
ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0894-069X
1520-6750
DOI:10.1002/nav.21540