IDEAS home Printed from https://ideas.repec.org/a/eee/transe/v119y2018icp63-87.html
   My bibliography  Save this article

Budgeting maintenance dredging projects under uncertainty to improve the inland waterway network performance

Author

Listed:
  • Ahadi, Khatereh
  • Sullivan, Kelly M.
  • Mitchell, Kenneth Ned

Abstract

We model the problem of budgeting and selecting inland maintenance dredging projects to maximize the value of commodities that can be transported without disruption through the inland waterway system. We develop a heuristic to solve our stochastic optimization model and demonstrate that, by incorporating uncertainty in the amount of reactive (i.e., emergency) dredging, our model yields improved solutions as compared to related deterministic optimization models in the literature. We apply our model to provide a detailed analysis of U.S. waterway network.

Suggested Citation

  • Ahadi, Khatereh & Sullivan, Kelly M. & Mitchell, Kenneth Ned, 2018. "Budgeting maintenance dredging projects under uncertainty to improve the inland waterway network performance," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 119(C), pages 63-87.
    • Handle: RePEc:eee:transe:v:119:y:2018:i:c:p:63-87
    DOI: 10.1016/j.tre.2018.08.013
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1366554517309821
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.tre.2018.08.013?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. J. K. Lenstra & A. H. G. Rinnooy Kan, 1978. "Complexity of Scheduling under Precedence Constraints," Operations Research, INFORMS, vol. 26(1), pages 22-35, February.
    2. Asadabadi, Ali & Miller-Hooks, Elise, 2017. "Optimal transportation and shoreline infrastructure investment planning under a stochastic climate future," Transportation Research Part B: Methodological, Elsevier, vol. 100(C), pages 156-174.
    3. G. A. Jones & J. G. Wilson, 1979. "Optimal Scheduling of Jobs on a Transmission Network," Management Science, INFORMS, vol. 25(1), pages 98-104, January.
    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. Feng, Xuejun & Hu, Sangen & Gu, Weihua & Jin, Xin & Lu, Yuan, 2020. "A simulation-based approach for assessing seaside infrastructure improvement measures for large marine crude oil terminals," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 142(C).
    2. Bian, Zheyong & Bai, Yun & Douglas, W. Scott & Maher, Ali & Liu, Xiang, 2022. "Multi-year planning for optimal navigation channel dredging and dredged material management," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 159(C).
    3. Mahmoudzadeh, Ahmadreza & Khodakarami, Mohammadadel & Ma, Chaolun & Mitchell, Kenneth Ned & Wang, Xiubin Bruce & Zhang, Yunlong, 2021. "Waterway maintenance budget allocation in a multimodal network," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 146(C).

    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. Nodari Vakhania, 2001. "Tight Performance Bounds of CP-Scheduling on Out-Trees," Journal of Combinatorial Optimization, Springer, vol. 5(4), pages 445-464, December.
    2. Papakonstantinou, Ilia & Lee, Jinwoo & Madanat, Samer Michel, 2019. "Game theoretic approaches for highway infrastructure protection against sea level rise: Co-opetition among multiple players," Transportation Research Part B: Methodological, Elsevier, vol. 123(C), pages 21-37.
    3. C N Potts & V A Strusevich, 2009. "Fifty years of scheduling: a survey of milestones," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 41-68, May.
    4. Lenstra, J. K. & Rinnooy Kan, A. H. G., 1979. "Complexity Results For Scheduling Chains On A Single Machine," Econometric Institute Archives 272176, Erasmus University Rotterdam.
    5. Asadabadi, Ali & Miller-Hooks, Elise, 2017. "Assessing strategies for protecting transportation infrastructure from an uncertain climate future," Transportation Research Part A: Policy and Practice, Elsevier, vol. 105(C), pages 27-41.
    6. Han Hoogeveen & Petra Schuurman & Gerhard J. Woeginger, 2001. "Non-Approximability Results for Scheduling Problems with Minsum Criteria," INFORMS Journal on Computing, INFORMS, vol. 13(2), pages 157-168, May.
    7. Weihua Liu & Xinran Shen & Di Wang, 2020. "The impacts of dual overconfidence behavior and demand updating on the decisions of port service supply chain: a real case study from China," Annals of Operations Research, Springer, vol. 291(1), pages 565-604, August.
    8. Bian, Zheyong & Bai, Yun & Douglas, W. Scott & Maher, Ali & Liu, Xiang, 2022. "Multi-year planning for optimal navigation channel dredging and dredged material management," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 159(C).
    9. Bampis, Evripidis & Giannakos, Aristotelis & Konig, Jean-Claude, 1996. "On the complexity of scheduling with large communication delays," European Journal of Operational Research, Elsevier, vol. 94(2), pages 252-260, October.
    10. Yan Zhao & Liping Chen & Gang Xie & Jianjun Zhao & Jianwan Ding, 2018. "GPU implementation of a cellular genetic algorithm for scheduling dependent tasks of physical system simulation programs," Journal of Combinatorial Optimization, Springer, vol. 35(1), pages 293-317, January.
    11. Jiang, Xiaojuan & Lee, Kangbok & Pinedo, Michael L., 2021. "Ideal schedules in parallel machine settings," European Journal of Operational Research, Elsevier, vol. 290(2), pages 422-434.
    12. Zhang, An & Qi, Xiangtong & Li, Guanhua, 2020. "Machine scheduling with soft precedence constraints," European Journal of Operational Research, Elsevier, vol. 282(2), pages 491-505.
    13. Klaus Heeger & Danny Hermelin & George B. Mertzios & Hendrik Molter & Rolf Niedermeier & Dvir Shabtay, 2023. "Equitable scheduling on a single machine," Journal of Scheduling, Springer, vol. 26(2), pages 209-225, April.
    14. Gómez Sánchez, Mariam & Lalla-Ruiz, Eduardo & Fernández Gil, Alejandro & Castro, Carlos & Voß, Stefan, 2023. "Resource-constrained multi-project scheduling problem: A survey," European Journal of Operational Research, Elsevier, vol. 309(3), pages 958-976.
    15. Itoh, Ryo, 2018. "Is transportation infrastructure cost recoverable under the risk of disasters?," Transportation Research Part A: Policy and Practice, Elsevier, vol. 118(C), pages 457-465.
    16. Lenstra, J. K. & Rinnooy Kan, A. H. G., 1980. "An Introduction To Multiprocessor Scheduling," Econometric Institute Archives 272258, Erasmus University Rotterdam.
    17. José R. Correa & Andreas S. Schulz, 2005. "Single-Machine Scheduling with Precedence Constraints," Mathematics of Operations Research, INFORMS, vol. 30(4), pages 1005-1021, November.
    18. Keqin Li, 1999. "Analysis of the List Scheduling Algorithm for Precedence Constrained Parallel Tasks," Journal of Combinatorial Optimization, Springer, vol. 3(1), pages 73-88, July.
    19. Katarina Cechlarova & Bettina Klaus & David F.Manlove, 2018. "Pareto optimal matchings of students to courses in the presence of prerequisites," Cahiers de Recherches Economiques du Département d'économie 16.04, Université de Lausanne, Faculté des HEC, Département d’économie.
    20. Yuan, J.J. & Lin, Y.X. & Ng, C.T. & Cheng, T.C.E., 2007. "Approximability of single machine scheduling with fixed jobs to minimize total completion time," European Journal of Operational Research, Elsevier, vol. 178(1), pages 46-56, April.

    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:eee:transe:v:119:y:2018:i:c:p:63-87. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/description#description .

    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.