Résumé
The two-echelon capacitated vehicle routing problem (2E-CVRP) is a popular modelling approach used for solving urban logistics problems. Its aim is to handle freight distribution starting at a depot that supplies satellites or consolidation centres, and then to customers. Inspired by a case study, this work studies a 2E-CVRP variant with heterogeneous fleet of vehicles between echelons and limited loading capacity and time windows. The objective is the minimisation of the travel time. To deal with the computational complexity of the problem, a decomposition algorithm based on mixed integer linear programming (MILP) to solve the deterministic version is proposed. Also, a simheuristic is designed to solve its stochastic version. Experiments are carried out using real data of a case study in the city of Bogota, Colombia. Results show the impact of different freight delivery scenarios, providing insights for efficient decision-making.
| Langue originale | Anglais |
|---|---|
| Pages (de - à) | 223-248 |
| Nombre de pages | 26 |
| Revue | International Journal of Shipping and Transport Logistics |
| Volume | 18 |
| Numéro de publication | 2 |
| Les DOIs | |
| État | Publié - 2024 |
| Modification externe | Oui |
SDG des Nations Unies
Ce résultat contribue à ou aux Objectifs de développement durable suivants
-
SDG 11– Villes et communautés durables
Classification disciplinaire ASJC Scopus
- Commerce et gestion internationale
- Transport
- Sciences de la gestion et recherche opérationnelle
- Gestion de la technologie et de l'innovation
Empreinte digitale
Voici les principaux termes ou expressions associés à « Stochastic two-echelon vehicle routing problem with time windows: city logistics case study ». Ces libellés thématiques sont générés à partir du titre et du résumé de la publication. Ensemble, ils forment une empreinte digitale unique.Citer cette ressource
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver