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

10th International Conference on Advanced Computing and Communication Technologies (ICACCT)

作者： Shivali Maurya, Lalit Sharma, Ekta Mahapatra, Prasant Doegar, Amit CSIR Cent Sci Instruments Org Biomed Instrumentat Div V 2 Sect 30 Chandigarh 160030 India Natl Inst Tech Teachers Training & Res Dept Comp Sci & Engn Sect 26 Chandigarh 160019 India

ISBN: (纸本)9789811046032;9789811046025

Multilevel image thresholding is an essential part of image processing. This paper presents a hybrid implementation of fireworks and harmony search algorithm where Kapur's entropy is used as the fitness function for solving the problem. The results of the proposed method have been compared with the standard fireworks algorithm (FWA) and particle swarm optimization (PSO) based multi-level thresholding methods. Experimental results indicate that the proposed method is a promising approach in the field of image segmentation.

关键词： Image segmentation Multilevel image thresholding Fireworks algorithm harmony search algorithm Kapur's entropy

来源：评论

学校读者我要写书评

暂无评论

A harmony search algorithm to Solve the Manufacturing Cell Design Problem

A Harmony Search Algorithm to Solve the Manufacturing Cell D...

引用

Conference on Computational Methods in Systems and Software (CoMeSySo)

作者： Soto, Ricardo Crawford, Broderick Olivares, Rodrigo Escarate, Felipe Pontificia Univ Catolica Valparaiso Valparaiso Chile Univ Valparaiso Valparaiso Chile

ISBN: (纸本)9783319676180

This paper focuses on modeling and solving the Manufacturing Cell Design Problem (MCDP) by using the harmony search (HS) metaheuristic. The MDCP consists on grouping machines and parts that they process, into groups called cells. So, the idea is to identify an organization of cells such that the number of times that a piece is transported between these cells is minimized. To this end, we use the HS optimization algorithm, which is based on the process of improvisation performed by musicians to find a perfect musical harmony. The experimental results demonstrate the efficiency of the proposed approach which is able to reach all global optimums for a set of 90 well-known MDCP instances.

关键词： Manufacturing cell design problem harmony search algorithm Metaheuristics

来源：评论

学校读者我要写书评

暂无评论

Competition harmony search algorithm with dimension selection for continuous optimization probems 30

Competition harmony search algorithm with dimension selectio...

引用

30th Chinese Control and Decision Conference, CCDC 2018

作者： Ouyang, Haibin Kong, Xiangyong Hu, Bo Li, Zhifu Liu, Guiyun A1School of Mechanical and Electric Engineering Guangzhou University Guangzhou510006 China School of Electrical Engineering and Automation Jiangsu Normal University Xuzhou221116 China

ISBN: (纸本)9781538612439

In order to enhance the performance of harmony search algorithm, a competition harmony search algorithm is presented in this paper. The proposed algorithm has three modifications. Firstly, a parallel search mechanism is designed in the improvisation process, which is aim to accelerate searching speed. second, a novel dimension selection strategy is presented for improving searching efficiency. Moreover, estimation of distribution operation is used based on history information. Besides competition updating operation is used to replace the original updating strategy. Experiment results demonstrated that the proposed algorithm has better performance than the state-of-the-art HS algorithms. © 2018 IEEE.

关键词： Competition updating operation Dimension selection harmony search algorithm

来源：评论

学校读者我要写书评

暂无评论

harmony search algorithm's Parameter Tuning for Traveling Salesman Problem

Harmony Search Algorithm's Parameter Tuning for Traveling Sa...

引用

International Conference on Robotics and Automation Sciences (ICRAS)

作者： Tongchan, Tanapat Pornsing, Choosak Tonglim, Tongtang Silpakorn Univ Engn Management Res Unit Dept Ind Engn & Management Fac Engn & Ind Technol Nakhon Pathom 73000 Thailand Muban Chombueng Rajabhat Univ Fac Sci & Technol Ratchaburi 70150 Thailand

ISBN: (纸本)9781538639955

