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

Combined heat and power economic dispatch by harmony search algorithm

INTERNATIONAL JOURNAL OF ELECTRICAL POWER & ENERGY SYSTEMS 2007年第10期29卷 713-719页

作者： Vasebi, A. Fesanghary, M. Bathaee, S. M. T. KN Toosi Univ Technol Dept Elect & Elect Engn Power Syst Res Lab Tehran 19697 Iran Amir Kabir Univ Technol Dept Mech Engn Tehran Iran

The optimal utilization of multiple combined heat and power (CHP) systems is a complicated problem that needs powerful methods to solve. This paper presents a harmony search (HS) algorithm to solve the combined heat and power economic dispatch (CHPED) problem. The HS algorithm is a recently developed meta-heuristic algorithm, and has been very successful in a wide variety of optimization problems. The method is illustrated using a test case taken from the literature as well as a new one proposed by authors. Numerical results reveal that the proposed algorithm can find better solutions when compared to conventional methods and is an efficient search algorithm for CHPED problem. (c) 2007 Elsevier Ltd. All rights reserved.

关键词： economic dispatch combined heat and power harmony search algorithm optimization

来源：评论

学校读者我要写书评

暂无评论

A novel scheme for selection of watermark strength in digital image watermarking based on harmony search algorithm

引用

JOURNAL OF INTELLIGENT & FUZZY SYSTEMS 2015年第5期28卷 2357-2367页

作者： Fattahi, Mohammadreza Latif, Alimohammad Yazd Univ Dept Elect & Comp Engn Yazd Iran

In this paper, selection of watermark strength in digital image using harmony search is presented. In image watermarking procedure, the image is divided into separate blocks and the watermark is embedded in the transform domain via the watermark strength and the inverse transform is carried out. Digital image watermarking has several requirements based on its applications. Transparency and robustness are two important requirements in many applications. These two requirements are in conflict and watermark strength controls them. Decreasing the watermark strength causes higher transparency and lower robustness and vice versa. Having these two features is not possible at the same time, further more it would be time consuming to determine the proper watermark strength by error and trial and using the optimization algorithms is of great importance in this case. The experimental results show that the proposed algorithm selects the proper watermark strength to have suitable transparency and robustness at the same time.

关键词： Digital image watermarking discrete cosine transform harmony search algorithm watermark strength

来源：评论

学校读者我要写书评

暂无评论

Duration based reconfiguration of electric distribution networks using dynamic programming and harmony search algorithm

引用

INTERNATIONAL JOURNAL OF ELECTRICAL POWER & ENERGY SYSTEMS 2012年第1期41卷 1-10页

作者： Shariatkhah, Mohammad-Hossein Haghifam, Mahmoud-Reza Salehi, Javad Moser, Albert Tarbiat Modares Univ Dept Elect Engn Tehran Iran Aachen Tech Univ RWTH IAEW D-52056 Aachen Germany

Feeder reconfiguration is one of the most important tasks for loss reduction and reliability improvement in distribution networks. Most of studies so far have investigated reconfiguration problem as a static problem considering fixed level of loads. This assumptions lead to suboptimal solution because of time-varying nature of loads in distribution networks. The switching operation should be cost effective and the reconfiguration scheme should balance the benefits in system loss reduction and reliability improvement against the costs of switching. Moreover, this is a dynamic problem and switching operations of time intervals over a year are not independent. This paper presents a method to determine annual feeder reconfiguration scheme considering switching costs and time-varying variables such as load profiles. In the first stage of the proposed method, to obtain effective configurations, optimal configuration for each day of year is determined independently using harmony search algorithm (HSA) and graph theory. After determination of effective configurations for the network, in the second stage, year is divided into multi equal periods and considering loss cost, interruption cost and also switching cost from a configuration to another configuration, dynamic programming algorithm (DPA) is used to find the optimum annual reconfiguration scheme. The proposed method has been tested on 95-bus distribution network and the obtained results denote that to have an optimum solution it is necessary to compare operation costs dynamically. (C) 2012 Elsevier Ltd. All rights reserved.

