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

A global harmony search algorithm for finding optimal capacitor location and size in distribution networks

Journal of Central South University 2015年第5期22卷 1748-1761页

作者： Reza Sirjani Melkamu Gamene Bade Cyprus International University Faculty of Engineering Nicosia Northern Cyprus Mersin 10 Turkey

Shunt capacitors are broadly applied in distribution systems to scale down power losses, improve voltage profile and boost system capacity. The amount of capacitors added and location of deployment in the system highly determine the advantage of compensation. A novel global harmony search(GHS) algorithm in parallel with the backward/ forward sweep power flow technique and radial harmonic power flow was used to investigate the optimal placement and sizing of capacitors in radial distribution networks for minimizing power loss and total cost by taking account load unbalancing, mutual coupling and harmonics. The optimal capacitor placement outcomes show that the GHS algorithm can reduce total power losses up to 60 k W and leads to more than 18% of cost saving. The results also demonstrate that the GHS algorithm is more effective in minimization of power loss and total costs compared with genetic algorithm(GA), particle swarm optimization(PSO) and harmony search(HS) algorithm. Moreover, the proposed algorithm converges within 800 iterations and is faster in terms of computational time and gives better performance in finding optimal capacitor location and size compared with other optimization techniques.

关键词： optimal capacitor placement harmonics unbalancing harmony search algorithm

来源：评论

学校读者我要写书评

暂无评论

Optimal Conductor Size Selection in Distribution Systems Using the harmony search algorithm with a Differential Operator

引用

ELECTRIC POWER COMPONENTS AND SYSTEMS 2012年第1期40卷 41-56页

作者： Rao, Rayapudi Srinivasa Satish, K. Narasimham, S. V. L. Jawaharlal Nehru Technol Univ Dept Elect Engn Kakinada India Jawaharlal Nehru Technol Univ Sch Informat Technol Hyderabad Andhra Pradesh India

In this article, a new approach is proposed to optimize conductor size selection in radial distribution network planning for the purpose of minimization of real power loss and enhancement of voltage profile. The objective function is modeled as a problem that minimizes the sum of capital investment and capitalized energy loss cost. Voltage constraints and the maximum current carrying capacity of the conductors are also considered in the evaluation of the objective function. The harmony search algorithm with a differential operator is used to solve the optimal conductor size selection problem and to determine the size and type of the conductors. The effectiveness of the proposed method is demonstrated through simulations on 16- and 85-bus systems, and the results obtained are encouraging.

关键词： distribution system conductor size selection loss reduction voltage profile harmony search algorithm harmony search algorithm with a differential operator

来源：评论

学校读者我要写书评

暂无评论

A Hybrid harmony search algorithm for discrete sizing optimization of truss structure

引用

AUTOMATION IN CONSTRUCTION 2016年第Sep.期69卷 21-33页

作者： Cheng, Min-Yuan Prayogo, Doddy Wu, Yu-Wei Lukito, Martin Marcellinus Natl Taiwan Univ Sci & Technol Dept Civil & Construct Engn 43 Sec 4Keelung Rd Taipei 106 Taiwan Petra Christian Univ Dept Civil Engn Jalan Siwalankerto 121-131 Surabaya 60236 Indonesia

This paper presents a new variant of the harmony search (HS) algorithm. This Hybrid harmony search (HHS) algorithm follows a new approach to improvisation: while retaining HS algorithm harmony Memory and pitch adjustment functions, it replaces the HS algorithm randomization function with Global-best Particle Swarm Optimization (PSO) search and neighbourhood search. HHS algorithm performance is tested on six discrete truss structure optimization problems under multiple loading conditions. Optimization results demonstrate the excellent performance of the HHS algorithm in terms of both optimum solution and the convergence behaviour in comparison with various alternative optimization methods. (C) 2016 Elsevier B.V. All rights reserved.

关键词： harmony search algorithm Global-best PSO Neighbourhood search Hybrid harmony search algorithm Discrete sizing optimization of truss structures

来源：评论

学校读者我要写书评

暂无评论

Damage detection under ambient vibration by harmony search algorithm

