@article{ref1,
title="Fairness in hazmat routing-scheduling: a bi-objective Stackelberg game",
journal="Transportation research part E: logistics and transportation review",
year="2020",
author="Mohri, Seyed Sina and Asgari, Nasrin and Zanjirani Farahani, Reza and Bourlakis, Michael and Laker, Benjamin",
volume="140",
number="",
pages="e102006-e102006",
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: (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.<p /> <p>Language: en</p>",
language="en",
issn="1366-5545",
doi="10.1016/j.tre.2020.102006",
url="http://dx.doi.org/10.1016/j.tre.2020.102006"
}