Abstract

This study introduces the Multi-Objective Sustainable Vehicle Routing Problem (MOSVRP) with time windows, designed for congested urban networks. The model simultaneously addresses economic, environmental, and social sustainability by minimizing costs and emissions while maximizing customer satisfaction through enhanced service at pickup nodes. To manage the complexity of large-scale urban routing, we propose a novel Voronoi diagram-based network shrinking procedure that significantly reduces computational effort. More specifically, the model incorporates time-dependent traffic patterns to capture realistic urban conditions. For the solution, we propose a tailored metaheuristic, the enhanced Multi-Objective Volleyball Premier League (MOVPL) algorithm, which incorporates reference point guidance, disruption operators, and adaptive weight adjustment. This hybrid approach effectively balances conflicting objectives and improves solution diversity. Applied to Tehran’s urban freight network, the proposed method demonstrates superior performance across all metrics compared to benchmark algorithms and exact methods. Results show notable reductions in fuel consumption and travel distance, alongside improved service equity. Furthermore, the framework offers a scalable and transferable solution for sustainable logistics in other urban contexts.

Document Type

Journal Article

Date of Publication

1-1-2025

Publication Title

Annals of Operations Research

Publisher

Springer

School

School of Business and Law

Funders

Persian Gulf University (PGU24-238641)

Creative Commons License

Creative Commons Attribution 4.0 License
This work is licensed under a Creative Commons Attribution 4.0 License.

Comments

Moghdani, R., Salimifard, K., Demir, E., Barak, S., Aazami, A., & Shekarabi, S. a. H. (2025). A metaheuristic approach for the multi-objective sustainable vehicle routing problem. Annals of Operations Research. Advance online publication. https://doi.org/10.1007/s10479-025-06904-1

Share

 
COinS
 

Link to publisher version (DOI)

10.1007/s10479-025-06904-1