IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v60y2013i5p375-394.html
   My bibliography  Save this article

Robust shortest path problems with two uncertain multiplicative cost coefficients

Author

Listed:
  • Changhyun Kwon
  • Taehan Lee
  • Paul Berglund

Abstract

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

Suggested Citation

  • Changhyun Kwon & Taehan Lee & Paul Berglund, 2013. "Robust shortest path problems with two uncertain multiplicative cost coefficients," Naval Research Logistics (NRL), John Wiley & Sons, vol. 60(5), pages 375-394, August.
    • Handle: RePEc:wly:navres:v:60:y:2013:i:5:p:375-394
    DOI: 10.1002/nav.21540
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.21540
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.21540?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Jin Y. Yen, 1971. "Finding the K Shortest Loopless Paths in a Network," Management Science, INFORMS, vol. 17(11), pages 712-716, July.
    2. Hein Fleuren & Dick Hertog & Peter Kort (ed.), 2005. "Operations Research Proceedings 2004," Operations Research Proceedings, Springer, number 978-3-540-27679-1, March.
    3. Rajan Batta & Samuel S. Chiu, 1988. "Optimal Obnoxious Paths on a Network: Transportation of Hazardous Materials," Operations Research, INFORMS, vol. 36(1), pages 84-92, February.
    4. D. Chaerani & C. Roos & A. Aman, 2005. "The Robust Shortest Path Problem by Means of Robust Linear Optimization," Operations Research Proceedings, in: Hein Fleuren & Dick Hertog & Peter Kort (ed.), Operations Research Proceedings 2004, pages 335-342, Springer.
    5. Honghua Jin & Rajan Batta, 1997. "Objectives Derived form Viewing Hazmat Shipments as a Sequence of Independent Bernoulli Trials," Transportation Science, INFORMS, vol. 31(3), pages 252-261, August.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Moret, Stefano & Babonneau, Frédéric & Bierlaire, Michel & Maréchal, François, 2020. "Overcapacity in European power systems: Analysis and robust optimization approach," Applied Energy, Elsevier, vol. 259(C).
    2. Longsheng Sun & Mark H. Karwan & Changhyun Kwon, 2018. "Generalized Bounded Rationality and Robust Multicommodity Network Design," Operations Research, INFORMS, vol. 66(1), pages 42-57, 1-2.
    3. Liu Su & Changhyun Kwon, 2020. "Risk-Averse Network Design with Behavioral Conditional Value-at-Risk for Hazardous Materials Transportation," Transportation Science, INFORMS, vol. 54(1), pages 184-203, January.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Mohri, Seyed Sina & Mohammadi, Mehrdad & Gendreau, Michel & Pirayesh, Amir & Ghasemaghaei, Ali & Salehi, Vahid, 2022. "Hazardous material transportation problems: A comprehensive overview of models and solution approaches," European Journal of Operational Research, Elsevier, vol. 302(1), pages 1-38.
    2. Yingying Kang & Rajan Batta & Changhyun Kwon, 2014. "Value-at-Risk model for hazardous material transportation," Annals of Operations Research, Springer, vol. 222(1), pages 361-387, November.
    3. Garrido, Rodrigo A. & Bronfman, Andrés C., 2017. "Equity and social acceptability in multiple hazardous materials routing through urban areas," Transportation Research Part A: Policy and Practice, Elsevier, vol. 102(C), pages 244-260.
    4. Liu Su & Changhyun Kwon, 2020. "Risk-Averse Network Design with Behavioral Conditional Value-at-Risk for Hazardous Materials Transportation," Transportation Science, INFORMS, vol. 54(1), pages 184-203, January.
    5. Bronfman, Andrés & Marianov, Vladimir & Paredes-Belmar, Germán & Lüer-Villagra, Armin, 2015. "The maximin HAZMAT routing problem," European Journal of Operational Research, Elsevier, vol. 241(1), pages 15-27.
    6. Bronfman, Andrés & Marianov, Vladimir & Paredes-Belmar, Germán & Lüer-Villagra, Armin, 2016. "The maxisum and maximin-maxisum HAZMAT routing problems," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 93(C), pages 316-333.
    7. Huili Zhang & Yinfeng Xu & Xingang Wen, 2015. "Optimal shortest path set problem in undirected graphs," Journal of Combinatorial Optimization, Springer, vol. 29(3), pages 511-530, April.
    8. Daria Dzyabura & Srikanth Jagabathula, 2018. "Offline Assortment Optimization in the Presence of an Online Channel," Management Science, INFORMS, vol. 64(6), pages 2767-2786, June.
    9. Pradhananga, Rojee & Taniguchi, Eiichi & Yamada, Tadashi & Qureshi, Ali Gul, 2014. "Bi-objective decision support system for routing and scheduling of hazardous materials," Socio-Economic Planning Sciences, Elsevier, vol. 48(2), pages 135-148.
    10. Erhan Erkut & Vedat Verter, 1995. "A Framework for Hazardous Materials Transport Risk Assessment," Risk Analysis, John Wiley & Sons, vol. 15(5), pages 589-601, October.
    11. P. Daniel Wright & Matthew J. Liberatore & Robert L. Nydick, 2006. "A Survey of Operations Research Models and Applications in Homeland Security," Interfaces, INFORMS, vol. 36(6), pages 514-529, December.
    12. Melchiori, Anna & Sgalambro, Antonino, 2020. "A branch and price algorithm to solve the Quickest Multicommodity k-splittable Flow Problem," European Journal of Operational Research, Elsevier, vol. 282(3), pages 846-857.
    13. Luss, Hanan & Wong, Richard T., 2005. "Graceful reassignment of excessively long communications paths in networks," European Journal of Operational Research, Elsevier, vol. 160(2), pages 395-415, January.
    14. Sheng Dong & Jibiao Zhou & Changxi Ma, 2020. "Design of a Network Optimization Platform for the Multivehicle Transportation of Hazardous Materials," IJERPH, MDPI, vol. 17(3), pages 1-14, February.
    15. Henryk Gurgul & Roland Mestel & Robert Syrek, 2008. "Polish Stock Market and some foreign markets - dependence analysis by copulas," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 18(2), pages 17-35.
    16. Rinaldi, Marco & Viti, Francesco, 2017. "Exact and approximate route set generation for resilient partial observability in sensor location problems," Transportation Research Part B: Methodological, Elsevier, vol. 105(C), pages 86-119.
    17. Fleischmann, Moritz & Bloemhof-Ruwaard, Jacqueline M. & Dekker, Rommert & van der Laan, Erwin & van Nunen, Jo A. E. E. & Van Wassenhove, Luk N., 1997. "Quantitative models for reverse logistics: A review," European Journal of Operational Research, Elsevier, vol. 103(1), pages 1-17, November.
    18. Ke, Ginger Y. & Zhang, Huiwen & Bookbinder, James H., 2020. "A dual toll policy for maintaining risk equity in hazardous materials transportation with fuzzy incident rate," International Journal of Production Economics, Elsevier, vol. 227(C).
    19. Timothy M. Sweda & Irina S. Dolinskaya & Diego Klabjan, 2017. "Adaptive Routing and Recharging Policies for Electric Vehicles," Transportation Science, INFORMS, vol. 51(4), pages 1326-1348, November.
    20. Chen, Bi Yu & Chen, Xiao-Wei & Chen, Hui-Ping & Lam, William H.K., 2020. "Efficient algorithm for finding k shortest paths based on re-optimization technique," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 133(C).

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wly:navres:v:60:y:2013:i:5:p:375-394. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.