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

Seyed Sina Mohri, Nasrin Asgari, Reza Zanjirani Farahani, Michael Bourlakis, Benjamin Laker

Research output: Contribution to journalArticlepeer-review

29 Downloads (Pure)


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: (1) unfairly, a vehicle departing earlier from its origin may arrive earlier at its destination than the others leaving later; (2) 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.

© 2020, Elsevier. The attached document (embargoed until 25/06/2023) is an author produced version of a paper published in TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW uploaded in accordance with the publisher’s self-archiving policy. The final published version (version of record) is available online at the link. Some minor differences between this version and the final published version may remain. We suggest you refer to the final published version should you wish to cite from it.
Original languageEnglish
Publication statusPublished - 25 Jun 2020

Cite this