Abstract
Besides routing and packing plans, synthetically considering the requirements of customers about service time is absolutely necessary. An order split delivery plan can not only better satisfy the service time requirements, but also improve the full-load rate of vehicles. The split delivery vehicle routing problem with three-dimensional loading constraints (3L-SDVRP) combines vehicle routing and three-dimensional loading with additional packing constraints. In the 3L-SDVRP splitting deliveries of customers is basically possible, i.e., a customer can be visited in two or more tours. The vehicle routing problem with three-dimensional loading constraints that are based on the time window and considering split delivery of orders (3L-CVRPTWSDO) and its optimization algorithm are studied in this paper. We established mathematical model of the problem and designed the tabu search algorithm. Based on the examples used in Gendreau et al. (2006), examples was constructed to test our algorithm. The experimental results have expressed that, in the 3L-CVRP problem, the results of split delivery is better than those of non-split delivery, and it is easier to satisfy the time window constraints. The algorithm in this paper generates high quality solutions, it provides a effective method to solve the 3L-CVRPTWSDO problems.
Highlights
As the most important and basic activity in logistics, transportation will cause serious pollution to the environment
This paper focuses on the problem that most organizations are required to adopt more sustainable methods in their logistics operations, and raises the vehicle routing problem with three-dimensional loading constraints based on the time window and considering split delivery of orders
In the vehicle routing problem with three-dimensional loading constraints based on the time window and considering split delivery of orders, to achieve the best loading and delivery scheme within the loading capacity of the vehicle from the view of distribution center side, we devise the loading plan and delivery route of several vehicles that are involved in transportation activities
Summary
As the most important and basic activity in logistics, transportation will cause serious pollution to the environment. They consider the various operational constraints that often occur in real-world situations to meet the various requirements of the customer The purpose of this problem is to design the route with the lowest cost, and the study of this problem provides a reflection on how to reduce the waste of resources for the sustainable of this research. This paper focuses on the problem that most organizations are required to adopt more sustainable methods in their logistics operations, and raises the vehicle routing problem with three-dimensional loading constraints based on the time window and considering split delivery of orders. Our algorithm reduces the total travel distance of transport vehicles in the same delivery process by improving the overall efficiency in the logistics process, which can reduce fuel consumption, save fuel costs, and reduce greenhouse gas emissions This is consistent with the sustainable development strategy.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
