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

ant algorithm for modifying an inconsistent pairwise weighting matrix in an analytic hierarchy process

NEURAL COMPUTING & APPLICATIONS 2015年第2期26卷 313-327页

作者： Girsang, Abba Suganda Tsai, Chun-Wei Yang, Chu-Sing Natl Cheng Kung Univ Dept Elect Engn Inst Comp & Commun Engn Tainan 70101 Taiwan Chia Nan Univ Pharm & Sci Dept Appl Informat & Multimedia Tainan Taiwan

One important issue in the analytic hierarchy process (AHP) is confirming the consistency of comparison matrix to verify the logical respondent opinion. As inconsistent comparison matrix cannot be used as reference to make decisions, this paper proposes a method using an ant algorithm to modify an inconsistent pairwise weight matrix to be consistent in AHP, called antAHP. This method employs the matrix element as the path in an ant colony optimization to construct the tour. By laying pheromone information on their path, the ants can find the optimal matrix (or tour), which satisfies the consistency and closer to the original judgment of the decision makers. The experimental results demonstrate that the proposed algorithm is able to make consistent matrices, as well as minimize the difference index.

关键词： ant algorithm Inconsistent matrix Pairwise weight matrix Consistent ratio

来源：评论

学校读者我要写书评

暂无评论

Application of an ant algorithm for layout optimization of tree networks

引用

ENGINEERING OPTIMIZATION 2006年第3期38卷 353-369页

作者： Afshar, Mohammad H. Marino, Miguel A. Iran Univ Sci & Technol Dept Civil Engn Tehran 16844 Iran Univ Calif Davis Dept Civil & Environm Engn Biol & Agr Engn & Hydrol Program Davis CA 95616 USA

This article presents an application of the ant algorithm to the layout optimization of tree networks. Two different formulations are used to represent the layout optimization problem of tree networks in the proper form required for the application of the ant algorithm. In the first formulation, each link of the base graph, from which the optimum layout is to be selected, is considered as the decision points of the problem. The ants are then required to choose from two options of zero and one, available at each decision point, where the zero option represents the no pipe option for the link. This formulation leads to a very large search space dominated by the infeasible solutions. In the second approach, the network nodes are considered as the decision points of the problem at which the ants are required to choose any of the available links which are provided by a tree-growing algorithm. This formulation leads to a very small search space compared to the first algorithm as each ant is now forced to create a feasible solution. This approach fully exploits the sequential nature of the ant algorithm in building solutions, which is believed to be one of the main advantages of ant algorithms compared to other general heuristics. The proposed methods are applied to find the optimal layout of three benchmark examples in the literature and the results are presented and compared to the existing results. The results clearly reveal the superiority of the ant algorithm and in particular the second formulation to other global optimization methods including genetic algorithms (GAs) for the problems considered.

关键词： ant algorithm tree networks layout optimization

来源：评论

学校读者我要写书评

暂无评论

Isomorphism identification for epicyclic gear mechanism based on mapping property and ant algorithm

引用

ENGINEERING WITH COMPUTERS 2007年第1期23卷 49-54页

作者： Yang, Ping Pei, Zhihua Liao, Ningbo Yang, Bing Jiangsu Univ Sch Mech Engn Zhenjiang 212013 Peoples R China Huihua Vocat & Tech Coll Dept Comp Huihua 41800 Peoples R China

To achieve computer-aided design for mechanism, one method that can be applied is graph theory. During the process of kinematic structure enumeration using graph theory, isomorphism identification of graphs is an important and complicated problem. The problem is known to be NP-complete problem. It is very important to improve the isomorphism identification efficiency and reliability. The objective of this research work is to use ant algorithm to improve the isomorphism identification efficiency and reliability for epicyclic gear mechanism. Based on mapping property between graphs, the isomorphism identification problem can be changed into a matrix operation problem. Two graphs must be isomorphism if the two matrixes of the two graphs can be exactly by exchanging their certain rows and columns, whereas show the two graphs must be non-isomorphic. A mixed model was developed for isomorphism identification by integrating the ant algorithm and mapping property between graphs. The gratifying results can be achieved while parameters are selected in appropriate situation by using the model. Finally, a computer program has been developed in Visual C++. Some examples confirm the validity of the model. The work will be a reliable isomorphism identification algorithm for intelligent CAD of epicyclic gear mechanism.

关键词： isomorphism identification graph adjacent matrix epicyclic gear mechanism mapping property ant algorithm intelligent CAD

来源：评论

学校读者我要写书评

暂无评论

ant algorithm Applied in the Minimal Cost Maximum Flow Problem

引用

4th International Conference on Intelligent Computing

作者： Xie, Min Gao, Lixin Guan, Haiwa Wenzhou Univ Inst Operat Res & Control Sci Zhejiang 325000 Peoples R China

ISBN: (纸本)9783540859833

The minimal cost maximum flow problem is a classical combinational optimization problem. Based on the characteristic of ant algorithm and the minimal cost maximum flow problem, a graph mode is presented to use the ant algorithm to solve the minimal cost maximum flow problem. Simulation results show that the algorithm can efficiently solve minimal cost maximum flow problem in a relatively short time.

关键词： ant algorithm minimal cost maximum flow problem directed network

来源：评论

学校读者我要写书评

暂无评论

A GIS supported ant algorithm for the linear feature covering problem with distance constraints

引用

DECISION SUPPORT SYSTEMS 2006年第2期42卷 1063-1075页

作者： Huang, Bo Liu, Nan Chandramouli, Magesh Univ Calgary Dept Geomat Engn Calgary AB T2N 1N4 Canada Univ N Carolina Dept Stat & Operat Res Chapel Hill NC 27599 USA Feng Chia Univ GIS Res Ctr Taichung 407 Taiwan

This paper analyzes a linear feature covering problem (LFCP) with distance constraints, and characterizes the problem by a fuzzy multi-objective (MO) optimization model. An integrated approach combining an ant algorithm (LFCP-ant) and a Geographic Information System (GIS) has been devised to solve the LFCP problem in large scale. The efficacy of the proposed approach is demonstrated using a case study of locating new fire stations in Singapore. A GIS has been used to transform the continuous problem into a discrete one, which is then solved using the LFCP-ant. This algorithm employs a two-phase local search to improve both search efficiency and precision. (c) 2005 Elsevier B.V. All rights reserved.

关键词： ant algorithm linear feature covering problem GIS two-phase local search

来源：评论

学校读者我要写书评

暂无评论

A new moving target interception algorithm for mobile robots based on sub-goal forecasting and an improved scout ant algorithm

引用

APPLIED SOFT COMPUTING 2013年第1期13卷 539-549页

作者： Zhu, Qingbao Hu, Jun Henschen, Larry Nanjing Normal Univ Sch Comp Sci Nanjing 210097 Jiangsu Peoples R China Northwestern Univ Evanston IL 60208 USA

It is difficult to make a robot intercept a moving target, whose trajectory and speed are unknown and dynamically changing, in a comparatively short distance when the environment contains complex objects. This paper presents a new moving target interception algorithm in which the robot can intercept such a target by following many short straight line trajectories. In the algorithm, an intercept point is first forecasted assuming that the robot and the target both move along straight line trajectories. The robot rapidly plans a navigation path to this projected intercept point by using the new ant algorithm. The robot walks along the planned path while continuously monitoring the target. When the robot detects that the target has moved to a new grid it will re-forecast the intercept point and re-plan the navigation path. This process will be repeated until the robot has intercepted the moving target. The simulation results have shown that the algorithm is very effective and can successfully intercept a moving target while moving along a relatively short path no matter whether the environment has complex obstacles or not and the actual trajectory of the moving target is a straight line or a complex curve. (C) 2012 Elsevier B. V. All rights reserved.

关键词： Mobile robot Moving target Interception Robot path planning ant algorithm

来源：评论

学校读者我要写书评

暂无评论

Multiobjective optimization of reactor-regenerator system using ant algorithm

引用

PETROLEUM SCIENCE AND TECHNOLOGY 2003年第7-8期21卷 1167-1184页

作者： Shelokar, PS Jayaraman, VK Kulkarni, BD Natl Chem Lab Div Chem Engn Pune 411008 Maharashtra India

