The Split Delivery Vehicle Routing Problem with Three-Dimensional Loading and Time Windows Constraints

Chen, Zongyi; Yang, Mingkang; Guo, Yijun; Yu, Liang; Ding, Yifan; Wang, Li

doi:10.3390/su12176987

Cited by 13 publications

(5 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…None of the above studies take into account the time window requirements for the delivery process, which has stricter delivery time windows for electric meters. Z. Chen [31] introduced the vehicle routing problem based on the time window and the threedimensional loading constraints considering order distribution is studied, and a tabu search algorithm is designed to generate a high-quality initial solution. F. Alesiani [32] proposes a Constrained Clustering Capacitated Vehicle Routing Solver, which can transform the complex constraints of the original problem into a more manageable problem based on the soft-clustered vehicle routing problem with reduced decision variable.…”

Section: A Vehicle Routing Problems Within Urbanmentioning

confidence: 99%

Optimizing Heterogeneous Vehicle Routes for Urban Distribution Considering the Three-Dimensional Bin Packing Problem of Electric Meters

He,

Zhang,

Lin

et al. 2024

IEEE Access

View full text Add to dashboard Cite

With the establishment of smart grids, there is a growing demand for metering electric meters in urban areas. Given the diverse sizes and delicate nature of these meters, traditional scheduling solutions are unable to cater to the multifaceted requirements of urban environments, meters loading, and subsequent logistics scheduling. This study presents an intelligent scheduling model for electric meters in an urban context, taking into account various constraints such as urban traffic congestion, three-dimensional packing of metering devices, delivery time windows, and heterogeneous vehicles. To solve this, we design an improved whale optimization algorithm using a hybrid multi-phase heuristic approach (IWOA-HMOHA). Simulation results show that compared with the traditional meter logistics scheduling strategy, the IWOA-HMOHA algorithm reduces the objective function by 5.4%~ 26.1% compared with other similar algorithms. In addition, compared with the traditional first-in-last-out cargo packing method, the vehicle space utilization rate is improved by 12.62%. The proposed models and algorithms demonstrate excellent adaptability to a range of urban constraints, offering valuable insights and a robust framework essential for the development of logistics solutions in urban.INDEX TERMS logistics applications; the three-dimensional bin packing problem; hybrid multi-phase heuristic approach; evolutionary algorithms; difference strategy

show abstract

Section: A Vehicle Routing Problems Within Urbanmentioning

confidence: 99%

Optimizing Heterogeneous Vehicle Routes for Urban Distribution Considering the Three-Dimensional Bin Packing Problem of Electric Meters

He,

Zhang,

Lin

et al. 2024

IEEE Access

View full text Add to dashboard Cite

show abstract

“…The genetic algorithm (GA) is a stochastic search technique that uses the biological world's survival of the fittest and other natural principles to locate the best solution space. It is hopeful that GA can optimize complex mathematical models such as the vehicle-routing problem (VRP) [37][38][39][40][41], without the need to calculate the objective function's derivatives. To find the best option, GA has been used in numerous studies.…”

Section: Solution Algorithmmentioning

confidence: 99%

Designing Flexible-Bus System with Ad-Hoc Service Using Travel-Demand Clustering

et al. 2023

View full text Add to dashboard Cite

Providing direct and affordable transit services for travelers is the goal of the evolving flexible-bus (FB) system. In this study, we design an FB system with an ad-hoc service, to supplement traditional public transit and provide a better FB service. We first build up a mathematical model to optimize bus-stop sites, routes, and schedules, where the unmet travel demand is served by an ad-hoc service with relatively high cost. Then, we cluster travel demand spatially and temporarily, using the ST-DBSCAN algorithm. We use the simulated-annealing algorithm, which has better convergence and diversity than other heuristic algorithms, to solve the suggested model in large-scale networks. To demonstrate the effectiveness of the proposed model, we run experiments on a small network and a large real-world network of Shenzhen airport, which shows that the FB system with ad-hoc service can reduce overall cost and improve social welfare, compared to taxies and FB only. In addition, it provides affordable transit services with shorter walking distances and lower waiting times, which can be deployed in airports or high-speed railway stations with massive, irregular travel demands.

show abstract

“…There are multiple combinations and generalizations of this problem, including 3L-CVRP (Capacitated Vehicle Routing Problem with 3D Loading constraint) [31] consisting of CVRP with mass constraint and 3D packing constraint, SDVRP-Split Delivery Vehicle Routing Problem [32], 3L-SDVRP-3D Loading Split Delivery Vehicle Routing Problem [33], 3L-CVRPTWSDO-Split Delivery Vehicle Routing Problem with 3D Loading and Time Windows constraints [34].…”

Section: Overview About Related Problems and Corresponding Tools Over...mentioning

confidence: 99%

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

Naumov

Pawluś

2021

Energies

View full text Add to dashboard Cite

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.

show abstract

The Split Delivery Vehicle Routing Problem with Three-Dimensional Loading and Time Windows Constraints

Cited by 13 publications

References 28 publications

Optimizing Heterogeneous Vehicle Routes for Urban Distribution Considering the Three-Dimensional Bin Packing Problem of Electric Meters

Optimizing Heterogeneous Vehicle Routes for Urban Distribution Considering the Three-Dimensional Bin Packing Problem of Electric Meters

Designing Flexible-Bus System with Ad-Hoc Service Using Travel-Demand Clustering

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

Contact Info

Product

Resources

About