This paper proposes statistical methods to find the parameter setting of an artificial intelligence technique, harmony search (HS) algorithm. The problem at hand is the travelling salesman problem (TSP) which is an NP-complete problem. Hence, a metaheuristic approach can give the near optimal solution in reasonable amount of computational time. The study makes use of the conventional HS to solve three benchmark problem sets in literature. The encoding and decoding schemes are presented. Then, the general full factorial design is used to find the HS' parameter setting. The analysis shows that HMCR and iteration number are significant. In addition, the appropriate setting of HMCR is 0.3 and iteration number is 5000.

关键词： harmony search algorithm traveling salesman problem parameter setting statistical methods

来源：评论

学校读者我要写书评

暂无评论

Optimizing Re-Chlorination Injection Points for Water Supply Networks Using harmony search algorithm

引用

WATER 2018年第5期10卷 547-547页

作者： Yoo, Do Guen Lee, Sang Myoung Lee, Ho Min Choi, Young Hwan Kim, Joong Hoon Univ Suwon Dept Civil Engn Hwaseong 18323 Gyeonggi Do South Korea K Water 200 Sintanjin Ro Daegeon 34350 South Korea Korea Univ Res Ctr Disaster Prevent Sci & Technol Seoul 02841 South Korea Korea Univ Dept Civil Environm & Architectural Engn Seoul 02841 South Korea Korea Univ Sch Civil Environm & Architectural Engn Anam Ro 145 Seoul 02841 South Korea

In order to achieve the required residual chlorine concentration at the end of a water network, the installation of a re-chlorination facility for a high-quality water supply system is necessary. In this study, the optimal re-chlorination facility locations and doses were determined for real water supply systems, which require maintenance in ord3r to ensure proper residual chlorine concentrations at the pipeline under the present and future conditions. The harmony search algorithm (HSA), which is a meta-heuristic optimization technique, was used for the optimization model. This method was applied to two water supply systems in South Korea and was verified through case studies using different numbers of re-chlorination points. The results show that the proposed model can be used as an efficient water quality analysis and decision making tool, which showed the optimal re-chlorination dose and little deviation in the spatial distribution. In addition, the HSA results are superior to those of the genetic algorithm (GA) in terms of the total injection mass with the same number of evaluations.

关键词： water quality simulation re-chlorination injection harmony search algorithm 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

来源：评论

学校读者我要写书评

暂无评论

Prediction of Local Scour Depth Downstream of Sluice Gates Using harmony search algorithm and Artificial Neural Networks

引用

JOURNAL OF IRRIGATION AND DRAINAGE ENGINEERING 2018年第5期144卷

作者： Bashiri, Hamid Sharifi, Erfaneh Singh, Vijay P. Univ Houston Dept Civil & Environm Engn Houston TX 77004 USA Texas A&M Univ Zachry Dept Civil Engn Dept Biol & Agr Engn Water Engn College Stn TX 77843 USA

Using two coupled models, this study predicts the maximum local scour depth downstream of sluice gates. The models are an artificial neural network (ANN) coupled with the harmony search (HS) algorithm, and an ANN coupled with a generalized reduced gradient (GRG) method. The models are trained and tested using extensive observations obtained from the literature. The main parameters used to predict the scour are apron length, densimetric Froude number, tailwater depth, and median sediment size. In addition, multiple linear regression (MLR) is applied to express the relationship between independent and dependent variables. Results of the ANN model coupled with HS and with GRG and of the MLR are compared. The performance of ANN is more effective when coupled with the HS algorithm. To increase the ability of the HS algorithm, a parameter varying method is applied. Results lead to the conclusion that ANN coupled with the HS algorithm is an accurate and simple method for predicting the maximum scour depth downstream of sluice gates.

关键词： Artificial neural network Clear water harmony search algorithm Multiple linear regression Scour depth Sluice gate

来源：评论

学校读者我要写书评

暂无评论

Dynamic relocation of mobile base station in wireless sensor networks using a cluster-based harmony search algorithm

引用

INFORMATION SCIENCES 2017年 385卷 76-95页

作者： Alia, Osama Moh'd Univ Tabuk Fac Comp & Informat Technol Dept Comp Sci POB 741 Tabuk 71491 Saudi Arabia

