Multiobjective Multidepot Capacitated Arc Routing Optimization Based on Hybrid Algorithm

Abstract

The multidepot capacitated arc routing problem (CARP) is investigated with the hybrid optimization algorithm of the Dijkstra algorithm and genetic algorithm. The complex multidepot CARP is transformed into multiple single depot CARP by systematic clustering analysis. After completing the system clustering, the Dijkstra algorithm is used to adjust the boundary arc locally and merge it to a reasonable depot, while in the genetic algorithm, the structure of the chromosome is reset to use the path as the way of real coding, and the elite selection is used to decode to obtain the optimal path optimization scheme. Finally, Lanzhou road network data as experimental data, through Matlab to achieve the practicability of the algorithm in sprinkler applications. The results show that the improved genetic algorithm can successfully solve the multi-segment CARP with a certain road network scale, ensuring the correctness and feasibility of the algorithm. In addition, the efficiency of the algorithm in the later iteration is basically controlled at about 0.5 seconds, indicating that the efficiency of the algorithm is worth identifying.