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.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
customersupport@researchsolutions.com
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.