Application of Discrete Whale Optimization Hybrid Algorithm in Multiple Travelling Salesmen Problem

Abstract

For the standard whale optimization algorithm cannot directly solve the multiple travelling salesmen problem(MTSP), this paper proposes a discrete whale optimization hybrid algorithm (DWOHA) . A small amount of optimization of ant colony optimization is used to provide some elite individuals for the initial population to reduce the number of global searches. Propose a principal and subordinate chromosome coding method with smaller solution space to reduce the space complexity of the algorithm and improve the efficiency of optimization. Redefine the operation rules to apply the characteristics of MTSP discrete solution space based on the whale's unique location update method. Construct a triangular neighborhood structure to increase the local mining efficiency of the algorithm and improve the convergence accuracy. Through simulation experiments on several test sets, the results are compared with other algorithms which proves that DWOHA has an excellent performance in solving MTSP.