نتایج جستجو برای: meta heuristic optimization
تعداد نتایج: 516163 فیلتر نتایج به سال:
Although meta-heuristic optimization algorithms have been used to solve many optimization problems, they still suffer from two main difficulties: What are the best parameters for a particular problem? How do we escape from the local optima? In this paper, a new, efficient meta-heuristic optimization algorithm inspired by wild dog packs is proposed. The main idea involves using three self-compet...
This study aims to forecast Iran's electricity demand by using meta-heuristic algorithms, and based on economic and social indexes. To approach the goal, two strategies are considered. In the first strategy, genetic algorithm (GA), particle swarm optimization (PSO), and imperialist competitive algorithm (ICA) are used to determine equations of electricity demand based on economic and social ind...
Assigning facilities to locations is one of the important problems, which significantly is influence in transportation cost reduction. In this study, we solve quadratic assignment problem (QAP), using a meta-heuristic algorithm with deterministic tasks and equality in facilities and location number. It should be noted that any facility must be assign to only one location. In this paper, first o...
this paper addresses a new version of the exible ow line prob- lem, i.e., the budget constrained one, in order to determine the required num- ber of processors at each station along with the selection of the most eco- nomical process routes for products. since a number of parameters, such as due dates, the amount of available budgets and the cost of opting particular routes, are imprecise (fuzz...
background: acute appendicitis is one of the common and urgent illnesses among children. children usually are unable to help the physicians completely due to weakness in describing the medical history. moreover, acute appendicitis overlaps with conditions of other diseases in terms of symptoms and signs in the first hours of presentation. these conditions lead to unwanted biases as well as err...
Meta-heuristic methods represent very powerful tools for dealing with hard combinatorial optimization problems. However, real life instances usually cannot be treated efficiently in "reasonable" computing times. Moreover, a major issue in metaheuristic design and calibration is to make them robust, i.e., to provide high performance solutions for a variety of problem settings. Parallel meta-heur...
The development of modern wide-area power systems, as well as recent trends towards the creation of sustainable energy systems have given birth to complex studies addressing technical, but also economical and environmental, aspects related to simple or multi-objective optimization problems. Recently, heuristic and metaheuristic approaches that apply combinations of different heuristics with or ...
Quadratic assignment problem (QAP) is a well-known problem in the facility location and layout. It belongs to the NP-complete class. There are many heuristic and meta-heuristic methods, which are presented for QAP in the literature. In this paper, we applied 2-opt, greedy 2-opt, 3-opt, greedy 3-opt, and VNZ as heuristic methods and tabu search (TS), simulated annealing, and particle swarm optim...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید