主管:中国科学院
主办:中国优选法统筹法与经济数学研究会
   中国科学院科技战略咨询研究院

Chinese Journal of Management Science ›› 1997, Vol. ›› Issue (1): 35-39.

Previous Articles     Next Articles

Analyais and Improvement of the Neighbouring Search Algorithm for FSP

Zhao He, Du Duanfu   

  1. Management School of Beijing University of Aero. & Astr
  • Received:1996-10-29 Online:1997-03-28 Published:2012-03-06

Abstract: This paper analyses the features of neighbor area search algorithms (K-OPT), and its shortcoming. Based on these, We proposed an efficent and lower algorithms complexity herustic method.

Key words: TSP, K-OPT, herustic