Multiple Traveling Salesman Problem and Its Application to Hot Rolling Planning
热轧计划中的多旅行商问题及其计算方法*

The hot rolling planning problem was modeled by MTSP(multiple traveling salesman problem).A hybrid genetic algorithm to solve the problem was designed.Through the simulated computation on the real data from a large steel milling plant,the results show that the recommended algorithm can achieve the better milling plan.The MTSP model and hybrid algorithm can solve the hot milling planning problem satisfactorily.