نتایج جستجو برای: meta heuristic algorithms
تعداد نتایج: 524177 فیلتر نتایج به سال:
In rigid plastic analysis one of the most widely applicable methods that is based on the minimum principle, is the combination of elementary mechanisms which uses the upper bound theorem. In this method a mechanism is searched which corresponds to the smallest load factor. Mathematical programming can be used to optimize this search process for simple fra...
in present paper, a point to point optimal path is planned for a mobile manipulator with flexible links and joints. for this purpose, a perfect dynamic modeling is performed for mobile manipulators considering large deformation in links, shear effects, elastic joints, effect of gravitation, and non-holonomic constraints. to study large deformation of links, non-linear relation of displacement-s...
in this study the location routing problem with fuzzy parameters is taken into account, this problem involves determining the location of the depots and routing of the vehicles in order to serve the customers. in this study a location routing problem with fuzzy travel times and due dates is considered and two objective models are proposed. the considered objectives are minimizing the total cost...
This goal of this senior design project is to implement and analyze the effectiveness of different meta-heuristic algorithms on solving two constrained optimization problems: the Bin Packing Problem and the Generalized Assignment Problem. Specifically, we are most interested in applying a certain meta-heuristic technique, the Genetic Algorithm. Although genetic algorithms have been used to solv...
Accurate solar cell modeling is essential for reliable performance evaluation and prediction, real-time control, maximum power harvest of photovoltaic (PV) systems. Nevertheless, such a model cannot always achieve satisfactory based on conventional optimization strategies caused by its high-nonlinear characteristics. Moreover, inadequate measured output current-voltage ( I-V ) data make it diff...
Retail shelf space management, which is one of the most complex aspects retailing, can be defined as determining when, where and in what quantities products will displayed dynamically updating display considering changing market conditions. Although it an important problem, research papers that study rectangular arrangement to optimize profit are limited. In this paper, we determine facing unit...
the scheduling problems are the non-polynomial problems-hard (np-hard), is to solve it, and meta-heuristic innovative method compared with the exact method require less time and memory.in this research, developed imperialistic competitive algorithm used to solving the single-mode resource-constrained project scheduling problem.also the basic feasible solution algorithm used in order to increase...
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 pa...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید