Research On Shared Vehicle Maintenance Path Planning Considering Service Priority

With the development of social economy,automobile has become the main tool for people to travel.The large-scale use of automobiles not only facilitates people's travel,but also brings problems such as traffic congestion and air pollution to the development of society and ecology.The emergence of shared vehicle not only meets the needs of automobile,but also alleviates the negative impact of the mass use of automobile on social and ecological development.Since the proposal of sharing economy in 2015,the business model of shared vehicle has been developed rapidly,but it has resulted in strong competitive pressures between shared vehicle enterprises.The shared vehicle enterprises have great homogeneity,and they have the characteristics of "heavy capital operation".Therefore,it is an important problem for the shared vehicle enterprises to improve customer satisfaction and keep the development of low operating cost.Through the investigation of the shared vehicle enterprises,it is found that the maintenance cost of the shared vehicles is an important part of its operation cost.Therefore,it is of great significance to reasonably plan the work path of the maintenance personnel and reduce the maintenance cost for the shared vehicle enterprises.During the investigation,it is also found that there will be maintenance tasks such as accident handling,refueling,cleaning,scheduling and so on after the shared vehicles are put into use.According to the urgency of tasks and the preferences of enterprises,maintenance tasks often have priority attribute.In order to solve the problem of shared vehicle maintenance path planning considering service priority,this paper introduces priority attribute based on the research of vehicle routing problem,and puts forward a new scientific problem,named vehicle routing problem considering service priority(VRPP).According to the literature review,it is found that fewer literatures consider the priority attribute of customers when solving the vehicle routing problem.VRPP is a vehicle routing problem with single park,single vehicle type,no capacity constraint,no soft or hard time window constraints,and customers(tasks)having priority.Aiming at this problem,this paper aims to minimize the driving distance of maintenance vehicles,and imposes a mandatory priority constraint on the traditional vehicle routing problem model to construct a combination optimization model of VRPP.Comprehensive existing literature and existing solving methods of vehicle routing problem and its variants,this paper uses the tabu search algorithm to solve the problem.In this paper,a large amount of data cleaning and prioritization are performed on the actual maintenance records provided by Dalian Chiao Group,and 58 test examples with reasonable priority structure and case size distribution are formed.At the same time,54 Solomon benchmark data sets are randomly selected for priority granting,forming classical structural test examples.In this paper,we use chiao test examples and classical structural test examples to verify the correctness and rationality of the model and the solution algorithm,and to explore the cost change caused by adding priority constraint.This paper is divided into seven parts:The introduction part.The part introduces the research background and significance,research purpose and content,and research characteristics.The domestic and international literature review part.This part summarizes the VRP and its variants,related problems of VRPP,the solution methods of VRP and its variants.The problem definition and combination optimization model part.The part describes and defines the research problem,explains the mathematical symbols,constructs and describes the combination optimization model of VRPP.The introduction of solving method of VRPP.In this part,tabu search algorithm is introduced,including the construction of an initial solution,the construction of neighbor and so on.The experimental data part.The part introduces the source of experimental data,the construction process of chiao test examples and classical structural test examples,and also expands the information of the test examples.The experimental analysis part.In order to explore the cost change caused by adding priority constraint and the impact of test examples characteristics on cost change,this part first makes a comparative analysis of the results of VRP and VRPP,and then analyses the results through three dimensions(M,R,T).The summary and outlook part.The part summarizes the main research work of this paper and looks forward to the directions of further research in the future.The research characteristics of this paper are as follows:firstly,on the basis of VRP,mandatory priority constraint is added,and VRPP and its combination optimization model are constructed to meet the actual needs;secondly,this paper uses the actual maintenance records provided by Dalian Chiao Group to construct test examples of VRPP,and crawls the actual driving distance between two maintenance tasks as the distance data in the test examples.So,practical test examples named chiao test examples are formed.In this paper,we test the correctness and rationality of the combination optimization model and the solution algorithm of VRPP using chiao test examples and classical structural test examples.At the same time,we study the cost change caused by adding priority constraint and the influence of test examples characteristics on the cost change.We find that when the number of customers(tasks)is less than 100,adding priority constraint on the basis of VRP will bring about a cost increase within 40%;when the distribution of customers(tasks)is M1,the cost increase caused by adding priority constraint is greater than M2;when the distribution of customers(tasks)is M2 and R(the ratio of high and low priority customers or tasks quantity)is closer to 1,the cost increase caused by adding priority constraint is more;when the number of customers(tasks)is more,the cost increase caused by adding priority constraint is more.