Workload equity in multiperiod vehicle routing problems

Abstract An equitable distribution of workload is essential when deploying vehicle routing solutions in practice. For this reason, previous studies have formulated vehicle routing problems with workload‐balance objectives or constraints, leading to trade‐off solutions between routing costs and workload equity. These methods consider a single planning period; however, in practice, equity is often sought over several days. In this work, we show that workload equity over multiple periods can be achieved without impact on transportation costs when the planning horizon is sufficiently large. This is demonstrated in the context of a generic multiperiod vehicle routing problem, using a simple two‐phase method. In the first phase, solutions of minimal distance are produced for each period. Next, the resulting routes are allocated to drivers to obtain equitable workloads over the planning horizon. We conducted extensive numerical experiments to measure the performance of the proposed approach and the level of workload equity achieved for different planning‐horizon lengths. For horizons of five days or more, we observed that quasi‐optimal workload equity and optimal routing costs can be jointly achievable.

Authors

Institutions

Publication Details

Journal
International Transactions in Operational Research
Published
2025-03-11
DOI
https://doi.org/10.1111/itor.70012
Citations
5
Primary Topic
Vehicle Routing Optimization Methods
Type
article
Field-Weighted Citation Impact
6.21

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Workload equity in multiperiod vehicle routing problems

Thibaut Vidal, Jean‐Yves Potvin, Michel Gendreau, Najmeh Nekooghadirli
5 citations
International Transactions in Operational Research
Vehicle Routing Optimization Methods
6.21
article

Workload equity in multiperiod vehicle routing problems

Thibaut Vidal, Jean‐Yves Potvin, Michel Gendreau, Najmeh Nekooghadirli
article en
5 citations

Abstract

Abstract An equitable distribution of workload is essential when deploying vehicle routing solutions in practice. For this reason, previous studies have formulated vehicle routing problems with workload‐balance objectives or constraints, leading to trade‐off solutions between routing costs and workload equity. These methods consider a single planning period; however, in practice, equity is often sought over several days. In this work, we show that workload equity over multiple periods can be achieved without impact on transportation costs when the planning horizon is sufficiently large. This is demonstrated in the context of a generic multiperiod vehicle routing problem, using a simple two‐phase method. In the first phase, solutions of minimal distance are produced for each period. Next, the resulting routes are allocated to drivers to obtain equitable workloads over the planning horizon. We conducted extensive numerical experiments to measure the performance of the proposed approach and the level of workload equity achieved for different planning‐horizon lengths. For horizons of five days or more, we observed that quasi‐optimal workload equity and optimal routing costs can be jointly achievable.

International Transactions in Operational ResearchVol. 33(1)
Polytechnique Montréal (CA), Université de Montréal (CA)
Compute Canada, Institut de Valorisation des Données, Centre interuniversitaire de recherche sur les reseaux d'entreprise, la logistique et le transport, Natural Sciences and Engineering Research Council of Canada
Openalex Percentile: Top 4%
Vehicle Routing Optimization Methods
6.21
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.