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

Focusing light through scattering media using the harmony search algorithm for phase optimization of wavefront shaping

引用

OPTIK 2018年 158卷 558-564页

作者： Wu, Yulin Zhang, Xiuda Yan, Huimin Zhejiang Univ CNERC Opt Instruments State Key Lab Modern Opt Instrumentat Hangzhou 310027 Zhejiang Peoples R China

Utilizing the wavefront shaping technique to focus light through a scattering medium is a newly emerging field and has shown great potential for various applications. A critical task in this field is identifying a fast, robust algorithm for wavefront shaping. In this work, we introduce a simple-structure algorithm, the harmony search (HS) algorithm, for use in the phase optimization of wavefront shaping. We experimentally demonstrate that HS converges faster than the continuous sequential algorithm (CSA) and reaches a higher overall enhancement. In addition, we establish a simulation model based on random matrix theory. The numerical simulation results agree well with the experimental results and show that the HS algorithm is more resistant than the CSA to noise and sample decoherence.. (C) 2018 Elsevier GmbH. All rights reserved.

关键词： Scattering material wavefront shaping harmony search algorithm

来源：评论

学校读者我要写书评

暂无评论

Compression and Enhancement of Medical Images Using Opposition Based harmony search algorithm

引用

JOURNAL OF INFORMATION PROCESSING SYSTEMS 2019年第2期15卷 288-304页

作者： Haridoss, Rekha Punniyakodi, Samundiswary Pondicherry Univ Dept Elect Engn Pondicherry India

The growth of telemedicine-based wireless communication for images-magnetic resonance imaging (MRI) and computed tomography (CT)-leads to the necessity of learning the concept of image compression. Over the years, the transform based and spatial based compression techniques have attracted many types of researches and achieve better results at the cost of high computational complexity. In order to overcome this, the optimization techniques are considered with the existing image compression techniques. However, it fails to preserve the original content of the diagnostic information and cause artifacts at high compression ratio. In this paper, the concept of histogram based multilevel thresholding (HMT) using entropy is appended with the optimization algorithm to compress the medical images effectively. However, the method becomes time consuming during the measurement of the randomness from the image pixel group and not suitable for medical applications. Hence, an attempt has been made in this paper to develop an HMT based image compression by utilizing the opposition based improved harmony search algorithm (OIHSA) as an optimization technique along with the entropy. Further, the enhancement of the significant information present in the medical images are improved by the proper selection of entropy and the number of thresholds chosen to reconstruct the compressed image.

关键词： Entropy harmony search algorithm Image Compression Multi-Thresholding Optimization

来源：评论

学校读者我要写书评

暂无评论

OPTIMAL UTILIZATION OF GENERATORS USING harmony search algorithm FOR THE MANAGEMENT OF CONTINGENCY

引用

INTERNATIONAL JOURNAL OF INNOVATIVE COMPUTING INFORMATION AND CONTROL 2018年第3期14卷 1159-1168页

作者： Bali, Sravana Kumar Munagala, Suryakalavathi Gundavarapu, Venkata Nagesh Kumar GITAM Univ Dept Elect & Elect Engn Visakhapatnam 530045 Andhra Prades India Univ Hyderabad Jawaharlal Nehru Technol Dept Elect & Elect Engn Hyderabad 500085 Telangana India Vignans Inst Informat Technol Dept Elect & Elect Engn Visakhapatnam 530049 Andhra Prades India

In the modern world totally dependent on electric power, stable operation of the electrical system is absolutely necessary. Hence, optimal utilization of the existing power resources has become absolutely necessary. In this work, a procedure of optimal tuning of generators with harmony search algorithm in the existence of UPFC has been presented. The UPFC has been placed based on an index which is a composition of L-index and LUF index. A multi objective function has been chosen for tuning the generators. The multi-objective function consists of voltage deviation, generation cost and power loss. The presented technique has been examined and implemented on an IEEE 30 bus system for normal and for contingency condition.

关键词： Optimal reallocation UPFC harmony search algorithm Voltage stability

来源：评论

学校读者我要写书评

暂无评论

Improving a model for the dynamic modulus of asphalt using the modified harmony search algorithm

引用

EXPERT SYSTEMS WITH APPLICATIONS 2014年第8期41卷 3856-3860页

作者： Lee, Sangyum Mun, Sungho Seoul Metropolitan Govt Rd Management Div Seoul South Korea Seoul Natl Univ Sci & Technol Dept Civil Engn Seoul South Korea

