نتایج جستجو برای: heuristic differential evolution algorithm is developed for solving real

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

2004
M. Fatih Tasgetiren Yun-Chia Liang Mehmet Sevkli Gunes Gencyilmaz

This paper presents a differential evolution algorithm to solve the permutaion flowshop sequencing problem with makespan criterion. Differential evolution is one of the latest evolutionary optmization algorithm applied to continuous optimization problems where members of population use chromosomes based on floating-point numbers to represent candidate solutions. In this paper we also present a ...

Journal: :iranian journal of science and technology transactions of mechanical engineering 2015
w. z. zhao c. y. wang z. q. zhang

differential steering of in-wheel electric vehicle provides the functions of both active steering and power assisted steering with the coupling control of force and displacement transfer characteristic of system. a collaborative optimization model of the differential power-assisted steering system of in-wheel electric vehicle is built, with steering economy as the main system optimization goal,...

2014
B.VENKATESWARA RAO G.V.NAGESH KUMAR

This paper presents a new metaheuristic algorithm called BAT search Algorithm (BAT). The BAT search algorithm is used to solve Optimal Power Flow (OPF) problem with the Thyristor Controlled Series Capacitor (TCSC). The TCSC is used to reduce the transmission line losses and improve the voltage profile of the power system. The effectiveness of the BAT Algorithm has been tested for various bus sy...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه علوم و معارف قرآن کریم - دانشکده علوم قرآنی قم 1389

worship is submission and humitility with believe to divinity in fornt of god. in jewish religion ,worship is submission of the god inall the ordes and devosion tohim .worshio is not only so widely in islam and jew and does not include pray and fast and etc but also is every action that human does with divine intention and to content him. worship has huge and excellent rank in qoran and old te...

Journal: :journal of algorithms and computation 0
s. jabari university of tehran, department of algorithms and computation. dara moazzami university of tehran, college of engineering, faculty of engineering science a. ghodousian university of tehran, college of engineering, faculty of engineering science

in this paper, we study the generalized bin covering problem. for this problem an exact algorithm is introduced which can nd optimal solution for small scale instances. to nd a solution near optimal for large scale instances, a heuristic algorithm has been proposed. by computational experiments, the eciency of the heuristic algorithm is assessed.

2005
Karin Zielinski Dagmar Peters Rainer Laur

Most real-world optimization problems include multiple objective functions and several constraints. The Differential Evolution algorithm was initially developed for unconstrained single-objective problems and was shown to be a fast, simple algorithm. In order to utilize these advantages in real-world problems it was adapted for multi-objective optimization recently. In this work a multi-objecti...

O. Hasançebi, O. K. Erol, S. Kazemzadeh Azad,

Engineering optimization needs easy-to-use and efficient optimization tools that can be employed for practical purposes. In this context, stochastic search techniques have good reputation and wide acceptability as being powerful tools for solving complex engineering optimization problems. However, increased complexity of some metaheuristic algorithms sometimes makes it difficult for engineers t...

Journal: :International Journal on Artificial Intelligence Tools 2002
Hussein A. Abbass Ruhul A. Sarker

The use of evolutionary algorithms (EAs) to solve problems with multiple objectives (known as Vector Optimization Problems (VOPs)) has attracted much attention recently. Being population based approaches, EAs offer a means to find a group of pareto–optimal solutions in a single run. Differential Evolution (DE) is an EA that was developed to handle optimization problems over continuous domains. ...

A. Khoshnava M.R. Mozaffari

Transportation problem is a linear programming which considers minimum cost for shipping a product from some origins to other destinations such as from factories to warehouse, or from a warehouse to supermarkets. To solve this problem simplex algorithmis utilized. In real projects costs and the value of supply and demands are fuzzy numbers and it is expected that optimal solutions for determini...

Mani Sharifi, Mehdi Yazdani, Mohammad Jafar Tarokh, Mohammad Navid Mokhtarian

Task assignment problem (TAP) involves assigning a number of tasks to a number of processors in distributed computing systems and its objective is to minimize the sum of the total execution and communication costs, subject to all of the resource constraints. TAP is a combinatorial optimization problem and NP-complete. This paper proposes a hybrid meta-heuristic algorithm for solving TAP in a ...

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

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