检索结果-内蒙古大学图书馆

An improved network dismantling strategy based on ant colony algorithm

INTERNATIONAL JOURNAL OF MODERN PHYSICS C 2025年第3期36卷

作者： Wang, Yongming Sun, Shiwen Wang, Zhen Wang, Li Xia, Chengyi Tianjin Univ Technol Sch Comp Sci & Technol Tianjin 300191 Peoples R China Tiangong Univ Sch Articial Intelligence Tianjin 300387 Peoples R China

Network dismantling, which aims at finding the optimal node sequence whose removal will dismantle the whole network effectively, remains as a hot topic in the research area of complex networks and systems. In this study, an improved network dismantling strategy based on ant-colony optimization algorithm is proposed. Through large quantities of numerical simulations, compared with several classical network dismantling methods, the effectiveness of the proposed strategy is verified. Current results can provide a new perspective for us to comprehend the complexity and optimization of complex networked systems.

关键词： Complex networks network dismantling attack ant-colony algorithm

来源：评论

学校读者我要写书评

暂无评论

Iterative ant-colony algorithm and its application to dynamic optimization of chemical process

引用

COMPUTERS & CHEMICAL ENGINEERING 2005年第10期29卷 2078-2086页

作者： Zhang, B Chen, DZ Zhao, WX Zhejiang Univ Dept Chem Engn Hangzhou 310027 Peoples R China E China Univ Sci & Technol Automat Inst Shanghai 200237 Peoples R China Clarkson Univ CARES Potsdam NY 13699 USA

For solving dynamic optimization problems of chemical process with numerical methods, a novel algorithm named iterative ant-colony algorithm (IACA), the main idea of which was to iteratively execute ant-colony algorithm and gradually approximate the optimal control profile, was developed in this paper. The first step of IACA was to discretize time interval and control region to make the continuous dynamic optimization problem be a discrete problem. ant-colony algorithm was then used to seek the best control profile of the discrete dynamic system. At last, the iteration based on region reduction strategy was employed to get more accurate results and enhance robustness of this algorithm. Iterative ant-colony algorithm is easy to implement. The results of the case studies demonstrated the feasibility and robustness of this novel method. IACA approach can be regarded a,,;a reliable and useful optimization tool when gradient is not available. (c) 2005 Published by Elsevier Ltd.

关键词： dynamic optimization ant-colony algorithm iterative ant-colony algorithm

来源：评论

学校读者我要写书评

暂无评论

A fast ant-colony algorithm for single-machine scheduling to minimize the sum of weighted tardiness of jobs

引用

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY 2005年第8期56卷 947-953页

作者： Holthaus, O Rajendran, C Univ Passau Fac Business Adm & Econ Dept Prod Operat & Logist Management D-94032 Passau Germany Indian Inst Technol Madras 600036 Tamil Nadu India

The problem of scheduling on a single machine is considered in this paper with the objective of minimizing the sum of weighted tardiness of jobs. A new ant-colony optimization (ACO) algorithm, called fast ACO (FACO), is proposed and analysed for solving the single-machine scheduling problem. By considering the benchmark problems available in the literature for analysing the performance of algorithms for scheduling on a single machine with the consideration of weighted tardiness of jobs, we validate the appropriateness of the proposed local-search schemes and parameter settings used in the FACO. We also present a comparison of the requirements of CPU time for solving the single-machine total-weighted tardiness problem by the FACO and the existing algorithms.

关键词： single machine scheduling total-weighted tardiness ant-colony algorithm

来源：评论

学校读者我要写书评

暂无评论

Research on Routing Protocol for Wireless Sensor Network Based on ant-colony algorithm

Research on Routing Protocol for Wireless Sensor Network Bas...

引用

2nd International Conference on Information Technology and Management Innovation (ICITMI 2013)

作者： Sang, Lei Long, Duo Jilin Business & Technol Coll Dept Informat Engn Changchun Peoples R China Changchun Univ Sci & Technol Sch Mech & Elect Engn Changchun Peoples R China

ISBN: (纸本)9783037858646

Routing protocol is mainly responsible for seeking optimized path between source node and destination node and forwarding data package along the optimized path in a right way, which is a core link in wireless sensor network. In this thesis, a research on WSN routing algorithm based on ant-colony algorithm is done, targeting the features of WSN and on the basis of the analysis of classic routing protocol. Comparison and analysis of the path and convergence rate of cluster head node are done by means of emulated analysis, which is to some extent innovative and significant to research.

关键词： Wireless Sensor Network Routing Protocol ant-colony algorithm BWAS algorithm

来源：评论

学校读者我要写书评

暂无评论

An Improved ant-colony algorithm Based on Cloud Model Theory

An Improved Ant-colony Algorithm Based on Cloud Model Theory

引用

International Conference on Smart Materials and Intelligent Systems

作者： Wei, Xian-Min Weifang Univ Comp & Commun Engn Sch Weifang Peoples R China

This paper studies one method of cloud model to effectively limit the using ant-colony algorithm into local optimal solution, and experimental results show that this ant-colony algorithm can improve the speed of globa... 详细信息

ISBN: (纸本)9780878492237

关键词： cloud model ant-colony algorithm association rules

来源：评论

学校读者我要写书评

暂无评论

引用

13th International Conference on Computer Supported Cooperative Work in Design

作者： Zhang, Yi Li, Xiaoping Wang, Qian Zhu, Jie Southeast Univ Minist Educ Chaina Sch Engn & Comp Sci Key Lab Comp Network & Informat Integrat Nanjing 210096 Peoples R China

