به جمع مشترکان مگیران بپیوندید!

تنها با پرداخت 70 هزارتومان حق اشتراک سالانه به متن مقالات دسترسی داشته باشید و 100 مقاله را بدون هزینه دیگری دریافت کنید.

برای پرداخت حق اشتراک اگر عضو هستید وارد شوید در غیر این صورت حساب کاربری جدید ایجاد کنید

عضویت
جستجوی مقالات مرتبط با کلیدواژه

harmony search algorithm

در نشریات گروه صنایع
تکرار جستجوی کلیدواژه harmony search algorithm در نشریات گروه فنی و مهندسی
تکرار جستجوی کلیدواژه harmony search algorithm در مقالات مجلات علمی
  • Javad Behnamian*, A. Panahi

    Given the increasing human need for health systems and the costs of using such systems, the problem of optimizing health-related systems has attracted the attention of many researchers. One of the most critical cases in this area is the operating room scheduling. Much of the cost of health systems is related to operating room costs. Therefore, planning and scheduling of operating rooms can play an essential role in increasing the efficiency of health systems as well as reducing costs. Given the uncertain factors involved in such matters, attention to uncertainty in this problem is one of the most critical factors in the results. In this study, the problem of the daily scheduling of the operating room with uncertain surgical time was investigated. For minimizing overhead costs and maximizing the number of surgeries to reduce patients' waiting time, after introducing a mathematical model, a chance-constrained programming approach is used to deal with its uncertainty. In this study, also, a harmony search algorithm is proposed to solve the model because of its NP-Hardness. By performing the numerical analysis and comparing the presented algorithm result with a genetic algorithm, the results show that the proposed algorithm has a better performance.

    Keywords: Operating room scheduling, Health care, Chance-constrained modeling, Harmony search algorithm
  • Iman Rastgar, Javad Rezaean *, Iraj Mahdavi, Parviz Fattahi
    In this article, an approach to optimize opportunistic maintenance policies was presented to examine the use of opportunities created in preventive maintenance activities. After the operation, maintenance, and repair, a component never gets back to the status of a new one. Hence, assuming that the replacement case is not approached, a maintenance activity is referred to as an imperfect type. In this article, assuming the existence of the imperfect maintenance type, an opportunistic approach based on age threshold values of components is proposed. The maintenance activities in this research focus on the hybrid flow shop problem. Different threshold values are also introduced in this article for failure conditions for a machine. A harmony search algorithm is used to provide optimized values for this proposed approach. The simulation approach is used to calculate the average cost of maintenance. The cost analysis indicates that the proposed approach is better than the corrective policy widely in literature; otherwise, the proposed approach with about 25 percent saving is the best performance.
    Keywords: Opportunistic maintenance, Imperfect maintenance actions, hybrid flow shop, harmony search Algorithm, Simulation
  • Morteza Khakzar Bafruei, Sananz Khatibi, Morteza Rahmani
    Optimizing gate scheduling at airports is an old, but also a broad problem. The main purpose of this problem is to find an assignment for the flights arriving at and departing from an airport, while satisfying a set of constraints.A closer look at the literature in this research line shows thatin almost all studies airport gate processing time has been considered as a fix parameter. In this research, however, we investigate a more realistic situation in which airport gate processing time is a controllable. It is also assumed that the possible compression/expansion processing time of a flight can be continuously controlled, i.e. it can be any number in a given interval.Doing sohas some positive effectswhich lead to increasing the total performance at airports’ terminals. Depending on the situation, different objectives become important.. Therefore, a model which simultaneously (1) minimize the total cost of tardiness, earliness, delay andthe compression as well as the expansion costs of job processing time, and (2) minimize passengers overcrowding on gate is presented. In this study, we first propose a mixed-integer programming model for the formulated problem. Due to complexity of problem, two multi-objective meta-heuristic algorithms, i.e. multi-objective harmony search algorithm (MOHSA) and non-dominated sorting genetic algorithm II (NSGA-II) are applied in order to generate Pareto solutions. For calibrating the parameter of the algorithms, Taguchi method is used and three optimal levels of the algorithm’s performance are selected. The algorithms are tested with real-life data from Mehrabad International Airport for nine medium size test problems. The experimental results show that NSGA-II has better convergence near the true Pareto-optimal front as compared to MOHSA; however, MOHSA finds a better spread in the entire Pareto-optimal region.Finally, it is possible to apply some practical constraints into the model and also test them with even large real-life problems instances.
    Keywords: Gate scheduling problem, Multi-objective decision making, Harmony search algorithm, NSGA-II, Controllable processing times
  • Rashed Sahraeian *, Mohammad Rohaninejad, Mahmoud Fadavi
    In this paper an integrated lot-sizing and scheduling problem in a flexible job shop environment with machine-capacity-constraint is studied. The main objective is to minimize the total cost which includes the inventory costs, production costs and the costs of machine’s idle times. First, a new mixed integer programming model,with small bucket time approach,based onProportional Lot sizing and Scheduling Problems (PLSP), is proposed to formulate the problem. Since the problem under study is NP-hard, a modified harmony search algorithm, with a new built-in local search heuristic is proposed as solution technique.In this algorithm,it is improvised a New Harmony vector in two phases to enhance search ability.Additionally, Taguchi method is used to calibrate the parameters of the modified harmony search algorithm. Finally, comparative results demonstrate the effectiveness of the modified harmony search algorithm in solving the problem.It is also demonstrated that the proposed algorithm can find good quality solutions for all size problems. The objective values obtained by proposed algorithm are better from HS algorithm and exact method results.
    Keywords: Lot-sizing, Scheduling, flexible job shop, harmony search algorithm
  • Iman Rastgar, Rashed Sahraeian *
    This paper considers the scheduling problem of parallel batch processing machines with non-identical job size and processing time. In this paper, a new mathematical model with ready time and batch size constraints is presented to formulate the problem mathematically, in which simultaneous reduction of the makespan and earliness-tardiness is the objective function. In recent years, the nature-inspired computational intelligent algorithms have been successfully employed to achieve the optimum design of different structures. Since the proposed model is NP-hard, a metaheuristic algorithm according to a harmony search algorithm is developed and analyzed for solving the batch processing machine scheduling problem addressed in the current paper. Various parameters and operators of the proposed harmony search algorithm are discussed and calibrated by means of the Taguchi statistical technique. In order to evaluate the proposed algorithm, instance problems in concordance with previous research are generated. The proposed algorithm and basic harmony search, improved harmony search and global best harmony search are solved and the results of all the algorithms are compared. The conclusion reveals that the proposed algorithm performs better than the other algorithms.
    Keywords: batch processing, harmony search Algorithm, scheduling, Taguchi design of experiments, parallel machine
  • حمیدرضا قاسمی، امیرعباس نجفی*، پژمان رمضانی

    تصمیم گیری درمورد نحوه ی تشکیل سبد سرمایه گذاری بهینه در شرایط بحرانی بازار)یعنی در زمان افت قیمت دارایی ها(با فرض مجاز بودن فروش استقراضی ازجمله مسائل مهم پیشروی سرمایه گذاران در بازار سرمایه است. از این رو در این تحقیق مدلی در حوزه ی مسائل انتخاب سبد سرمایه گذاری پیشنهاد شده که فرض مجاز بودن فروش استقراضی را در کنار برخی محدودیت های کاربردی بازار سرمایه در نظر می گیرد. مدل پیشنهادی دارای ماهیت برنامه ریزی عدد صحیح غیرخطی بوده و با توجه به پیچیدگی محاسباتی آن، نیازمند بهره گیری از الگوریتم های فراابتکاری است. با توجه به پیوستگی فضای جواب مدل پیشنهادی، الگوریتم جست وجوی هارمونی به عنوان یک الگوریتم نوین و کارا در حل مسائل پیوسته به کار گرفته شده است. نتایج حاصله نشان گر عملکرد مناسب این الگوریتم در حل مدل پیشنهادی است.

    کلید واژگان: بهینه سازی پرتفوی، مدل مارکویتز، فروش استقراضی، الگوریتم جست وجوی هارمونی
    H.R. GHASEMI, A.A. NAJAFI, P. RAMEZANI

    O p t i m a l c a p i t a l a l l o c a t i o n i n a s s e t s i s a n i m p o r t a n t i s s u e f a c i n g i n v e s t o r s. T h e f i r s t m o d e l o f p o r t f o l i o s e l e c t i o n w a s p r o p o s e d b y M a r k o w i t z i n 1952. T h i s p o r t f o l i o o p t i m i z a t i o n m o d e l i s a l s o k n o w n a s t h e m e a n-v a r i a n c e m o d e l a n d e n d e a v o r s t o m i n i m i z e p o r t f o l i o v a r i a n c e b y c o n s i d e r i n g o n l y r e t u r n s a n d b u d g e t c o n s t r a i n t s. S o l v i n g t h e M a r k o w i t z's q u a d r a t i c m o d e l c r e a t e s a n i n v e s t m e n t e f f i c i e n t f r o n t i e r a s a s o l u t i o n s e t f o r i n v e s t o r s, a n d s e l e c t i n g a p o r t f o l i o f r o m a n e f f i c i e n t f r o n t i e r d e p e n d s o n t h e i r r i s k-t a k i n g o r r i s k a v e r s i o n. I n r e c e n t y e a r s, i n t r o d u c t i o n o f o t h e r p r a c t i c a l c o n s t r a i n t s (e.g. s h o r t s e l l i n g, f l o o r a n d c e i l i n g, c a r d i n a l i t y c o n s t r a i n t s) h a s c a u s e d t h e d e v e l o p m e n t o f t h e p r i m a r y M a r k o w i t z m o d e l. D e c i s i o n m a k i n g r e g a r d i n g o p t i m a l p o r t f o l i o f o r m a t i o n u n d e r c r i t i c a l m a r k e t c o n d i t i o n s (i.e. r e d u c t i o n i n a s s e t p r i c e s) i s a n i m p o r t a n t i s s u e l e a d i n g i n v e s t o r s i n t o t e r m s o f j u s t i f i a b i l i t y s h o r t s e l l i n g. H e n c e i n t h i s p a p e r, w e c o n s i d e r a f a i r m o d e l (f o r b o t h c a l l a n d s h o r t p o s i t i o n s i n t h e c a p i t a l m a r k e t) i n t h e p o r t f o l i o s e l e c t i o n p r o b l e m a r e a t h a t a l l o w s s h o r t s e l l i n g u n d e r s o m e c a p i t a l m a r k e t p r a c t i c a l c o n s t r a i n t s. W e p r o p o s e a n e w m a t h e m a t i c a l m o d e l f o r t h e p r o b l e m a n d e x p l a i n i t s p r a c t i c a l c o n s t r a i n t s. T h i s p r o p o s e d m o d e l h a s a m i x e d i n t e g e r n o n-l i n e a r p r o g r a m m i n g (M I N L P) n a t u r e a n d, w i t h r e s p e c t t o i t s c o m p u t a t i o n a l c o m p l e x i t y, s t a n d a r d m a t h e m a t i c a l t o o l s (e.g. L I N G O a n d G A M S) o n l y e n a b l e i t t o s o l v e v e r y s m a l l s i z e s; i t n e e d s t o u s e m e t a-h e u r i s t i c a l g o r i t h m s f o r r e l a t i v e l y l a r g e p r o b l e m s i z e s. T h e c o n t i n u i t y o f t h e m o d e l s o l u t i o n s p a c e l e a d s i t t o u s e a h a r m o n y s e a r c h a l g o r i t h m a s a n e f f i c i e n t a n d n e w a l g o r i t h m i n s o l v i n g c o n t i n u o u s p r o b l e m s. W e e x p l a i n t h e e l e m e n t s o f t h e p r o p o s e d h a r m o n y s e a r c h a l g o r i t h m, s u c h a s s o l u t i o n e n c o d i n g, t h e f i t n e s s f u n c t i o n, a n d i t s f l o w c h a r t a n d p a r a m e t e r s. F o r e v a l u a t i o n o f t h e a l g o r i t h m, w e c o n s i d e r a r e a l p r o b l e m a n d s o l v e i t b y t h e p r o p o s e d a l g o r i t h m a n d a n e x a c t m e t h o d. T h e c o m p a r i s o n o f r e s u l t s i n d i c a t e s t h e g o o d p e r f o r m a n c e o f t h e h a r m o n y s e a r c h a l g o r i t h m i n s o l v i n g t h e p r o p o s e d m o d e l.

    Keywords: Portfolio optimization, short selling, efficient frontier, harmony search algorithm
  • 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 in term of the transfer of patients from a lower level to a higher level of health centers has been developed. Since determination the exact number of demand for health care in the future is difficult and in order to make the model close to the real conditions of demand uncertainty, a fuzzy programming model based on credibility theory is considered. To evaluate the proposed model, several numerical examples are solved in small size. In order to solve large scale problems, a meta-heuristic algorithm based on harmony search algorithm was developed in conjunction with the GAMS software which indicants the performance of the proposed algorithm.
    Keywords: Hierarchical Facility Location, Successively Inclusive, Fuzzy Credibility Theory, Harmony Search Algorithm, Health care facilities
  • Amineh Zadbood, Kazem Noghondarian, Zohreh Zadbood
    Response surface methodology is a common tool in optimizing processes. It mainly concerns situations when there is only one response of interest. However, many designed experiments often involve simultaneous optimization of several quality characteristics. This is called a Multiresponse Surface Optimization problem. A common approach in dealing with these problems is to apply desirability function approach combined with an optimization algorithm to determine the best settings of control variables. As the response surfaces are often nonlinear and complex a number of meta-heuristic search techniques have been widely for optimizing the objective function. Amongst these techniques genetic algorithm, simulated annealing, tabu search and hybridization of them have drawn a great deal of attention so far. This study presents the use of harmony search algorithm for Multiresponse surface optimization. It is one of the recently developed meta heuristic algorithms that has been successfully applied to several engineering problems. This music inspired heuristic is conceptualized from the musical process of searching for a perfect state of harmony. The performance of the algorithm is evaluated by an example from the literature. Results indicate the efficiency and outperformance of the method in comparison with some previously used methods.
    Keywords: Multiresponse surface optimization, Harmony search algorithm, metaheuristic search techniques, Response surface methodology, Design of experiment
نکته
  • نتایج بر اساس تاریخ انتشار مرتب شده‌اند.
  • کلیدواژه مورد نظر شما تنها در فیلد کلیدواژگان مقالات جستجو شده‌است. به منظور حذف نتایج غیر مرتبط، جستجو تنها در مقالات مجلاتی انجام شده که با مجله ماخذ هم موضوع هستند.
  • در صورتی که می‌خواهید جستجو را در همه موضوعات و با شرایط دیگر تکرار کنید به صفحه جستجوی پیشرفته مجلات مراجعه کنید.
درخواست پشتیبانی - گزارش اشکال