نتایج جستجو برای: improved harmony search algorithm
تعداد نتایج: 1372900 فیلتر نتایج به سال:
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...
during the implementation, construction projects usually encounter situation that considerably affects the project scheduling and cost. this study aims at using an improved version of the harmony search algorithm (hsa) to schedule resource constrained construction projects. this model is formulated as a global optimization problem. it will determine the duration of each activity to minimize the...
This work presents a multiple objective linear programming (MOLP) model based on the desirability function approach for solving the aggregate production planning (APP) decision problem upon Masud and Hwang’s model. The proposed model minimises total production costs, carrying or backordering costs and rates of change in labor levels. An industrial case demonstrates the feasibility of applying t...
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...
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 ...
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 ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید