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

1st International Conference on Swarm Intelligence

作者： Lu, Shibao Meng, Weijuan Li, Liang China Univ Min & Technol Beijing Peoples R China Tianjin Univ Sci & Technol Tianjin Peoples R China Qingdao Technolog Univ Sch Civil Engn Qingdao Peoples R China

ISBN: (纸本)9783642134975

Although the original harmony search algorithm has been widely used in many fields such as numerical optimization, automatic control, there are no theories or formulae for the determination of values for parameters used in this algorithm yielding different assigned values based on different researchers' experiences or some researchers merely adopting recommendation from published references. The values are dynamic determined in consideration of the convergence degree of current individuals used in harmony search algorithm. Two parameters for the definition of convergence degree are adopted in this study. The improved harmony search algorithm has been found to be efficient for the location of critical slip surface than original one from the comparison of results obtained by original algorithm and by the proposed algorithm this study.

关键词： harmony search algorithm critical slip surface dynamic adaptation factor of safety

来源：评论

学校读者我要写书评

暂无评论

QoS-aware Selection of Web Service Composition Based on harmony search algorithm

QoS-aware Selection of Web Service Composition Based on Harm...

引用

12th International Conference on Advanced Communication Technology (ICACT) - lCT for Green Growth and Sustainable Development

作者： Jafarpour, Nastaran Khayyambashi, Mohammad Reza Univ Isfahan Fac Engn Dept Comp Esfahan Iran

ISBN: (纸本)9788955191455

Designing of the composite services with desired quality is an interesting challenge of the web service environments. In a QoS-aware web service composition, appropriate services with acceptable quality are selected among several function-equivalent candidate services. The selection is performed in such a way that creates a composition with optimal quality which can satisfy user's quality constraints. In this paper, the problem of QoS-aware selection of web service composition is modeled as an optimization problem. Then the harmony search algorithm is adopted to find an optimal or near-optimal composition which can satisfy local and global user's constraints on quality attributes. The proposed method is a rapid and lightweight approach which can be applied to large service compositions with many service candidates.

关键词： Web service composition Quality-of-Service harmony search algorithm Global optimization Workflow

来源：评论

学校读者我要写书评

暂无评论

An Energy Efficient harmony search Based Routing algorithm for Small-Scale Wireless Sensor Networks 17

An Energy Efficient Harmony Search Based Routing Algorithm f...

引用

IEEE 17th International Conference on Computational Science and Engineering (CSE)

作者： Zeng, Bing Dong, Yan Huazhong Univ Sci & Technol Sch Mech Sci & Engn Wuhan Peoples R China Huazhong Univ Sci & Technol Dept Elect & Informat Engn Wuhan Peoples R China

ISBN: (纸本)9781479979813

With the development of economy, technology and the continuous improvement of living standards, the application scopes of Small-scale Wireless Sensor Networks become wider and wider. In Wireless Sensor Networks consisting of sensor nodes with limited energy capabilities, energy efficiency is critical for extending the lifetime of networks, which is the most important goal for routing algorithms. During recent years, many energy efficient routing approaches based on intelligent algorithms such as Ant Colony Optimization, Particle Swarm Optimization have been proposed for wireless sensor networks to balance the energy consumption of networks and prolong the network lifetime. This paper proposes a new energy aware routing approach for small-scale wireless sensor networks, which is based on the harmony search algorithm (a popular meta-heuristic for optimization) and a new objective function model with energy efficiency. Part of the charm of the proposed routing algorithm are the encoding technology of harmony supporting for different dimension and the generation method of a new harmony. The detailed descriptions and performance test results of the proposed approach are included. The experimental results clearly show the great advantages of the new routing algorithm for small-scale wireless sensor networks.

关键词： Wireless Sensor Networks Small-scale Routing algorithms Energy efficiency harmony search algorithm

来源：评论

学校读者我要写书评

暂无评论

Solving Pressure Vessel Design Problems by an Effective Global harmony search algorithm

Solving Pressure Vessel Design Problems by an Effective Glob...

引用

22nd Chinese Control and Decision Conference

作者： Gao, Liqun Zou, Dexuan Ge, Yanfeng Jin, Wenjing Northeastern Univ Sch Informat Sci & Engn Shenyang 110004 Peoples R China

ISBN: (纸本)9781424451821

We use an effective global harmony search algorithm (EGHS) to solve two kinds of pressure vessel design problems. In general, the two problems are formulated as mixed-integer non-linear programming problems with several constraints. The EGHS combines harmony search algorithm (HS) with concepts from the swarm intelligence of particle swarm optimization algorithm (PSO) to solve the two optimization problems. The EGHS algorithm has been applied to two typical problems with results better than previously reported. The results have demonstrated that the EGHS has strong convergence and capacity of space exploration on solving pressure vessel design problems.

关键词： Effective global harmony search algorithm Pressure vessel design harmony search algorithm Particle swarm optimization algorithm Convergence

来源：评论

学校读者我要写书评

暂无评论

Optimum Detailed Design of Reinforced Concrete Continuous Beams using the harmony search algorithm

Optimum Detailed Design of Reinforced Concrete Continuous Be...

引用

10th International Conference on Computational Structures Technology

作者： Akin, A. Saka, M. P. Middle East Tech Univ Dept Engn Sci Ankara Turkey Univ Bahrain Dept Civil Engn Isa Town Bahrain

ISBN: (纸本)9781905088386

Design optimization of reinforced concrete structures is more challenging than that of steel structures due to the complexity associated with reinforcement design. In this study, optimum design algorithm is presented for reinforced concrete continuous beams. The design variables are selected as the width and the depth of beams in each span, the diameter and the number of longitudinal reinforcement bars along span and supports, and the diameter of ties. The design constraints are implemented from ACI 318-05 which covers the flexural and shear strength, serviceability, the minimum and maximum steel percentage for flexural and shear reinforcement, the spacing requirements for the stirrups and the upper and lower bound requirements for the width and the depth of the beam section. The objective function is considered as the total cost of continuous beam which includes the cost of concrete, formwork and reinforcing steel bars. The cost of any component is inclusive of material, fabrication and labour. The design algorithm automatically updates the value of the dead load which includes self-weight of the continuous beam depending on the cross-sectional dimensions during the design cycles. The optimum design problem formulated according to ACI 318-05 with the design variables mentioned above turns out to be a discrete programming problem. The harmony search algorithm (HS) is utilized to obtain its solution. harmony search algorithm has been applied to various engineering design optimization problems and is found quite effective in finding the optimum solutions. It is quite simple and has few parameters to initialize. It needs relatively less number of function evaluations to reach the optimum solution. Due to these advantages, harmony search method is used to obtain the solution of the design problem. Numbers of design examples taken from the literature are included to demonstrate the efficiency and robustness of the optimum design algorithm presented.

关键词： structural optimization harmony search algorithm continuous beams reinforced concrete cost optimization discrete variables

来源：评论

学校读者我要写书评

暂无评论

A Novel Discrete harmony search algorithm for Scheduling Lot-streaming Flow Shops

A Novel Discrete Harmony Search Algorithm for Scheduling Lot...

引用

22nd Chinese Control and Decision Conference

作者： Pan, Quan-Ke Duan, Jun-hua Liang, J. J. Gao, Kaizhou Li, Junqing Liaocheng Univ Coll Comp Sci Liaocheng 252059 Peoples R China Zhengzhou Univ Sch Elect Engn Zhengzhou Peoples R China

ISBN: (纸本)9781424451821

This paper proposes a novel discrete harmony search (DHS) algorithm to minimize makespan for a lot-streaming flow shop scheduling problem with sequence dependent setup times. Unlike the traditional harmony search (HS) algorithm, the proposed OHS algorithm utilizes job permutations to represent harmonies and applies a job-permutation-based improvisation to generate new harmonies. To enhance the algorithm's searching ability, an effective initialization scheme based on the NEH heuristic is developed to construct an initial harmony memory with certain quality and diversity, and an efficient local search algorithm based on the insert neighborhood structures is fused to stress the local exploitation. Extensive computational simulations and comparisons are provided, which demonstrate the effectiveness of the proposed DHS against the best performing algorithms from the literature.

关键词： Flow shop scheduling Lot-streaming harmony search algorithm Makespan

来源：评论

学校读者我要写书评

暂无评论

Optimum Design of Concrete Cantilever Retaining Walls using the harmony search algorithm

Optimum Design of Concrete Cantilever Retaining Walls using ...

引用

10th International Conference on Computational Structures Technology

作者： Akin, A. Saka, M. P. Middle East Tech Univ Dept Engn Sci Ankara Turkey Univ Bahrain Dept Civil Engn Isa Town Bahrain

ISBN: (纸本)9781905088386

Optimum cost design of reinforced concrete cantilever retaining walls with harmony search algorithm is presented in this paper. The reinforced concrete cantilever retaining wall is the most common type among the retaining wall structures. In the formulation of the optimum design problem the height and thickness of stem, length of toe projection and the thickness of stem at base level, the length and thickness of base, the depth and thickness of key and the distance from toe to the key are treated as design variables. The values of these design variables are required to be selected from a design pool due to practical reasons which contains list of discrete numbers starting from the minimum value and increasing with a certain increment up to the maximum value for each variable. The design constraints are implemented according to the provisions of ACI 318-05. The optimum design satisfies the factor of safety for failure modes, strength, serviceability and other required limitations to attain practically acceptable shapes. The main target of the problem is to explore the conditions supporting the backfill safely, and to ensure that both the structure and the soil surrounding do not fail and that the deformations take place are within acceptable limits. The objective function is taken as the overall cost of the retaining wall. The optimum design problem formulated according to ACI 318-05 turns out to be a discrete programming problem. The solution of the design problem is obtained by using the harmony search algorithm (HS) which is one of the recent additions to metaheuristic techniques. The HS algorithm does not require any initial values for the design variables and uses a random search instead of a gradient search, so derivative information is unnecessary. In addition, harmony search algorithm uses few parameters which are initially specified and consists of simple steps which make it easy to implement. Number of design examples are presented to demonstrate the effici

