نتایج جستجو برای: integer harmony search algorithm

تعداد نتایج: 1020038  

H. Mojallali M. Shafaati

Due to the fact that the error surface of adaptive infinite impulse response (IIR) systems is generally nonlinear and multimodal, the conventional derivative based techniques fail when used in adaptive identification of such systems. In this case, global optimization techniques are required in order to avoid the local minima. Harmony search (HS), a musical inspired metaheuristic, is a recently ...

Journal: :Indian Journal of Science and Technology 2011

K.S. Lee, S.W. Han, Z.W. Geem,

Many methods have been developed for structural size and configuration optimization in which cross-sectional areas are usually assumed to be continuous. In most practical structural engineering design problems, however, the design variables are discrete. This paper proposes two efficient structural optimization methods based on the harmony search (HS) heuristic algorithm that treat both discret...

Journal: :Journal of Intelligent Systems 2018

Journal: :international journal of supply and operations management 2014
mehdi alinaghian seyed reza hejazi noushin bajoul

in the field of health losses resulting from failure to establish the facilities in a suitable location and the required number, beyond the cost and quality of service will result in an increase in mortality and the spread of diseases. so the facility location models have special importance in this area. in this paper, a successively inclusive hierarchical model for location of health centers i...

2014
Mir Ehsan Hesam Sadati Ali Doniavi

This study first reviews fuzzy random Portfolio selection theory and describes the concept of portfolio optimization model as a useful instrument for helping finance practitioners and researchers. Second, this paper specifically aims at applying possibility-based models for transforming the fuzzy random variables to the linear programming. The harmony search algorithm approaches to resolve the ...

Journal: :Annals OR 2012
Mohammed Azmi Al-Betar Ahamad Tajudin Abdul Khader

One of the main challenges for any university administrations is building a timetable for course sessions. Such a challenge not only relates to how to build a usable timetable but also how to build an optimal timetable at the same time. The university course timetable is classified as an NP-Complete problem. In general, it means assigning predefined courses to certain rooms and timeslots under ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید