Thirdly, for how to find the optimal sequence, giving a critical request local neighborhood search method.
第三部分，针对如何找到最优序列，提出一种关键请求局部邻近搜索方法。
Based on the characteristics of this problem, a modified variable neighborhood search method (VNS) is proposed for solving it.
针对推广模型的特点，提出了一种变邻域搜索(VNS)方法进行求解。
This paper presents a neighborhood search algorithm for finding a local minimal solution of the problem, then a filled function method for solving 0-1 programming is proposed.
文章首先给出搜索0-1规划局部极小解的邻域搜索算法，在此基础上给出了填充函数算法。
应用推荐