We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Identifying the Optimal Packing and Routing to Improve Last-Mile Delivery Using Cargo Bicycles.
- Authors
Naumov, Vitalii; Pawluś, Michał
- 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 apply mathematical descriptions of problems, including the Knapsack Problem, Traveling Salesman Problem and Traveling Thief Problem. Based on synthetically generated data, we study the efficiency of the proposed algorithms. Models described in this paper are implemented in Python programming language and will be further developed and used for solving the problems of electric cargo bikes' routing under real-world conditions.
- Subjects
PACKING problem (Mathematics); ELECTRIC bicycles; FREIGHT &; freightage; TRAVELING salesman problem; PYTHON programming language; PROBLEM solving; ROUTING algorithms
- Publication
Energies (19961073), 2021, Vol 14, Issue 14, p4132
- ISSN
1996-1073
- Publication type
Article
- DOI
10.3390/en14144132