关键词： structural optimization harmony search algorithm cantilever retaining walls reinforced concrete cost optimization discrete variables

来源：评论

学校读者我要写书评

暂无评论

An Enhanced harmony search Method for Bangla Handwritten Character Recognition Using Region Sampling 2

An Enhanced Harmony Search Method for Bangla Handwritten Cha...

引用

IEEE 2nd International Conference on Recent Trends in Information Systems (ReTIS)

作者： Sarkhel, Ritesh Saha, Amit K. Das, Nibaran Jadavpur Univ Comp Sci & Engn Dept Kolkata 700032 India

ISBN: (纸本)9781479983490

Identification of minimum number of local regions of a handwritten character image, containing well-defined discriminating features which are sufficient for a minimal but complete description of the character is a challenging task. A new region selection technique based on the idea of an enhanced harmony search methodology has been proposed here. The powerful framework of harmony search has been utilized to search the region space and detect only the most informative regions for correctly recognizing the handwritten character. The proposed method has been tested on handwritten samples of Bangla Basic, Compound and mixed (Basic and Compound characters)characters separately with SVM based classifier using a longest run based feature-set obtained from the image sub-regions formed by a CG based quad-tree partitioning approach. Applying this methodology on the above mentioned three types of datasets, respectively43.75%, 12.5% and 37.5% gains have been achieved in terms of region reduction and 2.3%, 0.6% and 1.2% gains have been achieved in terms of recognition accuracy. The results show a sizeable reduction in the minimal number of descriptive regions as well a significant increase in recognition accuracy for all the datasets using the proposed technique. Thus the time and cost related to feature extraction is decreased without dampening the corresponding recognition accuracy.

关键词： Feature selection Region space Region Sampling Handwritten character recognition harmony search algorithm

来源：评论

学校读者我要写书评

暂无评论

An Efficient Hybrid algorithm Based on HS and SFLA

引用

INTERNATIONAL JOURNAL OF PATTERN RECOGNITION AND ARTIFICIAL INTELLIGENCE 2016年第5期30卷 1659012-1659012页

作者： Ouyang, Aijia Peng, Xuyu Liu, Yanbin Fan, Lilue Li, Kenli Zunyi Normal Coll Dept Comp & Informat Sci Zunyi 563002 Peoples R China Guangxi High Sch Key Lab Complex Syst & Computat Nanning 530006 Peoples R China Hunan Univ Coll Informat Sci & Engn Changsha 410082 Hunan Peoples R China Natl Supercomp Ctr Changsha Changsha 410082 Hunan Peoples R China

When used for optimizing complex functions, harmony search (HS) and shuffled frog leaping algorithm (SFLA) algorithm tend to easily get trapped into local optima and result in low convergence precision. To overcome such shortcomings, a hybrid mechanism of selective search by combining HS algorithm and SFLA algorithm is as well proposed. An HS-SFLA algorithm is designed by taking the advantages of HS and SFLA algorithms. The hybrid algorithm of HS-SFLA is adopted for dealing with complex function optimization problems, the experimental results show that HS-SFLA outperforms other state-of-the-art intelligence algorithms significantly in terms of global search ability, convergence speed and robustness on 80% of the benchmark functions tested. The HS-SFLA algorithm could directly be applied to all kinds of continuous optimization problems in the real world.

关键词： harmony search algorithm shuffled frog leaping algorithm hybrid mechanism optimization

来源：评论

学校读者我要写书评

暂无评论

A hybrid backtracking search optimization algorithm for nonlinear optimal control problems with complex dynamic constraints

引用

Neurocomputing 2016年 186卷 182-194页

作者： Zikang Su Honglun Wang Peng Yao School of Automation Science and Electrical Engineering Beihang University 100191 Beijing China Honors College of Beihang University 100191 Beijing China The Science and Technology on Aircraft Control Laboratory Beihang University 100191 Beijing China

Nonlinear optimal control (NOC) problem with complex dynamic constraints (CDC) is difficult to compute even with direct method. In this paper, a hybrid two-stage approach integrating an improved backtracking search optimization algorithm (IBSA) with the hp-adaptive Gauss pseudo-spectral methods (hpGPM) is proposed. Firstly, BSA is improved to enhance its convergent speed and the global search ability, by adopting the harmony search strategy and an adaptive amplitude control factor with individual optimum fitness feedback. Then, at the beginning stage of the hybrid search process, an initialization generator is constructed using IBSA to find a near optimum solution. When the change in fitness function approaches to a predefined value which is small enough, the search process is replaced by hpGPM to accelerate the search process and find an accurate solution. By this way, the hybrid algorithm is able to find a global optimum more quickly and accurately. Two NOC problems with CDC are examined using the proposed algorithm, and the corresponding Monte Carlo simulations are conducted. The comparison results show the hybrid algorithm achieves better performance in convergent speed, accuracy and robustness.

关键词： Backtracking search optimization algorithm Hp-adaptive gauss pseudospectral methods harmony search algorithm Nonlinear optimal control

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：