Integrating public transport in sustainable last-mile delivery: column generation approaches
We tackle the problem of coordinating a three-echelon last-mile delivery system. In the first echelon, trucks transport parcels from distribution centres outside the city to public transport stops. In the second echelon, the parcels move on public transport and reach the city centre. In the third ec...
| Autores: | , , |
|---|---|
| Tipo de documento: | artigo |
| Estado: | Versão publicada |
| Data de publicação: | 2025 |
| País: | España |
| Recursos: | Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya) |
| Repositório: | Recercat. Dipósit de la Recerca de Catalunya |
| OAI Identifier: | oai:recercat.cat:10230/70424 |
| Acesso em linha: | http://hdl.handle.net/10230/70424 http://dx.doi.org/10.1016/j.ejor.2024.12.047 |
| Access Level: | Acceso aberto |
| Palavra-chave: | Combinatorial optimisation Last-mile delivery Logistics Column generation Multi-echelon transportation |
| Resumo: | We tackle the problem of coordinating a three-echelon last-mile delivery system. In the first echelon, trucks transport parcels from distribution centres outside the city to public transport stops. In the second echelon, the parcels move on public transport and reach the city centre. In the third echelon, zero-emission vehicles pick up the parcels at public transport stops and deliver them to customers. We introduce two extended formulations for this problem. The first has two exponential sets of variables, while the second has one. We propose column generation algorithms and compare several methods to solve the pricing problems on specially constructed graphs. We also devise dual bounds, which we can compute even when the graphs are so large that not a single pricing round completes within the time limit. Compared to previous formulations, our models find 16 new best known solutions out of an existing dataset of 24 instances from the literature. |
|---|