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

Date

2020-06-25

Supervisor/s

Journal Title

Journal ISSN

Volume Title

Publisher

Elsevier

Department

Type

Article

ISSN

1366-5545

Format

Citation

Mohria SS, Asgari N, Farahani RZ, et al., (2020) Fairness in hazmat routing-scheduling: a bi-objective Stackelberg game. Transportation Research Part E: Logistics and Transportation Review, Volume 140, August 2020, Article number 102006

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

Description

Software Description

Software Language

Github

Keywords

Multi-objective decision making, Game theory, Hazardous materials, Vehicle routing, Transportation

DOI

Rights

Attribution-NonCommercial-NoDerivatives 4.0 International

Relationships

Relationships

Supplements