Search

Urban logistics encompass transportation and delivery operations within densely populated urban areas. It faces significant challenges from the evolving dynamic and stochastic nature of on-demand and conventional logistics services. Further challenges arise with application doctrines shifting towards crowd-sourced platforms. As a result, "traditional" deterministic approaches do not adequately fulfil constantly evolving customer expectations. To maintain competitiveness, logistic service providers must adopt proactive and anticipatory systems that dynamically model and evaluate probable (future) events, i.e., stochastic information. These events manifest in problem characteristics such as customer requests, demands, travel times, parking availability, etc. The Stochastic Dynamic Vehicle Routing Problem (SDVRP) addresses the dynamic and stochastic information inherent in urban logistics. This paper aims to analyse the key concepts, challenges, and recent advancements and opportunities in the evolving urban logistics landscape and assess the evolution from classical VRPs, via DVRPs, to state-of-art SDVRPs. Further, coupled with non-reactive techniques, this paper provides an in-depth overview of cutting-edge model-based and model-free reactive solution approaches. Although potent, these approaches become restrictive due to the "curse of dimensionality". Sacrificing granularity for scalability, researchers have opted for aggregation and decomposition techniques to overcome this problem and recent approaches explore solutions using deep learning. In the scope of this research, we observed that addressing real-world SDVRPs with a comprehensive resolution encounters a set of challenges, emphasising a substantial gap in the research field that warrants further exploration. [ABSTRACT FROM AUTHOR]

In order to ensure high-quality and on-time delivery in logistic distribution processes, it is necessary to efficiently manage the delivery fleet. Nowadays, due to the new policies and regulations related to greenhouse gas emission in the transport sector, logistic companies are paying higher penalties for each emission gram of CO2/km. With electric vehicle market penetration, many companies are evaluating the integration of electric vehicles in their fleet, as they do not have local greenhouse gas emissions, produce minimal noise, and are independent of the fluctuating oil price. The well-researched vehicle routing problem (VRP) is extended to the electric vehicle routing problem (E-VRP), which takes into account specific characteristics of electric vehicles. In this paper, a literature review on recent developments regarding the E-VRP is presented. The challenges that emerged with the integration of electric vehicles in the delivery processes are described, together with electric vehicle characteristics and recent energy consumption models. Several variants of the E-VRP and related problems are observed. To cope with the new routing challenges in E-VRP, efficient VRP heuristics and metaheuristics had to be adapted. An overview of the state-of-the-art procedures for solving the E-VRP and related problems is presented. [ABSTRACT FROM AUTHOR]

Copyright of Automatika: Journal for Control, Measurement, Electronics, Computing & Communications is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

With the rise of the electric vehicle market share, many logistic companies have started to use electric vehicles for goods delivery. Compared to the vehicles with an internal combustion engine, electric vehicles are considered as a cleaner mode of transport that can reduce greenhouse gas emissions. As electric vehicles have a shorter driving range and have to visit charging stations to replenish their energy, the efficient routing plan is harder to achieve. In this paper, the Electric Vehicle Routing Problem with Time Windows (EVRPTW), which deals with the routing of electric vehicles for the purpose of goods delivery, is observed. Two recharge policies are considered: full recharge and partial recharge. To solve the problem, an Adaptive Large Neighborhood Search (ALNS) metaheuristic based on the ruin-recreate strategy is coupled with a new initial solution heuristic, local search, route removal, and exact procedure for optimal charging station placement. The procedure for the O (1) evaluation in EVRPTW with partial and full recharge strategies is presented. The ALNS was able to find 38 new best solutions on benchmark EVRPTW instances. The results also indicate the benefits and drawbacks of using a partial recharge strategy compared to the full recharge strategy. [ABSTRACT FROM AUTHOR]