Vehicle Routing Optimization Problem Of Fast Car Wash Team

Vehicle routing problem is a distribution center to multiple clients to provide goods.Each customer has its specific category and quantity of the material needs of the;distribution center unified scheduling of the number of vehicles for the delivery,to meet customer needs and satisfy certain constraints,such as the lowest cost and the shortest route,time etc.The purpose.Genetic algorithm is a search algorithm that simulates the biological evolution in nature.It is an effective method to solve the vehicle scheduling problem because of its strong global search ability and good robustness.This article selects the research object for Taiyuan city "federal" city car wash,the car wash use "beauty group net" network trading platform business and provide customers of Taiyuan city line under the door car service.Because the scheduling method is manual scheduling,scheduling efficiency is low and can not meet all customer requirements on time,so this paper intends to build a model to simulate the reality of the situation.This article will take the "car Federation" city car wash behavior research object,through the R2016b Matlab software using genetic algorithm to study the vehicle scheduling problem,the specific chapters and the main contents are as follows:Chapter 1 introduction has introduced the research background,research purpose,literature review and review,the main research content of this paper and the framework of this article.The second chapter,mainly introduces the theory of vehicle routing problem.Firstly summarizes the classification of vehicle routing problem,focuses on the vehicle routing problem with exact algorithms and heuristic algorithms,then common mathematical model of vehicle routing problem and its assumptions are described,finally compare the vehicle routing problem of several algorithms applicable occasions and the advantages and disadvantages.In the third chapter,the paper introduces the optimal scheduling problem of the vehicle in the city.Summarizes the basic connotation andcharacteristics of city vehicle scheduling problem and the development present situation and the existing problems are analyzed.A clear goal of city car wash service optimization;for the time window problem are described;and desirability function is proposed according to the time window;and then construct the city car wash service distribution route optimization model.The fourth chapter,the empirical research on the vehicle scheduling optimization of the city car wash service.The rationality of this chapter in Taiyuan "car wash Federation" as an example to study algorithm.By selecting the "federal" car wash in a certain period of time the customer specific data line and through MATLAB language programming,using genetic algorithm to find the results,the optimization results and the reality of the situation made a comparison,the real scheduling scheme can be optimized by empirical.The fifth chapter,conclusion.This chapter summarizes the content of this paper,and then summarizes the results of the article,and analyzes the existing problems,and summarizes the future prospects.