نتایج جستجو برای: heuristic optimization
تعداد نتایج: 359675 فیلتر نتایج به سال:
This study is devoted to seismic collapse safety analysis of performance based optimally seismic designed steel chevron braced frame structures. An efficient meta-heuristic algorithm namely, center of mass optimization is utilized to achieve the seismic optimization process. The seismic collapse performance of the optimally designed steel chevron braced frames is assessed by performing incremen...
To enhance the optimization ability of ant colony optimization, this paper proposes a Bloch sphere-based quantum-inspired ant colony optimization algorithm. In the proposed approach, the positions of ants are encoded by qubits described on Bloch sphere. First, the destinations of ants are obtained by the select probability designed by the pheromone and heuristic information, and then, the movem...
تحقیق حاضر یک الگوریتم ابتکاری را برای حل مسأله محدود بهینه سازی سبد سهام با توجه به ارزش در معرض ریسک (var) به عنوان معیار ریسک و با استفاده از الگوریتم ترکیبی مورچگان و ژنتیک ارائه می دهد. در این تحقیق نشان داده خواهد شد که الگوریتم ترکیبی پیشنهادی قادر است مساله بهینه سازی سبد سهام را با توجه به معیار ارزش در معرض ریسک (var) با در نظرگرفتن محدودیت عدد صحیح برای تعداد سهام موجود در سبد سهام ...
This paper addresses a stock-cutting problem with rotation of items and without the guillotine cutting constraint. In order to solve the large-scale problem effectively and efficiently, we propose a simple but fast heuristic algorithm. It is shown that this heuristic outperforms the latest published algorithms for large-scale problem instances. Keywords—Combinatorial optimization, heuristic, la...
Recently, a number of algorithms inspired by the foraging behavior of ant colonies have been applied to the solution of difficult discrete optimization problems. In this paper we put these algorithms in a common framework by defining the Ant Colony Optimization (ACO) meta-heuristic. A couple of paradigmatic examples of applications of these novel meta-heuristic are given, as well as a brief ove...
Designing efficient physical data bases is a complex activity, involving the consideration of a large number of factors. Mathematical programming-based optimization models for physical design make many simplifying assumptions; thus, their applicability is limited. In this article, we show that heuristic algorithms can be successfully used in the development of very good, physical data base desi...
The Traveling Salesman Problem (TSP) is one of the most famous problems in combinatorial optimization. In this paper, we are going to examine how the techniques of Guided Local Search (GLS) and Fast Local Search (FLS) can be applied to the problem. Guided Local Search sits on top of local search heuristics and has as a main aim to guide these procedures in exploring efficiently and effectively ...
In this paper we present an application of ant colony optimization (ACO) to the Minimum Weighted Dominating Set Problem. We introduce a heuristic for this problem that takes into account the weights of vertexes being covered and show that it is more efficient than the greedy algorithm using the standard heuristic. Further we give implementation details of ACO applied to this problem. We tested ...
This paper discusses an approach to generate test data for path coverage based testing using Genetic Algorithms, Differential Evolution and Artificial Bee Colony optimization algorithms. Control flow graph and cyclomatic complexity of the example program has been used to find out the number of feasible paths present in the program and it is compared with the actual no of paths covered by the ev...
Deep learning (DL) is a type of machine learning that mimics the thinking patterns of a human brain to learn the new abstract features automatically by deep and hierarchi‐ cal layers. DL is implemented by deep neural network (DNN) which has multihidden layers. DNN is developed from traditional artificial neural network (ANN). However, in the training process of DL, it has certain inefficiency d...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید