IDEAS home Printed from https://ideas.repec.org/a/eee/transa/v30y1996i3p231-250.html
   My bibliography  Save this article

Formulation and solution of a multi-commodity, multi-modal network flow model for disaster relief operations

Author

Listed:
  • Haghani, Ali
  • Oh, Sei-Chang

Abstract

This paper presents a formulation and two solution methods for a very complex logistical problem in disaster relief management. The problem to be addressed is a large-scale multicommodity, multi-modal network flow problem with time windows. Due to the nature of this problem, the size of the optimization model which results from its formulation grows extremely rapidly as the number of modes and/or commodities increase. The formulation of the problem is based on the concept of a time-space network. Two heuristic algorithms are proposed. One is a heuristic which exploits an inherent network structure of the problem with a set of side constraints and the other is an interactive fix-and-run heuristic. The findings of the model implementation are also presented using artificially generated data sets. The performance of the solution methods are examined over a range of small and large problems.

Suggested Citation

  • Haghani, Ali & Oh, Sei-Chang, 1996. "Formulation and solution of a multi-commodity, multi-modal network flow model for disaster relief operations," Transportation Research Part A: Policy and Practice, Elsevier, vol. 30(3), pages 231-250, May.
  • Handle: RePEc:eee:transa:v:30:y:1996:i:3:p:231-250
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0965-8564(95)00020-8
    Download Restriction: Full text for ScienceDirect subscribers only

    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. Crainic, Teodor G. & Rousseau, Jean-Marc, 1986. "Multicommodity, multimode freight transportation: A general modeling and algorithmic framework for the service network design problem," Transportation Research Part B: Methodological, Elsevier, vol. 20(3), pages 225-242, June.
    2. Drissi-Kaïtouni, Omar, 1991. "Solution approaches for multimode multiproduct assignment problems," Transportation Research Part B: Methodological, Elsevier, vol. 25(5), pages 317-327, October.
    Full references (including those not matched with items on IDEAS)

    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:eee:transa:v:30:y:1996:i:3:p:231-250. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dana Niculescu). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/547/description#description .

    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 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.

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

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.