引用

EXPERT SYSTEMS WITH APPLICATIONS 2012年第10期39卷 9704-9714页

作者： Fadel Miguel, Leandro Fleck Fadel Miguel, Leticia Fleck Kaminski, Joao, Jr. Riera, Jorge Daniel Univ Fed Santa Catarina Dept Civil Engn Florianopolis SC Brazil Univ Fed Rio Grande do Sul Dept Mech Engn Porto Alegre RS Brazil Univ Fed Santa Maria Dept Civil Engn BR-97119900 Santa Maria RS Brazil Univ Fed Rio Grande do Sul Dept Civil Engn Porto Alegre RS Brazil

Damage in structural systems induced by vibrations, alternating load cycles, temperature changes, corrosion, etc., constitute a serious technical problem. Smart methods of control and structural health monitoring (SHM) for large structures are, therefore, highly needed. In certain structural applications, moreover, a lack of access to the damaged area imposes an additional constraint on damage identification procedures. One method that may fulfill those requirements is dynamic nondestructive testing, which consists of monitoring changes in the structure's natural frequencies, vibration modes and damping. In this paper, a new approach for vibration-based (SHM) procedures is presented, in an ambient vibration context;this method combines a time domain modal identification technique (SSI) with the evolutionary harmony search algorithm. A series of numerical examples with different damage scenarios and noise levels have been carried out under impact and ambient vibration. Thereafter, an experimental study of three cantilever beams with several different damage scenarios is conducted and the proposed methodology has shown potential for use in the damage diagnosis assessment of the remaining structural life. (C) 2012 Elsevier Ltd. All rights reserved.

关键词： Structural health monitoring Ambient vibration harmony search algorithm

来源：评论

学校读者我要写书评

暂无评论

P-HS-SFM: a parallel harmony search algorithm for the reproduction of experimental data in the continuous microscopic crowd dynamic models

引用

JOURNAL OF EXPERIMENTAL & THEORETICAL ARTIFICIAL INTELLIGENCE 2018年第2期30卷 235-255页

作者： Jaber, Khalid Mohammad Alia, Osama Moh'd Shuaib, Mohammed Mahmod Al Zaytoonah Univ Jordan Fac Sci & Informat Technol Amman Jordan Univ Tabuk Fac Comp & Informat Technol Dept Comp Sci Tabuk Saudi Arabia Al Imam Muhammad Ibn Saud Islamic Univ Coll Sharia & Islamic Studies Ahsaa Dept Comp Sci Al Ahsaa Saudi Arabia

Finding the optimal parameters that can reproduce experimental data (such as the velocity-density relation and the specific flow rate) is a very important component of the validation and calibration of microscopic crowd dynamic models. Heavy computational demand during parameter search is a known limitation that exists in a previously developed model known as the harmony search-Based Social Force Model (HS-SFM). In this paper, a parallel-based mechanism is proposed to reduce the computational time and memory resource utilisation required to find these parameters. More specifically, two MATLAB-based multicore techniques (parfor and create independent jobs) using shared memory are developed by taking advantage of the multithreading capabilities of parallel computing, resulting in a new framework called the Parallel harmony search-Based Social Force Model (P-HS-SFM). The experimental results show that the parfor-based P-HS-SFM achieved a better computational time of about 26h, an efficiency improvement of approximate to 54% and a speedup factor of 2.196 times in comparison with the HS-SFM sequential processor. The performance of the P-HS-SFM using the create independent jobs approach is also comparable to parfor with a computational time of 26.8h, an efficiency improvement of about 30% and a speedup of 2.137 times.

关键词： Parallel computing multi-threading harmony search algorithm continuous microscopic crowd dynamics social force model

来源：评论

学校读者我要写书评

暂无评论

Pareto-based grouping discrete harmony search algorithm for multi-objective flexible job shop scheduling

引用

INFORMATION SCIENCES 2014年第1期289卷 76-90页