In wireless sensor networks (WSNs), the location of the base station (BS) relative to sensor nodes is an important consideration in conserving network lifetime. High energy consumption mainly occurs during data communication between sensor nodes and the BS, in both single and multi-hop infrastructures. A WSN design with dynamic BS relocation is therefore desirable as this may prolong the network operational lifetime. However, positioning the BS next to each sensor node may cause data gathering latency. The reorganization of sensor nodes into clusters and the choice of a delegate node from each cluster, known as a cluster head (CH), as a 'communicator' between each cluster and the moving BS appears to avoid this latency problem and enhance the energy utilization in WSNs. In this paper, we propose an energy-efficient network model that dynamically relocates a mobile BS within a cluster-based network infrastructure using a harmony search algorithm. First, this model allocates sensor nodes into an optimal number of clusters in which each sensor node belongs to the most appropriate cluster. Following this, the optimal CHs are chosen from the other clusters' sensors in order to evenly distribute the role of the CHs among the sensors. This infrastructure changes dynamically based on the number of alive nodes, so that load balancing is achieved among sensor nodes. Subsequently, the optimal location of the moving BS is determined between the CHs and the BS, in order to reduce the distances for communication. Finally, sensing and data transmission takes place from each sensor node to their respective CH, and CHs in turn aggregate and send this sensed data to the BS. Simulation results show very high levels of improvements in network lifetime, data delivery and energy consumption compared to static and random mobile BS network models. (C) 2016 Elsevier Inc. All rights reserved.

关键词： Wireless sensor networks Cluster-based energy-efficient routing protocols Mobile base station harmony search algorithm

来源：评论

学校读者我要写书评

暂无评论

Robust eigenvalue placement optimization for high-order descriptor systems in a union region with disjoint discs based on harmony search algorithm

引用

NEURAL COMPUTING & APPLICATIONS 2017年第1-Sup期28卷 S1207-S1220页

作者： Zhai, Junchang Gao, Liqun Li, Steven Bohai Univ Coll Informat Sci & Technol Jinzhou 121013 Liaoning Peoples R China Northeastern Univ Coll Informat Sci & Engn Shenyang 110819 Liaoning Peoples R China RMIT Univ Grad Sch Business & Law Melbourne Vic 3000 Australia

In this paper, a new optimization scheme is proposed for robust eigenvalue placement in high-order descriptor systems in union region based on harmony search algorithm. The specification on the closed-loop eigenvalues is given in terms of robust union region stability constraints. The radius or the position of the subregions can be arbitrarily specified in complex plane for the transient performance request. By using exact eigenvalue placement theory and combining the harmony search algorithm, the robust eigenvalue placement for high-order descriptor linear system in union region is converted into a global dynamical optimization problem. Further, the eigenstructure of the closed-loop system matrix can be optimized with better robustness bound (i.e., the spectral upper bound of the maximum allowable perturbation or uncertainty for the system matrices) by the proposed scheme without imposing restriction on the differentiability of the nonlinear robust measure index function. Consequently, the robust feedback controller can be obtained by dynamically optimizing the eigenvalue and eigenvector pairs of the system. Finally, the simulation results illustrate the effectiveness and superiority of the proposed method.

关键词： harmony search algorithm Eigenvalue placement Optimization High-order descriptor systems First-order descriptor systems

来源：评论

学校读者我要写书评

暂无评论

Location, Allocation and Routing of Temporary Health Centers in Rural Areas in Crisis, Solved by Improved harmony search algorithm

引用

INTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE SYSTEMS 2017年第1期10卷 894-913页

作者： Alinaghian, Mahdi Goli, Alireza Isfahan Univ Technol Dept Ind & Syst Engn Esfahan *** Iran Yazd Univ Dept Ind Engn Yazd Iran

In this paper, an uncertain integrated model for simultaneously locating temporary health centers in the affected areas, allocating affected areas to these centers, and routing to transport their required good is considered. Health centers can be settled in one of the affected areas or in a place out of them;therefore, the proposed model offers the best relief operation policy when it is possible to supply the goods of affected areas (which are customers of goods) directly or under coverage. Due to that the problem is NP-Hard, to solve the problem in large-scale, a meta-heuristic algorithm based on harmony search algorithm is presented and its performance has been compared with basic harmony search algorithm and neighborhood search algorithm in small and large scale test problems. The results show that the proposed harmony search algorithm has a suitable efficiency.

关键词： disaster relief logistic harmony search algorithm temporary health centers vehicle routing problem rural areas

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：