摘要
针对多目标旅行商问题,提出了一种基于模拟植物生长的优化算法。该算法将Deb等人提出的非支配排序及构造偏序集等方法用于模拟植物生长的过程中,克服了模拟植物生长算法搜索空间过大及收敛性不够理想的缺点。基于该算法的核心思想,用MATLAB编程实现,对参考文献的算例进行仿真测试。与其他算法比较,获得了满意的结果。
This paper proposed a new algorithm based on plant growth simulation algorithm for multi-criteria travelling salesman problem.In the algorithm,it used the method of non-dominated sorting and partially ordered set construction proposed by Deb etc in simulating process of plant growth.It could improve the efficiency of searching and the convergence property of the algorithm.It presented the main idea of the algorithm for MTSP and implemented on microcomputer by MATLAB.Through simulations of a kind of computational instance and comparisons with other algorithms,it obtains satisfactory results.
出处
《计算机应用研究》
CSCD
北大核心
2012年第10期3733-3735,共3页
Application Research of Computers
基金
国家自然科学基金资助项目(70871081)
上海市重点学科建设资助项目(S30504)
上海市研究生创新基金资助项目(JWCXSL1102)
关键词
多目标旅行商
模拟植物生长算法
非支配排序
偏序集
multi-criteria travelling salesman(MTSP)
plant growth simulation algorithm(PGSA)
non-dominated sorting
partially ordered set