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

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Multiple-buyer multiple-vendor multi-product multi-constraint supply chain problem with stochastic demand and variable lead-time: A harmony search algorithm

引用

APPLIED MATHEMATICS AND COMPUTATION 2011年第22期217卷 9234-9253页

作者： Taleizadeh, Ata Allah Niaki, Seyed Taghi Akhavan Barzinpour, Farnaz Sharif Univ Technol Dept Ind Engn Tehran *** Iran Iran Univ Sci & Technol Dept Ind Engn Tehran Iran

In this paper, a multi-buyer multi-vendor supply chain problem is considered in which there are several products, each buyer has limited capacity to purchase products, and each vendor has warehouse limitation to store products. In this chain, the demand of each product is stochastic and follows a uniform distribution. The lead-time of receiving products from a vendor to a buyer is assumed to vary linearly with respect to the order quantity of the buyer and the production rate of the vendor. For each product, a fraction of the shortage is backordered and the rest are lost. The ordered product quantities are placed in multiple of pre-defined packets and there are service rate constraints for the buyers. The goal is to determine the reorder points, the safety stocks, and the numbers of shipments and packets in each shipment of the products such that the total cost of the supply chain is minimized. We show that the model of this problem is of an integer nonlinear programming type and in order to solve it a harmony search algorithm is employed. To validate the solution and to compare the performance of the proposed algorithm, a genetic algorithm is utilized as well. A numerical illustration and sensitivity analysis are given at the end to show the applicability of the proposed methodology in real-world supply chain problems. (C) 2011 Elsevier Inc. All rights reserved.

关键词： Supply chain management Multi-buyer Multi-vendor Partial back ordering Variable lead-time Integer nonlinear programming harmony search algorithm Genetic algorithsm

来源：评论

学校读者我要写书评

暂无评论

Optimal reactive power dispatch based on harmony search algorithm

引用

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

作者： Khazali, A. H. Kalantar, M. Iran Univ Sci & Technol Ctr Excellence Power Syst Automat & Operat Tehran Iran

This paper presents a harmony search algorithm for optimal reactive power dispatch (ORPD) problem. Optimal reactive power dispatch is a mixed integer, nonlinear optimization problem which includes both continuous and discrete control variables. The proposed algorithm is used to find the settings of control variables such as generator voltages, tap positions of tap changing transformers and the amount of reactive compensation devices to optimize a certain object. The objects are power transmission loss, voltage stability and voltage profile which are optimized separately. In the presented method, the inequality constraints are handled by penalty coefficients. The study is implemented on IEEE 30 and 57-bus systems and the results are compared with other evolutionary programs such as simple genetic algorithm (SGA) and particle swarm optimization (PSO) which have been used in the last decade and also other algorithms that have been developed in the recent years. (c) 2011 Elsevier Ltd. All rights reserved.

关键词： Optimal reactive power dispatch harmony search algorithm Optimization Loss minimization, Voltage stability Voltage deviation

来源：评论

学校读者我要写书评

暂无评论

A chaotic harmony search algorithm for the flow shop scheduling problem with limited buffers

引用

APPLIED SOFT COMPUTING 2011年第8期11卷 5270-5280页

作者： Pan, Quan-Ke Wang, Ling Gao, Liang Huazhong Univ Sci & Technol State Key Lab Digital Mfg Equipment & Technol Wuhan 430074 Peoples R China Liaocheng Univ Coll Comp Sci Liaocheng 252059 Peoples R China Tsinghua Univ Dept Automat Tsinghua Natl Lab Informat Sci & Technol TNList Beijing 100084 Peoples R China

In this paper, a chaotic harmony search (CHS) algorithm is proposed to minimize makespan for the permutation flow shop scheduling problem with limited buffers. First of all, to make the harmony search algorithm suitable for solving the problem under consideration, a rank-of-value rule is applied to convert continuous harmony vectors to discrete job permutations. Secondly, an efficient initialization scheme based on the Nawaz-Enscore-Ham heuristic [M. Nawaz, E.E.J. Enscore, I. Ham, A heuristic algorithm for the m-machine, n-job flow shop sequencing problem, OMEGA-International Journal of Management Science 11 (1983) 91-95] and its variants is presented to construct an initial harmony memory with a certain level of quality and diversity. Thirdly, a new improvisation scheme is developed to well inherit good structures from the best harmony vector in the last generation. In addition, a chaotic local search algorithm with probabilistic jumping scheme is presented and embedded in the proposed CHS algorithm to enhance the local searching ability. Computational simulations and comparisons based on the well-known benchmark instances are provided. It is shown that the proposed CHS algorithm generates better results not only than the two recently developed harmony search algorithms but also than the existing hybrid genetic algorithm and hybrid particle swarm optimization in terms of solution quality and robustness. (C) 2011 Elsevier B.V. All rights reserved.

关键词： Flow shop with limited buffers Makespan harmony search algorithm Chaotic optimization

来源：评论

学校读者我要写书评

暂无评论

Optimum surface roughness prediction in face milling by using neural network and harmony search algorithm

引用

INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY 2011年第5-8期52卷 487-495页

作者： Razfar, Mohammad Reza Zinati, Reza Farshbaf Haghshenas, Mahdiar Amirkabir Univ Technol Dept Mech Engn Tehran Iran

This paper presents a new approach to determine the optimal cutting parameters leading to minimum surface roughness in face milling of X20Cr13 stainless steel by coupling artificial neural network (ANN) and harmony search algorithm (HS). In this regard, advantages of statistical experimental design technique, experimental measurements, analysis of variance, artificial neural network and harmony search algorithm were exploited in an integrated manner. To this end, numerous experiments on X20Cr13 stainless steel were conducted to obtain surface roughness values. A predictive model for surface roughness was created using a feed forward neural network exploiting experimental data. The optimization problem was solved by harmony search algorithm. Additional experiments were performed to validate optimum surface roughness value predicted by HS algorithm. The obtained results show that the harmony search algorithm coupled with feed forward neural network is an efficient and accurate method in approaching the global minimum of surface roughness in face milling.

关键词： Cutting parameters Optimization Surface roughness Artificial neural network harmony search algorithm

来源：评论

学校读者我要写书评

暂无评论

Optimal Network Reconfiguration of Large-Scale Distribution System Using harmony search algorithm

引用

IEEE TRANSACTIONS ON POWER SYSTEMS 2011年第3期26卷 1080-1088页

作者： Rao, Rayapudi Srinivasa Narasimham, Sadhu Venkata Lakshmi Raju, Manyala Ramalinga Rao, A. Srinivasa JNT Univ Dept Elect & Elect Engn Kakinada India JNT Univ Sch Informat Technol Hyderabad Andhra Pradesh India GITAM Univ Dept Elect & Elect Engn Vishakapatnam India

Electrical distribution network reconfiguration is a complex combinatorial optimization process aimed at finding a radial operating structure that minimizes the system power loss while satisfying operating constraints. In this paper, a harmony search algorithm (HSA) is proposed to solve the network reconfiguration problem to get optimal switching combination in the network which results in minimum loss. The HSA is a recently developed algorithm which is conceptualized using the musical process of searching for a perfect state of harmony. It uses a stochastic random search instead of a gradient search which eliminates the need for derivative information. Simulations are carried out on 33- and 119-bus systems in order to validate the proposed algorithm. The results are compared with other approaches available in the literature. It is observed that the proposed method performed well compared to the other methods in terms of the quality of solution.

关键词： Distribution system harmony search algorithm loss reduction network reconfiguration

来源：评论

学校读者我要写书评

暂无评论

An effective global harmony search algorithm for reliability problems

引用

EXPERT SYSTEMS WITH APPLICATIONS 2011年第4期38卷 4642-4648页

作者： Zou, Dexuan Gao, Liqun Li, Steven Wu, Jianhua Northeastern Univ Sch Informat Sci & Engn Shenyang 110004 Liaoning Peoples R China Univ S Australia Div Business Adelaide SA 5001 Australia

This paper proposes an effective global harmony search algorithm (EGHS) to solve two kinds of reliability problems: the complex (bridge) system optimization problem and the reliability-redundancy optimization problem of the overspeed protection system for a gas turbine. In general, the two problems are formulated as mixed-integer nonlinear 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 optimization problems. The proposed 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 reliability optimization problems. (C) 2010 Elsevier Ltd. All rights reserved.

关键词： Effective global harmony search algorithm Reliability problems harmony search algorithm Particle swarm optimization algorithm Convergence

来源：评论

学校读者我要写书评

暂无评论

Environmental/economic dispatch using multi-objective harmony search algorithm

引用

ELECTRIC POWER SYSTEMS REsearch 2011年第9期81卷 1778-1785页

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

This paper presents a new multi-objective harmony search (MOHS) algorithm for environmental/economic dispatch (EED) problem. The EED problem is formulated as a non linear and constrained optimization problem with competing and non-commensurable objectives. The two competing objectives, fuel cost and emission, were optimized simultaneously using the proposed MONS algorithm. The MOHS algorithm uses a non dominated sorting and ranking procedure with dynamic crowding distance to develop and maintain a well distributed Pareto-optimal set. The proposed algorithm has been tested on the standard IEEE 30 bus and 118 bus systems. Simulation results are compared with the fast non dominated sorting genetic algorithm (NSGA-II) method. The results clearly show that the proposed method is able to produce a well distributed Pareto-optimal solutions than the NSGA-II method. (C) 2011 Elsevier B.V. All rights reserved.

关键词： harmony search algorithm Multi-objective optimization Cost minimization Emission minimization

来源：评论

学校读者我要写书评

暂无评论

Cost Optimization of Reinforced Concrete One-Way Ribbed Slabs Using harmony search algorithm

引用

ARABIAN JOURNAL FOR SCIENCE AND ENGINEERING 2011年第7期36卷 1179-1187页

作者： Kaveh, A. Abadi, A. Shakouri Mahmud Iran Univ Sci & Technol Ctr Excellence Fundamental Studies Struct Engn Tehran 16 Iran Bldg & Housing Res Ctr Tehran 14 Iran

Cost optimization of a reinforced concrete one-way joist floor system consisting of a hollow slab is presented in this paper. The cost of the system is considered to be the objective function, and the design is based on the American Concrete Institute's ACI 318-05 standard. This function is minimized, subject to design constraints, using the harmony search algorithm. A numerical example is presented to illustrate the performance of the algorithm and a sensitivity analysis is performed. A parametric study is also conducted to investigate the effects of the beam span and the loading on the cost optimization of the ribbed slab.

关键词： Reinforced concrete slab One-way joist floor harmony search algorithm Cost optimization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：