We report the improvement of a dynamic modulus model using a modified harmony search (MHS) algorithm to describe the resistance to rutting and fatigue cracking of asphalt concrete mixtures. The MHS algorithm was reformulated to improve the harmony search (HS) algorithm by introducing minimum and maximum bandwidths. Using the MHS algorithm, model parameters for lime-modified asphalt concrete mixtures were extracted and a good fit to the dynamic modulus data obtained from laboratory tests was achieved. (C) 2013 Elsevier Ltd. All rights reserved.

关键词： harmony search algorithm Modified harmony search algorithm Asphalt concrete mixture Dynamic modulus

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Optimal hybrid scheme of dynamic neural network and PID controller based on harmony search algorithm to control a PWM-driven pneumatic actuator position

引用

JOURNAL OF VIBRATION AND CONTROL 2018年第16期24卷 3538-3554页

作者： Mazare, Mahmood Taghizadeh, Mostafa Kazemi, Mohammad Ghasem Shahid Beheshti Univ Mech Engn Dept Tehran Iran Shahid Beheshti Univ Elect Engn Dept Tehran Iran

In this paper, the position of a pulse width modulation (PWM)-driven pneumatic actuator has been controlled using a dynamic neural network (DNN) and Proportional Integral Derivative (PID) controller. The harmony search algorithm (HSA) has been used to unravel the optimization problem. The DNN controller is optimally designed to control the position of the actuator. As to the performance of the PID controller, it can assist the DNN controller to give better results. Therefore, an optimal hybrid scheme with both DNN and PID controllers based on HSA is suggested. A pneumatic circuit containing a fast-switching valve is used to reduce the complexity of the PWM-driven servo pneumatic system along with its cost price.

关键词： PWM-driven servo pneumatic dynamic neural network harmony search algorithm optimization hybrid scheme

来源：评论

学校读者我要写书评

暂无评论

Global Dynamic harmony search algorithm: GDHS

引用

APPLIED MATHEMATICS AND COMPUTATION 2014年 228卷 195-219页

作者： Khalili, Mohammad Kharrat, Riyaz Salahshoor, Karim Sefat, Morteza Haghighat Petr Univ Technol Ahvaz Iran Heriot Watt Univ Edinburgh Midlothian Scotland

This paper presents a new modification of harmony search (HS) algorithm to improve its accuracy and convergence speed and eliminates setting parameters that have to be defined before optimization process and it is difficult to predict fixed values for all kinds of problems. The proposed algorithm is named Global Dynamic harmony search (GDHS). In this modification, all the key parameters are changed to dynamic mode and there is no need to predefine any parameters;also the domain is changed to dynamic mode to help a faster convergence. Two experiments, with large sets of benchmark functions, are executed to compare the proposed algorithms with other ones. In the first experiment, 15 benchmark problems are used to compare the proposed algorithm with other similar algorithms based on the harmony search method and in the second experiment, 47 benchmark problems are used to compare the performance of the GDHS with other algorithms from different families, including: GA, PSO, DE and ABC algorithms. Results showed that the proposed algorithm outperforms the other algorithms, considering the point that the GDHS does not require any predefined parameter. (C) 2013 Elsevier Inc. All rights reserved.

关键词： harmony search algorithm Dynamic harmony search Meta-heuristics Evolutionary algorithms Optimization

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Multidirectional harmony search algorithm for solving integer programming and minimax problems

引用

INTERNATIONAL JOURNAL OF BIO-INSPIRED COMPUTATION 2019年第3期13卷 141-158页

作者： Tawhid, Mohamed A. Ali, Ahmed F. Thompson Rivers Univ Fac Sci Dept Math & Stat Kamloops BC V2C 0C8 Canada Suez Canal Univ Fac Comp & Informat Dept Comp Sci Ismailia Egypt

Integer programming and minimax problems are essential tools in solving various problems that arise in data mining and machine learning such as multi-class data classification and feature selection problems. In this paper, we propose a new hybrid harmony search algorithm by combining the harmony search algorithm with the multidirectional search method in order to solve the integer programming and minimax problems. The proposed algorithm is called multidirectional harmony search algorithm (MDHSA). MDHSA starts the search by applying the standard harmony search for numbers of iteration then the best-obtained solution is passing to the multidirectional search method as an intensification process in order to accelerate the search and overcome the slow convergence of the standard harmony search algorithm. The proposed algorithm is balancing between the global exploration of the harmony search algorithm and the deep exploitation of the multidirectional search method. MDHSA algorithm is tested on seven integer programming problems and 15 minimax problems and compared against 12 algorithms for solving integer programming problems and 11 algorithms for solving minimax problems. The experiments results show the efficiency of the proposed algorithm and its ability to solve integer programming and minimax problems in reasonable time.

关键词： evolutionary computation global optimisation harmony search algorithm direct search algorithm multidirectional search integer programming problems minimax problems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：