Path Planning Problem and Solving Algorithm for Cleaning and Wweeping Vehicles
Sweeper path planning problem is a class of capacitated arc routing problem(CARP)with NP-hard property.In order to improve the ability to solve the problem,this paper proposes a combination algorithm of simulated annealing and hybrid genetic algorithm,referred to as simulated annealing hybrid genetic algorithm(SAHGA).The algorithm adds the idea of simulated annealing algorithm after the local search operation in the hybrid genetic algorithm,thus improving the capability of solving the optimal solution of the sweeper truck scheduling.At the same time,the selection algorithm in the algorithm is improved by using a more effective tournament.Tests were carried out using the standard CARP sets,and comparisons of the effectiveness of the improved algorithm with the traditional hybrid genetic algorithm and other heuristic methods are given.The results show that the simulated annealing hybrid genetic algorithm performs better than the original hybrid genetic algorithm in some of the arithmetic cases,and is an effective method for solving CARP.Finally,the algorithm is applied to a specific street sweeping problem around the Hangzhou Dianzi University campus,which verifies the reliability of the algorithm.
NETL
NSTL
万方数据
