We design routes for transportation of hazardous materials (HAZMAT) in urban areas, with multiple origin-destination pairs. First, we introduce the maxisum HAZMAT routing problem, which maximizes the sum of the population-weighted distances from vulnerable centers to their closest point on the routes. Secondly, the maximin-maxisum HAZMAT routing problem trades-off maxisum versus the population-weighted distance from the route to its closest center. We propose efficient IP formulations for both NP-Hard problems, as well as a polynomial heuristic that reaches gaps below 0.54% in a few seconds on the real case in the city of Santiago, Chile.


    Zugriff

    Zugriff über TIB

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    The maxisum and maximin-maxisum HAZMAT routing problems



    Erschienen in:

    Erscheinungsdatum :

    2016




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Print


    Sprache :

    Englisch



    Klassifikation :

    BKL:    85.00 / 55.82 Güterverkehr



    The maxisum and maximin-maxisum HAZMAT routing problems

    Bronfman, Andrés / Marianov, Vladimir / Paredes-Belmar, Germán et al. | Elsevier | 2016


    Dynamic Routing Algorithm for Hazmat Transportation Problems

    Hu, Ta-Yin / Hsu, Yu-Cheng / Liao, Tsai-Yun | Transportation Research Record | 2022


    Hazmat Routing: Alternate Routing Risk Analysis

    Gordon, Gary A. / Young, Richard R. | British Library Conference Proceedings | 2016


    Hazmat Routing: Safety and Security Challenges

    Gordon, Gary A. / Young, Richard R. | British Library Conference Proceedings | 2015


    GIS-ABP model for HAZMAT routing with security considerations

    Bo Huang, / Cheu Ruey Long, / Yong Seng Liew, | IEEE | 2003