Highlights A hazmat routing-scheduling problem is formulated as a bi-objective game. A FIFO discipline is applied to waiting places to keep fairness among dispatchers. Risk and travel time objectives are included to embed the planner’s risk attitude. By solving the problem with a modified ALNS on a real case, insights are presented.

    Abstract We investigate a hazmat routing-scheduling problem. To minimize the overall expected risk, various vehicles may take different routes/schedules to avoid multiple accidents on the same link. Therefore, the company envisages two issues: unfairly, a vehicle departing earlier from its origin may arrive earlier at its destination than the others leaving later; focusing only on the minimization of risk may increase travel time/cost incurred by the company. We suggest a bi-objective game-theoretic formulation and solve it by a modified Adaptive Large Neighborhood Search and Simulated Annealing. We test the solution on a real-life case and extract practical insights.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Fairness in hazmat routing-scheduling: A bi-objective Stackelberg game




    Publication date :

    2020-06-06




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    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


    Integrated Routing and Scheduling of Hazmat Trucks with Stop En Route

    Erkut, E. / Alp, O. | British Library Online Contents | 2007


    Dynamic Routing Algorithm for Hazmat Transportation Problems

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