Research On Model And Algorithm For Manpower Routing Problem With Multiple-Skills Constraint And Time Windows

With the incessant development of technology,vehicle routing problem and vehicle routing problem are becoming the focus of the logistics industry.The applications are extending beyond the scope of transportation of vehicles and goods.The derivation of vehilcle routine problem such as freight dispatching,the path of carbon emissions,the location of electric vehicles,the problem of human resource routing have recently becoming the focus of related scholars.Today,With the great development of material life in recent decades,people are more demanding on the quality and efficiency of serving.Therefore,given the condition that human resources such as skilled employees are limited,enterprises and organizations are paying more attention on the control over costs and personnel arrangements.Based on the consideration of service personnel scheduling and path arrangement,this paper divided the service personnel into different skill types according to whether they have multiple skills or not,elaborate research and discussion have been made in order to reduce the actual cost of the enterprises.Based on this,a human resource routing problem with time window and multiple skill constraints is proposed and obtained as the main research object of this paper.The main contents of this paper could be summerized as three points:(1)The research status at home and abroad and future development of this problem have been summerized.Based on this,The paper also analyzes and discusses the categories and mathematical models of vehicle routing problems and gives a brief summary of the basic algorithms for solving the problems.(2)In order to solve the proposed problem,this paper establishes its own mathematical model based on related previous research and designs Hybrid Parallel Multi-Strategy Heuristic Algorithm(HPMSHA)to solve the problem.The algorithm not only incorporates a variety of Local search operator,also cleverly combines the tabu search and simulated annealing idea.And through the relevant examples,the validity of the algorithm and the quality of solution are proved.(3)According to the algorithm proposed in this paper,we have tested its validity in many ways,from the determination of the parameters to the analysis of the examples to the comparison with other algorithms.The simulation results show that the algorithm is universal and practical.