关键词： Distribution network Reconfiguration Dynamic programming harmony search algorithm Graph theory

来源：评论

学校读者我要写书评

暂无评论

Multiobjective Pump Scheduling Optimization Using harmony search algorithm (HSA) and Polyphonic HSA

引用

WATER RESOURCES MANAGEMENT 2013年第5期27卷 1249-1261页

作者： Kougias, Ioannis P. Theodossiou, Nicolaos P. Aristotle Univ Thessaloniki Div Hydraul & Environm Engn Dept Civil Engn Thessaloniki 54124 Greece

harmony search algorithm (HSA) is a metaheuristic method that has attracted the scientific interest since its first presentation in 2001. It is a music inspired method, imitating the music creation process in order to find optimal solutions in complicated problems. HSA's successful application on single - objective optimization problems has resulted to an increasing interest in the implementation of HSA towards multiobjective optimization. The authors have adjusted HSA in order to deal successfully with multi-criteria water management problems. This adjustment has resulted to the creation of Multiobjective - HSA (MO-HSA). In addition, they have designed the multiobjective variant Polyphonic-HSA (Poly-HSA), which is inspired by the independent development of different voices in music and borrows elements from Swarm Intelligence and the single-objective variant Global-Best HSA. In the first part of this paper, both methods are presented in detail. Moreover, the performance of the proposed algorithms is evaluated using standard multiobjective test - functions. ZDT and DTLZ multiobjective tests have been chosen and indicators such as Hypervolume, C - metric and diversity metric - Delta have been used to measure the convergence to the optimal front and the diversity of the solutions obtained by the proposed methods. In the second part, MO-HSA and Poly-HSA have been introduced towards the optimization of a pump scheduling problem. The objectives considered are water supply, pumping cost, electric power peak demand and pump maintenance cost. Both methods converged to non-dominated fronts and provided excellent results which are presented in 3d figures, indicating that these methods can be effectively used in multiobjective water management problems.

关键词： Water management Pump scheduling Multiobjective optimization Pareto dominance harmony search algorithm

来源：评论

学校读者我要写书评

暂无评论

Multi-objective harmony search algorithm for optimal power flow problem

引用

INTERNATIONAL JOURNAL OF ELECTRICAL POWER & ENERGY SYSTEMS 2011年第3期33卷 745-752页

作者： Sivasubramani, S. Swarup, K. S. Indian Inst Technol Madras Dept Elect Engn Madras 600036 Tamil Nadu India

This paper proposes a multi-objective harmony search (MONS) algorithm For optimal power flow (OPF) problem. OPF problem is formulated as a non-linear constrained multi-objective optimization problem where different objectives and various constraints have been considered into the formulation. Fast elitist non-dominated sorting and crowding distance have been used to find and manage the Pareto optimal front. Finally, a fuzzy based mechanism has been used to select a compromise solution from the Pareto set. The proposed MONS algorithm has been tested on IEEE 30 bus system with different objectives. Simulation results are also compared with fast non-dominated sorting genetic algorithm (NSGA-II) method. It is clear from the comparison that the proposed method is able to generate :rue and well distributed Pareto optimal solutions for OPF problem. (c) 2011 Ebevier Ltd. All rights reserved.

关键词： harmony search algorithm Optimal power flow Multi-objective optimization Fuel cost minimization Voltage stability enhancement

来源：评论

学校读者我要写书评

暂无评论

DISPERSED harmony search algorithm FOR MESFET DC AND SMALL SIGNAL MODEL PARAMETER EXTRACTION

引用

INTERNATIONAL JOURNAL OF INNOVATIVE COMPUTING INFORMATION AND CONTROL 2012年第6期8卷 4249-4262页

作者： Sabat, Samrat L. Udgata, Siba K. Coelho, Leandro D. Santos Abraham, Ajth Snasel, Vaclav Univ Hyderabad Sch Phys Hyderabad 500046 Andhra Pradesh India Univ Hyderabad Dept Comp & Informat Sci Hyderabad 500046 Andhra Pradesh India Pontifical Cathol Univ Parana Ind & Syst Engn Grad Program BR-80215901 Curitiba Parana Brazil Machine Intelligence Res Labs Sci Network Innovat Auburn WA 98071 USA VSB Tech Univ Ostrava Ostrava Czech Republic

This paper proposes a variant of harmony search algorithm named as dispersed harmony search (DHS) and its application to extract the drain current (DC) and small signal model parameters of Galium Arsenide (GaAs) metal extended semiconductor field effect transistor (MESFET). DHS algorithm is used to minimize the difference between measured and modeled (i) drain current to extract the DC model parameters and (ii) S-parameters to extract the small signal model parameters. The S-parameters are measured in the frequency range of 500 MHz to 25 GHz with a step of 500 MHz. The measured data are obtained from a fabricated MESFET of gate length 0.7 mu m and gate width of 600 mu m (4 x 150). The performance of DHS algorithm is compared with particle swarm optimization (PSO) and artificial bee colony (ABC) algorithm in terms of quality of solution and execution time to extract the model parameters. Comparison results reveal that the DHS algorithm has better convergence speed and also a robust technique for model parameter extraction compared with PSO and ABC algorithms.

关键词： harmony search algorithm Artificial bee colony algorithm Particle swarm optimization Parameter extraction MESFET DC and small signal model

来源：评论

学校读者我要写书评

暂无评论

Optimized tool path planning for five-axis flank milling of ruled surfaces using geometric decomposition strategy and multi-population harmony search algorithm

引用

APPLIED SOFT COMPUTING 2018年 73卷 547-561页

作者： Yi, Jin Chu, Chih-Hsing Kuo, Chi-Lung Li, Xinyu Gao, Liang Natl Univ Singapore Dept Ind Syst Engn Singapore Singapore Natl Tsing Hua Univ Dept Ind Engn & Engn Management Hsinchu Taiwan Huazhong Univ Sci & Technol Sch Mech Sci & Technol State Key Lab Digital Mfg Equipment & Technol Wuhan 430074 Hubei Peoples R China

Tool path planning is a key to ensure high machining quality and productivity in 5-axis flank milling of ruled surfaces. Previous studies have shown that optimization-driven tool path planning can effectively reduce the geometrical errors on the finished surface. However, to solve the corresponding optimization problem is a challenging task involving a large number of decision variables. This paper proposes a novel approach to generating optimized tool path for 5-axis flank finishing cut based on a geometric decomposition strategy and multi-population harmony search algorithm. The proposed approach geometrically divides the surface to be machined into a number of segments. The tool paths on those sub-surfaces are independently optimized by the multi-population harmony search algorithm. Individual tool paths are then combined together to form a complete one. The test results of representative surfaces show that the proposed approach produces higher machining precision with less computational time than compared previous methods. And the computational time is further reduced by Message passing interface based parallel computing techniques. A detailed analysis is conducted to characterize how the number of divisions affects the optimization results. And the proposed approach also shows good scalability with the increasing number of cutter locations. (C) 2018 Elsevier B.V. All rights reserved.

关键词： Geometric decomposition harmony search algorithm Tool path planning 5-axis machining Flank milling

来源：评论

学校读者我要写书评

暂无评论

Design of a Hybrid Stable Adaptive Fuzzy Controller Employing Lyapunov Theory and harmony search algorithm

引用

IEEE TRANSACTIONS ON CONTROL SYSTEMS TECHNOLOGY 2010年第6期18卷 1440-1447页

