E-cargo bike route optimization with rider fatigue considerations: A chance-constrained programming approach

Zahra Nourmohammadi et al.

Computers and Operations Research2026https://doi.org/10.1016/j.cor.2026.107460article
AJG 3ABDC A
Weight
0.50

Abstract

Electric cargo (e-cargo) bikes offer a promising, sustainable alternative for last-mile logistics. However, rider fatigue remains a critical, yet often overlooked, constraint, impacting both operational performance and rider well-being. This study introduces and formulates a Chance-Constrained Heterogeneous and Multi-Trip Vehicle Routing Problem (CC-HMVRP) that accounts for rider fatigue, incorporating load mass, environmental conditions, and rider characteristics into delivery planning. A mixed-integer linear programming (MILP) formulation and a modified adaptive large neighborhood search (ALNS) solution method are proposed to handle larger instances. We examine how wind speed and temperature influence battery and rider energy levels. Numerical results show a 27.2% reduction in total energy consumption compared to deterministic models, while riders retain 62.8% more available time before reaching fatigue. These findings enhance sustainability, improve efficiency, and support rider well-being, offering new insights for optimizing last-mile delivery operations under real-world constraints. • Introduces a chance-constrained programming model for e-cargo bike routing with rider fatigue limits. • Develops an Adaptive Large Neighborhood Search (ALNS) algorithm for large-scale optimization. • Demonstrates a 27.2% reduction in total energy consumption while improving rider endurance.

Open via your library →

Cite this paper

https://doi.org/https://doi.org/10.1016/j.cor.2026.107460

Or copy a formatted citation

@article{zahra2026,
  title        = {{E-cargo bike route optimization with rider fatigue considerations: A chance-constrained programming approach}},
  author       = {Zahra Nourmohammadi et al.},
  journal      = {Computers and Operations Research},
  year         = {2026},
  doi          = {https://doi.org/https://doi.org/10.1016/j.cor.2026.107460},
}

Paste directly into BibTeX, Zotero, or your reference manager.

Flag this paper

E-cargo bike route optimization with rider fatigue considerations: A chance-constrained programming approach

Flags are reviewed by the Arbiter methodology team within 5 business days.


Evidence weight

0.50

Balanced mode · F 0.40 / M 0.15 / V 0.05 / R 0.40

F · citation impact0.50 × 0.4 = 0.20
M · momentum0.50 × 0.15 = 0.07
V · venue signal0.50 × 0.05 = 0.03
R · text relevance †0.50 × 0.4 = 0.20

† Text relevance is estimated at 0.50 on the detail page — for your query’s actual relevance score, open this paper from a search result.