نتایج جستجو برای: meta heuristic models

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

ژورنال: دریا فنون 2019

Meta-heuristic Algorithms (MA) are widely accepted as excellent ways to solve a variety of optimization problems in recent decades. Grey Wolf Optimization (GWO) is a novel Meta-heuristic Algorithm (MA) that has been generated a great deal of research interest due to its advantages such as simple implementation and powerful exploitation. This study proposes a novel GWO-based MA and two extra fea...

The use of meta-heuristic optimization methods have become quite generic in the past two decades. This paper provides a theoretical investigation to find optimum design parameters of the Stirling heat engines using a recently presented nature-inspired method namely the gray wolf optimization (GWO). This algorithm is utilized for the maximization of the output power/thermal efficiency as well as...

Journal: :journal of medical education 0
shahram yazdani somayeh akbari farmad

background and purpose: consideringbackground and purpose: considering the importance and necessity of competency-based education at a global level and with respect to globalization and the requirement of minimum competencies in medical fields, medical education communities and organizations worldwide have tried to determine the competencies, present frameworks and education models to respond t...

Journal: :مهندسی صنایع 0
جعفر رزمی استاد دانشکده مهندسی صنایع و سیستم ها-پردیس دانشکده های فنی-دانشگاه تهران ماریا یوسفی دانش آموخته کارشناسی ارشد دانشکده مهندسی صنایع و سیستم ها-پردیس دانشکده های فنی-دانشگاه تهران

this research presents and solves a new mathematical model for school bus routing problem (sbrp). sbrp is a specific case of vehicle routing problem (vrp). despite prevalent models, this model includes location and routing simultaneously. besides, the vehicles are non-homogenous. in addition, instead of locating schools which are the depots, we consider locating bus stops that are mentioned &ap...

Khalili, Tavakkoli-Moghaddam,

  We relax some assumptions of the traditional scheduling problem and suggest an adapted meta-heuristic algorithm to optimize efficient utilization of resources and quick response to demands simultaneously. We intend to bridge the existing gap between theory and real industrial scheduling assumptions (e.g., hot metal rolling industry, chemical and pharmaceutical industries). We adapt and evalua...

From the most important issues in the design of large logistics network in times of crisis are providing a timely quick reaction for treating of injured people and the rapid distribution of medicines and medical equipment. In this paper, a multi-objective model is presented that aims to determine the location of transfer points and hospitals to provide timely quick reaction for treating injured...

The traveling salesman problem (TSP) is one of the most important combinational optimization problems that have nowadays received much attention because of its practical applications in industrial and service problems. In this paper, a hybrid two-phase meta-heuristic algorithm called MACSGA used for solving the TSP is presented. At the first stage, the TSP is solved by the modified ant colony s...

Railway scheduling is a complex task of rail operators that involves the generation of a conflict-free train timetable. This paper presents a discrete-event simulation-based optimization approach for solving the train timetabling problem to minimize total weighted unplanned stop time in a hybrid single and double track railway networks. The designed simulation model is used as a platform for ge...

Afsane Bijari Amir-Reza Abtahi

In this paper, a hybrid meta-heuristic algorithm, based on imperialistic competition algorithm (ICA), harmony search (HS), and simulated annealing (SA) is presented. The body of the proposed hybrid algorithm is based on ICA. The proposed hybrid algorithm inherits the advantages of the process of harmony creation in HS algorithm to improve the exploitation phase of the ICA algorithm. In addition...

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

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