作者： Das Sharma, Kaushik Chatterjee, Amitava Rakshit, Anjan W Bengal Univ Technol Kalyani Govt Engn Coll Dept Elect Engn Kalyani 741235 W Bengal India Jadavpur Univ Dept Elect Engn Kolkata 700032 India

This brief proposes hybrid stable adaptive fuzzy controller design procedures utilizing the conventional Lyapunov theory and, the relatively newly devised harmony search (HS) algorithm-based stochastic approach. The objective is to design a self-adaptive fuzzy controller, optimizing both its structures and free parameters, such that the designed controller can guarantee desired stability and simultaneously it can provide satisfactory performance with a high degree of automation in the design process. Two different variants of the hybrid controller are proposed in this work. These variants are implemented for a benchmark simulation case study and real-life experimentation. The results obtained demonstrate the usefulness of the proposed approach.

关键词： Adaptive fuzzy logic controllers (AFLCs) harmony search algorithm hybrid approaches Lyapunov theory stochastic optimization

来源：评论

学校读者我要写书评

暂无评论

Optimal synthesis of linear antenna arrays using a harmony search algorithm

引用

EXPERT SYSTEMS WITH APPLICATIONS 2011年第12期38卷 15455-15462页

作者： Guney, K. Onay, M. Nuh Naci Yazgan Univ Dept Elect & Elect Engn Fac Engn Kayseri Turkey Erciyes Univ Dept Aircraft Elect & Elect Civil Aviat Sch TR-38039 Kayseri Turkey

A method based on harmony search algorithm (HSA) for the pattern synthesis of linear antenna arrays with the prescribed nulls is presented. Nulling of the pattern is achieved by controlling the amplitude-only, the phase-only, and the position-only. The HSA is conceptualized using the musical process of searching for a perfect state of harmony. To show the effectiveness of the proposed HSA, several examples of linear antenna array patterns with the imposed single, multiple and broad nulls are given. It is found that the nulling method based on HSA is capable of steering the array nulls precisely to the undesired interference directions. The results of HSA are compared with the results of the modified touring ant colony optimization (MTACO), the bees algorithm (BA), the bacterial foraging algorithm (BFA), the plant growth simulation algorithm (PGSA), the clonal selection algorithm (CLONALG), the particle swarm optimization (1,50), the quadratic programming method (QPM), the tabu search algorithm (TSA), the genetic algorithm (GA), the memetic algorithm (MA), the nondominated sorting genetic algorithm 2 (NSGA-2), the multiobjective differential evolution (MODE), and the multiobjective evolutionary algorithms based on decomposition with differential evolution (MOEA/D-DE). (C) 2011 Elsevier Ltd. All rights reserved.

关键词： Antenna array Interference suppression harmony search algorithm Array synthesis

来源：评论

学校读者我要写书评

暂无评论

An improved version of Inverse Distance Weighting metamodel assisted harmony search algorithm for truss design optimization

引用

LATIN AMERICAN JOURNAL OF SOLIDS AND STRUCTURES 2013年第2期10卷 283-300页

作者： Gholipour, Y. Shahbazi, M. M. Behnia, A. Univ Tehran Coll Engn Engn Optimizat Res Grp Tehran Iran Univ Malaya Civil Engn Dept Struct & Mat Kuala Lumpur Malaysia

This paper focuses on a metamodel-based design optimization algorithm. The intention is to improve its computational cost and convergence rate. Metamodel-based optimization method introduced here, provides the necessary means to reduce the computational cost and convergence rate of the optimization through a surrogate. This algorithm is a combination of a high quality approximation technique called Inverse Distance Weighting and a meta-heuristic algorithm called harmony search. The outcome is then polished by a semi-tabu search algorithm. This algorithm adopts a filtering system and determines solution vectors where exact simulation should be applied. The performance of the algorithm is evaluated by standard truss design problems and there has been a significant decrease in the computational effort and improvement of convergence rate.

关键词： Surrogate-based optimization Metamodeling harmony search algorithm Inverse Distance Weighting model

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：