Abstract
Service routes optimization (SRO) of pallet service center should meet customers' demand firstly and then, through the reasonable method of lines organization, realize the shortest path of vehicle driving. The routes optimization of pallet service center is similar to the distribution problems of vehicle routing problem (VRP) and Chinese postman problem (CPP), but it has its own characteristics. Based on the relevant research results, the conditions of determining the number of vehicles, the one way of the route, the constraints of loading, and time windows are fully considered, and a chance constrained programming model with stochastic constraints is constructed taking the shortest path of all vehicles for a delivering (recycling) operation as an objective. For the characteristics of the model, a hybrid intelligent algorithm including stochastic simulation, neural network, and immune clonal algorithm is designed to solve the model. Finally, the validity and rationality of the optimization model and algorithm are verified by the case.
Highlights
In the pallet pool mode, the usage rate of pallet can be improved and logistics cost can be reduced by duty-cycle operation
Through analyzing the purpose of pallet service route optimization, we find that the pallet service route optimization is similar to logistics distribution vehicle routing optimization (VRP), so we can draw lessons from the relevant theory research of VRP
Vehicle routing problem with pickups and deliveries (VRPPD) considers the demand of delivery and recovery for each customer; delivery and recovery services need to be completed at the same time for one customer; this can save the vehicle transportation cost for the logistics enterprises
Summary
In the pallet pool mode, the usage rate of pallet can be improved and logistics cost can be reduced by duty-cycle operation. The purpose of pallet service route optimization is to determine the optimal service path, so that the vehicle can provide services (delivery and recovery operation) for each demand point efficiently This is a problem of solving the optimal routes for multipoints. Vehicle routing problem with pickups and deliveries (VRPPD) considers the demand of delivery and recovery for each customer; delivery and recovery services need to be completed at the same time for one customer; this can save the vehicle transportation cost for the logistics enterprises It is a subproblem with economic efficiency and operating efficiency of the vehicle routing optimization problem, but it does not consider the time constraint [3]. It is required that the total delivery route is the shortest by the reasonable allocation of the delivery route for each postman
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
