A parallel immune algorithm for traveling salesman problem and its application on cold rolling scheduling

Abstract

Parallel computing provides efficient solutions for combinatorial optimization problem. However, since the communications among computing processes are rather cost-consuming, the actual parallel or distributed algorithm comes with substantial expenditures, such as, hardware, management, and maintenance. In this study, a parallel immune algorithm based on graphic processing unit (GPU) that originally comes to process the computer graphics in display adapter is proposed. Genetic operators and a structure of vaccine taboo list are designed, and the internal memory utility of GPU structure is optimized. To verify the effectiveness and efficiency of the proposed algorithm, various middle-scale traveling salesman problems (TSP) are employed to demonstrate the potential of the proposed techniques. The simulation examples demonstrate that the developed method can greatly improve the computing efficiency for solving the TSP, and the results are more remarkable when the scale of TSP becomes higher. Furthermore, the derived algorithm is verified by a practical application in steel industry that arranges the cold rolling scheduling of a batch of steel coils. © 2010 Elsevier Inc. All rights reserved.