Dynamic Vehicle Routing Problem Considering Customer Satisfaction

Dynamic vehicle routing problem with time windows(DVRPTW) is a complicated combination optimal problem which attracts most scholars and experts to study. This paper considers the customer satisfaction in dynamic vehicle routing problem. In order to solve this problem, the dynamic vehicle routing problem is decomposed into multiple static vehicle routing problems, and the corresponding model is established with the objective of maximizing customer satisfaction. The model uses the idea of transforming the vehicles driving on the road into virtual customer points. In order to reflect the quality of service, the concept of customer satisfaction is introduced. Lingo 11 is used to solve the model, and results show that dynamic routing planning can serve more customer requests and improve average customer satisfaction.