This article focuses on the development of a multiobjective optimization algorithm for a tubular reactor-regenerator system with a moving deactivating catalyst. The task is to find the optimal temperature profile along the tubular reactor, catalyst recycle ratio, and the regeneration capacity for maximizing the process profit flux, selectivity, and conversion. A new heuristic technique, viz, ant colony optimization method has been employed to obtain the Pareto optimal set of solutions.

关键词： ant algorithm multiobjective optimization reactorregenerator system

来源：评论

学校读者我要写书评

暂无评论

Penalty adapting ant algorithm: application to pipe network optimization

引用

ENGINEERING OPTIMIZATION 2008年第10期40卷 969-987页

作者： Afshar, M. H. Iran Univ Sci & Technol Dept Civil Engn Tehran Iran

A penalty adapting ant algorithm is presented in an attempt to eliminate the dependency of ant algorithms on the penalty parameter used for the solution of constrained optimization problems. The method uses an adapting mechanism for determination of the penalty parameter leading to elimination of the costly process of penalty parameter tuning. The method is devised on the basis of observation that for large penalty parameters, infeasible solutions will have a higher total cost than feasible solutions and vice versa. The method therefore uses the best feasible and infeasible solution costs of the iteration to adaptively adjust the penalty parameter to be used in the next iteration. The pheromone updating procedure of the max-min ant system is also modified to keep ants on and around the boundary of the feasible search space where quality solutions can be found. The sensitivity of the proposed method to the initial value of the penalty parameter is investigated and indicates that the method converges to optimal or near-optimal solutions irrespective of the initial starting value of the penalty parameter. This is significant as it eliminates the need for sensitivity analysis of the method with respect to the penalty factor, thus adding to the computational efficiency of ant algorithms. Furthermore, it is shown that the success rate of the search algorithm in locating an optimal solution is increased when a self-adapting mechanism is used. The presented method is applied to a benchmark pipe network optimization problem in the literature and the results are presented and compared with those of existing algorithms.

关键词： penalty adapting ant algorithm pipe networks optimal design

来源：评论

学校读者我要写书评

暂无评论

Optimal design of truss structures using ant algorithm

引用

STRUCTURAL AND MULTIDISCIPLINARY OPTIMIZATION 2008年第4期36卷 365-379页

作者： Luh, Guan-Chun Lin, Chun-Yi Tatung Univ Dept Mech Engn Taipei 104 Taiwan

An ant algorithm, consisting of the ant System and API (after "apicalis" in Pachycondyla apicalis) algorithms, was proposed in this study to find optimal truss structures to achieve minimum weight objective under stress, deflection, and kinematic stability constraints. A two-stage approach was adopted in this study;first, the topology of the truss structure was optimized from a given ground structure employing the ant System algorithm due to its discrete characteristic, and then the size and/or shape of member was optimized utilizing the API algorithm. The effectiveness of the proposed ant algorithm was evaluated through numerous different 2-D and 3-D truss-structure problems. The proposed algorithm was observed to find truss structures better than those reported in the literature. Moreover, multiple different truss topologies with almost equal overall weights can be found simultaneously.

关键词： ant algorithm ant system API algorithm truss-structure optimization

来源：评论

学校读者我要写书评

暂无评论

ant algorithm for smart water network partitioning

Ant algorithm for smart water network partitioning

引用

12th International Conference on Computing-and-Control-for-the-Water-Industry (CCWI)

作者： Di Nardo, A. Di Natale, M. Greco, R. Santonastaso, G. F. Univ Naples 2 Dept Civil Engn I-80014 Aversa CE Italy

Applying ICT devices to WDS makes it possible to introduce also the new concept of Smart WAter Network (SWAN), as a key Smart City subsystem, improving the traditional management of WDS. The possibility of inserting remote-controlled valves and flow meters in a WDS allows to divide a water network into k smaller subsystems, in order to improve the management and protection of WDS. This study proposes a novel technique for water network partitioning based on an ant algorithm that allows to obtain a network partitioning compatible with the hydraulic performance. The technique is applied to a real water network. (C) 2013 The Authors. Published by Elsevier Ltd.

关键词： water network partitioning graph theory district meter area network sectorization ant algorithm multi agents

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：