Improved ant colony optimization algorithm for the traveling salesman problems

来源 :系统工程与电子技术:英文版 | 被引量 : 0次 | 上传用户:kampfing
下载到本地 , 更方便阅读
声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架
论文部分内容阅读
Ant colony optimization(ACO) is a new heuristic algorithm which has been proven a successful technique and applied to a number of combinatorial optimization problems.The traveling salesman problem(TSP) is among the most important combinatorial problems.An
其他文献
Aimed at the guidance requirements of some missiles which attack targets with terminal impact angle at the terminal point,a new integrated guidance and control
近年来,越来越多的商业银行出现净利润下滑之势,然而,代发工资业务不仅使中间业务发展呈现出快速增长,更是对整个银行净利息收入的转亏为盈起到了不可忽视的重要作用。由于企
<正>Motion estimation is an important and intensive task in video coding applications.Since the complexity of integer pixel search has been greatly reduced by t
以PS、SEBS为改性剂对PP进行改性。加入PS ,体系的强度和刚度得到提高 ,断裂伸长率和冲击性能下降 ,对其改变的原因采用SEM进行了结构分析 ;SEBS是PS的良好相容剂 ,也是PP很
以手持移动电子设备及移动网络的发展为背景,微课,一种新型的教学模式出现在教育者视野。微课具有视频化、时间短、内容精、情景化等特点,符合网络编辑课程的发展,将微课与网
Stable local feature detection is a fundamental component of many stereo vision problems such as 3-D reconstruction, object localization, and object tracking. A
<正>To evaluate the ranging performance of impulse radio ultra wideband(IR-UWB)signals,an experiment is performed in a typical indoor environment.In order to mi
The dynamic capacitated location allocation problem in the military supportive network(DCLAP-MSN) is a representative of combinative optimization problems,and i
Two new formulaes of the main parameter βk of the conjugate gradient method are presented, which respectively can be seen as the modifications of method HS and