作者： Gao, K. Z. Suganthan, P. N. Pan, Q. K. Chua, T. J. Cai, T. X. Chong, C. S. Nanyang Technol Univ Sch Elect & Elect Engn Singapore 639798 Singapore Liaocheng Univ Comp Sch Liaocheng 252000 Peoples R China Singapore Inst Mfg Technol Singapore 638075 Singapore

This paper proposes a Pareto-based grouping discrete harmony search algorithm (PGDHS) to solve the multi-objective flexible job shop scheduling problem (FJSP). Two objectives, namely the maximum completion time (makespan) and the mean of earliness and tardiness, are considered simultaneously. Firstly, two novel heuristics and several existing heuristics are employed to initialize the harmony memory. Secondly, multiple harmony generation strategies are proposed to improve the performance of harmony search algorithm. The operation sequence in a new harmony is produced based on the encoding method and the characteristics of FJSP. Thirdly, two local search methods based on critical path and due date are embedded to enhance the exploitation capability. Finally, extensive computational experiments are carried out using well-known benchmark instances. Three widely used performance measures, number of non-dominated solutions, diversification metric and quality metric, are employed to test the performance of PGDHS algorithm. Computational results and comparisons show the efficiency and effectiveness of the proposed PGDHS algorithm for solving multi-objective flexible job-shop scheduling problem. (C) 2014 Published by Elsevier Inc.

关键词： Flexible job shop scheduling harmony search algorithm Multi-objective optimization Local search

来源：评论

学校读者我要写书评

暂无评论

A local-best harmony search algorithm with dynamic sub-harmony memories for lot-streaming flow shop scheduling problem

引用

EXPERT SYSTEMS WITH APPLICATIONS 2011年第4期38卷 3252-3259页

作者： Pan, Quan-Ke Suganthan, P. N. Liang, J. J. Tasgetiren, M. Fatih Nanyang Technol Univ Sch Elect & Elect Engn Singapore 639798 Singapore Liaocheng Univ Coll Comp Sci Liaocheng 252059 Peoples R China Zhengzhou Univ Sch Elect Engn Zhengzhou 450001 Peoples R China Yasar Univ Dept Ind Engn Izmir Turkey

In this paper, a local-best harmony search (HS) algorithm with dynamic sub-harmony memories (HM), namely DLHS algorithm, is proposed to minimize the total weighted earliness and tardiness penalties for a lot-streaming flow shop scheduling problem with equal-size sub-lots. First of all, to make the HS algorithm suitable for solving the problem considered, a rank-of-value (ROV) rule is applied to convert the continuous harmony vectors to discrete job sequences, and a net benefit of movement (NBM) heuristic is utilized to yield the optimal sub-lot allocations for the obtained job sequences. Secondly, an efficient initialization scheme based on the NEH variants is presented to construct an initial HM with certain quality and diversity. Thirdly, during the evolution process, the HM is dynamically divided into many small-sized sub-HMs which evolve independently so as to balance the fast convergence and large diversity. Fourthly, a new improvisation scheme is developed to well inherit good structures from the local-best harmony vector in the sub-HM. Meanwhile, a chaotic sequence to produce decision variables for harmony vectors and a mutation scheme are utilized to enhance the diversity of the HM. In addition, a simple but effective local search approach is presented and embedded in the DLHS algorithm to enhance the local searching ability. Computational experiments and comparisons show that the proposed DLHS algorithm generates better or competitive results than the existing hybrid genetic algorithm (HGA) and hybrid discrete particle swarm optimization (HDPSO) for the lot-streaming flow shop scheduling problem with total weighted earliness and tardiness criterion. (C) 2010 Elsevier Ltd. All rights reserved.

关键词： Flow shop Lot-streaming Scheduling problem harmony search algorithm Weighted earliness and tardiness

来源：评论

学校读者我要写书评

暂无评论

引用

APPLIED SOFT COMPUTING 2019年 80卷 776-796页

作者： Tsakirakis, Eleftherios Marinaki, Magdalene Marinakis, Yannis Matsatsinis, Nikolaos Tech Univ Crete Sch Prod Engn & Management Khania 73100 Greece

The harmony search (HS) is a metaheuristic algorithm, which is inspired from the composition of music harmonies. The functionality and flexibility of HS contribute to the development of successful methodologies for different kind of scientific problems. The aim of this paper is to propose a variant of the classic HS algorithm in order to provide competitive solutions for the Team Orienteering Problem (TOP). We introduce the Similarity Hybrid harmony search (SHHS) algorithm as an alternative and innovative optimization method. The SHHS follows the standard procedure of HS with some modifications and includes a new strategy called "similarity process". Two versions of the proposed method have been developed, the static version with predefined values for the parameters of the method and the dynamic one with dynamic adjustment of the parameters. The SHHS algorithm is applied to the known benchmark instances of TOP. The dynamic of the algorithm is tested through a complete solution analysis which gives the superiority of the dynamic version compared to the static one. The results of both versions of the proposed algorithm indicate the positive performance against other effective and robust optimization algorithms from the literature. (C) 2019 Elsevier B.V. All rights reserved.

关键词： harmony search algorithm Metaheuristic Similarity process Team Orienteering Problem

来源：评论

学校读者我要写书评

暂无评论

Extending the Lifetime of Dynamic Underwater Acoustic Sensor Networks Using Multi-Population harmony search algorithm

引用

IEEE SENSORS JOURNAL 2016年第11期16卷 4034-4042页

作者： Lin, Chun-Cheng Deng, Der-Jiunn Wang, Shang-Bin Natl Chiao Tung Univ Dept Ind Engn & Management Hsinchu 3000 Taiwan Natl Changhua Univ Educ Dept Comp Sci & Informat Engn Changhua 500 Taiwan

Like wireless sensor networks, lifetime of sensors is the main constraint for performance of underwater acoustic sensor networks (UASNs). Most previous works on UASNs did not consider dynamics of networks, i.e., as time goes by, in practice, part of sensors may be malfunctioned, deplete their battery power, or get lost due to violent underwater environment changes. Therefore, this paper considers a UASN in ocean and proposes a sleep scheduling scheme in which sensor nodes and autonomous underwater vehicles in this network can dynamically choose to sleep or work to adapt to the environmental change. The concerned problem is to dynamically determine a sufficient number of active nodes in the UASN at different times, such that the targets required to be detected are covered. A special static scenario of the problem has been shown to be NP-complete. Hence, this paper proposes an improved multi-population harmony search algorithm to solve this dynamic problem. By simulation, the proposed algorithm shows high performance in terms of extending network lifetime, robustness, and computing time.

关键词： Underwater acoustic sensor network harmony search algorithm multi-population dynamic optimization

来源：评论

学校读者我要写书评

暂无评论

Coordination of directional overcurrent relays in the interconnected power systems using effective tuning of harmony search algorithm

引用

SUSTAINABLE COMPUTING-INFORMATICS & SYSTEMS 2017年 15卷 1-15页

作者： Rajput, Vipul N. Pandya, Kartik S. Charotar Univ Sci & Technol Dept Elect Engn Changa 388421 Gujarat India

In the optimum coordination of Directional Overcurrent Relays (DOCRs), the appropriate relay settings, namely, Plug Setting (PS) and Time Multiplier Setting (TMS), are selected to minimize the operating time of relays subject to various coordination and boundary constraints. In the large interconnected power systems, the key issue with DOCRs protection is to achieve correct relay coordination with satisfying all coordination constraints. In this paper, the parameters of harmony search algorithm (HSA) are tuned to effectively solve the relay coordination problem on five different test cases. Also, the relay coordination problem is formulated as Linear Programming Problem (LPP), Non-linear Programming Problem (NLPP) and Mixed-Integer non-linear programming Problem (MINLPP). In addition, the superiority of proposed method is demonstrated by comparing the obtained results with those obtained by the Genetic algorithm (GA), hybrid GA-Nonlinear Programming (GA-NLP), Firefly algorithm (FFA), and Cuckoo search algorithm (CSA). (C) 2017 Elsevier Inc. All rights reserved.

关键词： Directional overcurrent relay harmony search algorithm Optimization Optimum relay coordination Power system protection Relay settings

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：