ISBN: (纸本)9781424435340

In the paper, a similarity based ant-colony algorithm (SACO) is proposed for the permutation flowshop scheduling problems with total flowtime minimization, which is known as NP-hard. By applying the space mapping method which is testified to be reasonable, it is proved theoretically that the deposit factor p has hardly impact on the ACO evolutionary availability, and p = 0.5 is reasonable for the ACO. Similarity is defined to discover the promising sequence for solution improvement. A new solution construction method is proposed, which is stated to be better than that of another very effective ant-colony algorithm. Experimental results show that SACO outperforms the other compared seven algorithms, including three rather recent effective algorithms and four famous ant-colony algorithms. The similarity indeed helps the SACO to find the promising sequence for solution improvement, which makes the SACO be effective.

关键词： ant-colony algorithm Similarity Total flowtime Permutation flowshop Scheduling

来源：评论

学校读者我要写书评

暂无评论

Automatic fault extraction using a modified ant-colony algorithm

引用

JOURNAL OF GEOPHYSICS AND ENGINEERING 2013年第2期10卷 025009-025009页

作者： Zhao, Junsheng Sun, Sam Zandong China Univ Petr Lab Integrat Geol & Geophys Beijing 102249 Peoples R China

The basis of automatic fault extraction is seismic attributes, such as the coherence cube which is always used to identify a fault by the minimum value. The biggest challenge in automatic fault extraction is noise, including that of seismic data. However, a fault has a better spatial continuity in certain direction, which makes it quite different from noise. Considering this characteristic, a modified ant-colony algorithm is introduced into automatic fault identification and tracking, where the gradient direction and direction consistency are used as constraints. Numerical model test results show that this method is feasible and effective in automatic fault extraction and noise suppression. The application of field data further illustrates its validity and superiority.

关键词： ant-colony algorithm fault auto extraction gradient direction direction consistency

来源：评论

学校读者我要写书评

暂无评论

A modified ant-colony optimisation algorithm to minimise the completion time variance of jobs in flowshops

引用

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 2012年第20期50卷 5698-5706页

作者： Krishnaraj, J. Pugazhendhi, S. Rajendran, C. Thiagarajan, S. Indian Inst Technol Dept Management Studies Madras 600036 Tamil Nadu India Krishnasamy Coll Engn & Technol Dept Mech Engn Cuddalore India Annamalai Univ Dept Mfg Engn Annamalainagar India Sri Nandhanam Coll Engn & Technol Tirupathur India

In this work, the flowshop scheduling problem is considered with the objective of minimising the completion-time variance (CTV) of jobs, and an ant colony Optimisation (ACO) algorithm is presented. Two implementations of the Modified ant colony Optimisation algorithm (MACO-I and MACO-II) are proposed to solve the permutation flowshop scheduling problem. The proposed ant-colony-algorithm implementations have been tested on 90 benchmark flowshop scheduling problems. The solutions yielded by the proposed MACO implementations are compared with various algorithms and with the best CTV of jobs reported in the literature. The proposed MACO implementations are found to perform very well in minimising the chosen performance measure.

关键词： scheduling flowshop completion-time variance ant-colony algorithm

来源：评论

学校读者我要写书评

暂无评论

An ant-colony optimization algorithm for minimizing the completion-time variance of jobs in flowshops

引用

INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS 2006年第2期101卷 259-272页

作者： Gajpal, Y Rajendran, C Indian Inst Technol Dept Management Studies Madras 600036 Tamil Nadu India

The problem of scheduling in permutation flowshops with the objective of minimizing the completion-time variance of jobs is considered and solved by making use of ant-colony optimization (ACO) algorithms. ACO is an algorithmic approach, inspired by the foraging behavior of real ants, which can be applied to solve combinatorial optimization problems. A new ant-colony algorithm (NACO) has been developed in this paper to solve the flowshop, scheduling problem. The objective is to minimize the completion-time variance of jobs. Two existing ant-colony algorithms and the proposed ant-colony algorithm have been compared with an existing heuristic for scheduling with the objective of minimizing the completion-time variance of jobs. It is found that the proposed ant-colony algorithm gives promising and better results, on an average, as compared to those solutions given by the existing ant-colony algorithms and the existing heuristic for the permutation flowshop scheduling problem under study. (c) 2005 Elsevier B.V. All rights reserved.

关键词： scheduling flowshop completion-time variance ant-colony algorithm

来源：评论

学校读者我要写书评

暂无评论

An Improved ant-colony Clustering algorithm Based On The Innovational Distance Calculation Formula

An Improved Ant-Colony Clustering Algorithm Based On The Inn...

引用

3rd International Conference on Knowledge Discovery and Data Mining

作者： Li, Shanfei Yang, Kewei Huang, Wei Tan, Yuejin Natl Univ Def Technol Coll Informat Syst & Management Changsha 410073 Hunan Peoples R China

ISBN: (纸本)9780769539232

Focused on the disadvantage of classical Euclidian distance in data clustering analysis, we propose an improved distance calculation formula, which describes the local compactness and global connectivity between data points. Furthermore, we improve ant-colony clustering algorithm by using the improved distance calculation formula. Theoretical analysis and experiments show that this method is more efficient and has the ability to identify complex non-convex clusters.

关键词： clustering ant-colony algorithm distance calculation connectivity

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：