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

International Conference on Computer and Automation Engineering

作者： Dianwu Gao Hao Wang The Department of Computer and Information Engineering The Department of Electrical and Information Engineering

ISBN: (纸本)9781424455690

On the basis of analyzing, comparing the routing protocol and learning from the advanced thinking, the author proposes the algorithm of wireless sensor network routing based on gradient and the residual energy ant algorithm. Using the character that ant algorithm is simple and easy to realize, works in the part, and it integrates link quality into pheromone and supports many links to design the wireless sensor network routing algorithm based on the gradient and the residual energy ant algorithm. Through the simulation test of the routing algorithm, the test proves that the algorithm achieves design objectives of the wireless sensor network routing algorithm.

关键词： WSN Routing algorithm ant-colony algorithm Gradient Pheromone

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Clustering Approach for Wireless Sensor Networks Using Spatial Data Correlation and ant-colony Optimization

Clustering Approach for Wireless Sensor Networks Using Spati...

引用

International Conference on Networks Security, Wireless Communications and Trusted Computing

作者： Zhang, Chongqing Xu, Qiang Shandong Univ Sci & Technol Dept Network Engn Qingdao Peoples R China

ISBN: (纸本)9780769536101

This paper studies how to exploit spatial data correlations to group sensor nodes into clusters of high data aggregation efficiency. The approach proposed in this paper first selects a set of cluster heads that form a dominating set. Then a set of nodes selected by ant-colony algorithm are added to the above dominating set to make all the nodes in the set connected. Simulation results demonstrate the effectiveness and efficiency of the designed approach.

关键词： clustering wireless sensor networks dominating set 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

来源：评论

学校读者我要写书评

暂无评论

ant colony optimization for the job rotation scheduling problem

引用

APPLIED MATHEMATICS AND COMPUTATION 2008年第1-2期201卷 149-160页

作者： Seckiner, Serap Ulusam Kurt, Mustafa Gaziantep Univ Fac Engn Dept Ind Engn TR-27310 Gaziantep Turkey Gazi Univ Fac Engn & Architecture Dept Ind Engn TR-06570 Ankara Turkey

This paper seeks to explore the effectiveness of ant colony optimization for solving the job rotation scheduling problem. The problem of scheduling in job rotation is considered with the objective of minimizing the workload of jobs. The performances of the proposed two ant-colony algorithms are evaluated based on integer programming and simulated annealing solutions. Results show that the ant-colony algorithm implementation is able to compete effectively with the best known solution to the problem. (C) 2007 Elsevier Inc. All rights reserved.

关键词： job rotation scheduling workload integer programming ant-colony algorithm

来源：评论

学校读者我要写书评

暂无评论

Two ant-colony algorithms for minimizing total flowtime in permutation flowshops

引用

COMPUTERS & INDUSTRIAL ENGINEERING 2005年第4期48卷 789-797页

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

The problem of scheduling in flowshops with the objective of minimizing total flowtime is studied. For solving the problem two ant-colony algorithms are proposed and analyzed. The first algorithm refers to some extent to ideas by Stuetzle [Stuetzle, T. (1998). An ant approach for the flow shop problem. In: Proceedings of the sixth European Congress on intelligent techniques and soft computing (EUFIT '98) (Vol. 3) (pp. 1560-1564). Aachen: Verlag Mainz] and Merkle and Middendorf [Merkle, D., & Middendorf, M. (2000). An ant algorithm with a new pheromone evaluation rule for total tardiness problems. In: Proceedings of the EvoWorkshops 2000, lecture notes in computer science 1803 (pp. 287-296). Berlin: Springer]. The second algorithm is newly developed. The proposed ant-colony algorithms have been applied to 90 benchmark problems taken from Taillard [Taillard, E. (1993). Benchmarks for basic scheduling problems. European Journal of Operational Research, 64, 278-285]. A comparison of the solutions yielded by the ant-colony algorithms with the best heuristic solutions known for the benchmark problems up to now, as published in extensive studies by Liu and Reeves [Liu, J., & Reeves, C.R. (2001)]. Constructive and composite heuristic solutions to the P//Sigma C-i scheduling problem. European Journal of Operational Research, 132, 439-452, and Rajendran and Ziegler [Rajendran, C., & Ziegler, H. (2004). ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs. European Journal of Operational Research, 155, 426-438], shows that the presented ant-colony algorithms are better, on an average, than the heuristics analyzed by Liu and Reeves and Rajendran and Ziegler. (c) 2004 Elsevier Ltd. All rights reserved.

关键词： flowshop scheduling total flowtime ant-colony algorithm

来源：评论

学校读者我要写书评

暂无评论

Two ant-colony algorithms for minimizing total flowtime in permutation flowshops

Two ant-colony algorithms for minimizing total flowtime in p...

引用

30th International Conference on Computers and Industrial Engineering

关键词： flowshop scheduling total flowtime ant-colony algorithm

来源：评论

学校读者我要写书评

暂无评论

ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2004年第2期155卷 426-438页

作者： Rajendran, C Ziegler, H Indian Inst Technol Dept Humanities & Social Sci Ind Engn & Mangement Div Madras 600036 Tamil Nadu India Univ Passau Fac Business Adm & Econ Dept Operat Prod & Logist Management D-94032 Passau Germany

The problem of scheduling in permutation flowshops is considered with the objective of minimizing the makespan, followed by the consideration of minimization of total flowtime of jobs. Two ant-colony optimization algorithms are proposed and analyzed for solving the permutation flowshop scheduling problem. The first algorithm extends the ideas of the ant-colony algorithm by Stuetzle [Proceedings of the 6th European Congress on Intelligent Techniques and Soft Computing (EUFIT '98), vol. 3, Verlag Mainz, Aachen, Germany, 1998, p. 1560], called max-min ant system (MMAS), by incorporating the summation rule suggested by Merkle and Middendorf [Proceedings of the EvoWorkshops 2000, Lecture Notes in Computer Science No. 1803, Springer-Verlag, Berlin, 2000, p. 287] and a newly proposed local search technique. The second ant-colony algorithm is newly developed. The proposed ant-colony algorithms have been applied to 90 benchmark problems taken from Taillard [European Journal of Operational Research 64 (1993) 278]. First, a comparison of the solutions yielded by the MMAS and the two ant-colony algorithms developed in this paper, with the heuristic solutions given by Taillard [European Journal of Operational Research 64 (1993) 278] is undertaken with respect to the minimization of makespan. The comparison shows that the two proposed ant-colony algorithms perform better, on an average, than the MMAS. Subsequently, by considering the objective of minimizing the total flowtime of jobs, a comparison of solutions yielded by the proposed ant-colony algorithms with the best heuristic solutions known for the benchmark problems, as published in an extensive study by Liu and Reeves [European Journal of Operational Research 132 (2001) 439], is carried out. The comparison shows that the proposed ant-colony algorithms are clearly superior to the heuristics analyzed by Liu and Reeves. For 83 out of 90 problems considered, better solutions have been found by the two proposed ant-colony algori

关键词： flowshop scheduling makespan total flowtime heuristics ant-colony algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：