2021
DOI: 10.3390/en14144132
|View full text |Cite
|
Sign up to set email alerts
|

Identifying the Optimal Packing and Routing to Improve Last-Mile Delivery Using Cargo Bicycles

Abstract: Efficient vehicle routing is a major concern for any supply chain, especially when dealing with last-mile deliveries in highly urbanized areas. In this paper problems considering last-mile delivery in areas with the restrictions of motorized traffic are described and different types of cargo bikes are reviewed. The paper describes methods developed in order to solve a combination of problems for cargo bicycle logistics, including efficient packing, routing and load-dependent speed constraints. Proposed models … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
8
1

Relationship

1
8

Authors

Journals

citations
Cited by 20 publications
(8 citation statements)
references
References 25 publications
(35 reference statements)
0
5
0
Order By: Relevance
“…Llorca & Moeckel [1] assessed the potential of cargo bikes and electrification for lastmile parcel delivery by simulating the urban freight flows. Naumov & Pawlus [13] addressed the optimal packing and routing problem to improve LMD using cargo bikes. Niels et al [14] investigated the design and operation of an urban electric courier cargo bike system in Munich, Germany.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Llorca & Moeckel [1] assessed the potential of cargo bikes and electrification for lastmile parcel delivery by simulating the urban freight flows. Naumov & Pawlus [13] addressed the optimal packing and routing problem to improve LMD using cargo bikes. Niels et al [14] investigated the design and operation of an urban electric courier cargo bike system in Munich, Germany.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Table 4 shows the corresponding results. The best resulting route set for ACO consists of five routes in this case ( [21,20,25,19,2,1], [23,10,11,3], [12,13,5,6,4], [24,17,16,15,14,22], [9,8,7,18]) versus four routes for the GA ( [13,20,21,2,12,9,5], [6,8,3,22,7,4,1], [18,14,24,23,10,11], [16,15,17,19,25]). As seen in Table…”
Section: Ga Performance Validationmentioning
confidence: 99%
“…A heuristic solver integrated into Geographic Information Software (GIS) was used to handle the problem. More recently, Naumov and Pawluś [18] applied a local search algorithm to determine optimal routes for e-cargo bikes under load-dependent speed and packing constraints. Fontaine [19] presented a model and an adaptive large neighborhood algorithm for the VRP under load-dependent speed as well, considering conventional cargo bicycles.…”
Section: Introductionmentioning
confidence: 99%
“…In practice, while planning the deliveries of cargo by bikes, the combined consignments are usually prepared by transport operators: to minimize the total delivery distance, the routing procedures are used to combine the requests for deliveries during the given time window (the vehicle capacity must be considered in such cases as the model constraint to prevent the overload of vehicles). The transport demand model should reflect the real-world rational behavior of operators; it could be approximated by the implementation within the model of vehicle routing procedures (the example of such implementation is described in [25]).…”
Section: Simulations Of the Demand For Deliveriesmentioning
confidence: 99%