IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v25y1991i2p124-137.html
   My bibliography  Save this article

Equitable Sequencing of a Given Set of Hazardous Materials Shipments

Author

Listed:
  • Laurel Lindner-Dutton

    (State University of New York at Buffalo, Buffalo, New York 14260)

  • Rajan Batta

    (State University of New York at Buffalo, Buffalo, New York 14260)

  • Mark H. Karwan

    (State University of New York at Buffalo, Buffalo, New York 14260)

Abstract

In a recent paper, R. Gopalan, K. Kolluri, R. Batta and M. Karwan (1990) consider a model to route a set of hazardous materials shipments from an origin to a destination, so as to minimize the global risk to the community while simultaneously maintaining a desired level of equity between zones within the community. If one follows the routes produced via their solution methodology, the overall risk is small and equity between zones is achieved after all the shipments are over. However, equity may be severely violated at an intermediate stage of the shipment process. Since an accident can occur at any stage, this is not a desirable situation. Motivated by this, in this paper we consider the problem of equitably sequencing a given set of hazardous materials shipments. We presume, of course, that the set of routes are such that they engender low overall risk to the community as a whole, and once they are all traversed the risk is equitably distributed among the zones of the community—Gopalan, Kolluri, Batta, and Karwan's paper provides such routes for the case of a single origin and destination; their procedure is easily adaptable for the case of multiple origins and destinations. The objective function considered in this paper is to minimize the sum of the maximum differences in risk that exist between any two zones, where the sum is taken over the trips made. We formulate the resulting equitable sequencing problem as an integer programming problem and as a dynamic programming problem. Optimal solution strategies are examined for small-sized problems. Several heuristic solution strategies are proposed to obtain the upper bounds needed for dynamic programming fathoming and for obtaining reasonable solutions to large-sized problems. The proposed solution methods are tested on a real data set from the City and County of Albany, New York, as well as on a randomly generated data set.

Suggested Citation

  • Laurel Lindner-Dutton & Rajan Batta & Mark H. Karwan, 1991. "Equitable Sequencing of a Given Set of Hazardous Materials Shipments," Transportation Science, INFORMS, vol. 25(2), pages 124-137, May.
  • Handle: RePEc:inm:ortrsc:v:25:y:1991:i:2:p:124-137
    DOI: 10.1287/trsc.25.2.124
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.25.2.124
    Download Restriction: no

    File URL: https://libkey.io/10.1287/trsc.25.2.124?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
    ---><---

    Citations

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


    Cited by:

    1. Fang, Kan & Ke, Ginger Y. & Verma, Manish, 2017. "A routing and scheduling approach to rail transportation of hazardous materials with demand due dates," European Journal of Operational Research, Elsevier, vol. 261(1), pages 154-168.
    2. Lucio Bianco & Massimiliano Caramia & Stefano Giordani & Veronica Piccialli, 2016. "A Game-Theoretic Approach for Regulating Hazmat Transportation," Transportation Science, INFORMS, vol. 50(2), pages 424-438, May.
    3. 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.
    4. Fontaine, Pirmin & Crainic, Teodor Gabriel & Gendreau, Michel & Minner, Stefan, 2020. "Population-based risk equilibration for the multimode hazmat transport network design problem," European Journal of Operational Research, Elsevier, vol. 284(1), pages 188-200.
    5. 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.
    6. Mesa, Juan A. & Brian Boffey, T., 1996. "A review of extensive facility location in networks," European Journal of Operational Research, Elsevier, vol. 95(3), pages 592-603, December.
    7. 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.
    8. Liping Liu & Jiaming Li & Lei Zhou & Tijun Fan & Shuxia Li, 2021. "Research on Route Optimization of Hazardous Materials Transportation Considering Risk Equity," Sustainability, MDPI, vol. 13(16), pages 1-19, August.
    9. 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.
    10. 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.
    11. Duchenne, Éric & Laporte, Gilbert & Semet, Frédéric, 2012. "The undirected m-Capacitated Peripatetic Salesman Problem," European Journal of Operational Research, Elsevier, vol. 223(3), pages 637-643.
    12. Éric Duchenne & Gilbert Laporte & Frédéric Semet, 2007. "The Undirected m -Peripatetic Salesman Problem: Polyhedral Results and New Algorithms," Operations Research, INFORMS, vol. 55(5), pages 949-965, October.

    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:inm:ortrsc:v:25:y:1991:i:2:p:124-137. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.