Solving Vehicle Routing Problem with Split Deliveries and Time Window Constraints

Vehicle routing problem in logistic industry is always considered as one of important theoretical and practical issues.This paper redesigned the model of the problem based on split deliveries of customer demand and time window assigned to customer and distribution center.And the new rule to select split points related to customer places is also demonstrated in order to decide the computing process.Thus the Max-Min ant system incorporated with improved transition probability of basic ant algorithm is employed to compute the model.The result indicated that not only the algorithm is feasible and valid but also adoption of split deliveries does justify the mode compared with non-split deliveries vehicle routing problem.