نتایج جستجو برای: metaheuristic search techniques
تعداد نتایج: 896063 فیلتر نتایج به سال:
Network protocols are critical software that must be verified in order to ensure that they fulfil the requirements. This verification can be performed using model checking, which is a fully automatic technique for checking concurrent software properties in which the states of a concurrent system are explored in an explicit or implicit way. However, the state explosion problem limits the size of...
This paper presents a method for solving the optimization problems that arise in hybrid systems. These systems are characterized by a combination of continuous and discrete event systems. The proposed method aims to find optimal design configurations that satisfy a goal performance. For exploring design parameter space, the proposed method integrates a metamodel and a metaheuristic method. The ...
We propose an elitist Greedy Randomized Adaptive Search Procedure (GRASP) metaheuristic algorithm, called mGRASP/MH, for approximating the Pareto-optimal front in the multi-objective quadratic assignment problem (mQAP). The proposed algorithm is characterized by three features: elite greedy randomized construction, adaptation of search directions and cooperation between solutions. The approach ...
A typical modern optimization technique is usually either heuristic or metaheuristic. This technique has managed to solve some optimization problems in the research area of science, engineering, and industry. However, implementation strategy of metaheuristic for accuracy improvement on convolution neural networks (CNN), a famous deep learning method, is still rarely investigated. Deep learning ...
The Large Neighborhood Search metaheuristic for solving Constrained Optimization Problems has been proved to be effective on a wide range of problems. This Local Search heuristic has the particularity of using a complete search (such as Constraint Programming) to explore the large neighborhoods obtained by relaxing a fragment of the variables of the current solution. Large Neighborhood Search h...
Search-based Software Engineering has been utilized for a number of software engineering activities. One area where Search-Based Software Engineering has seen much application is test data generation. Evolutionary testing designates the use of metaheuristic search methods for test case generation. The search space is the input domain of the test object, with each individual or potential solutio...
We propose a control design scheme that aims to prevent undesirable liquid outpouring and suppress sloshing during the forward and backward tilting phases of the pouring process, for the case of liquid containers carried by manipulators. The proposed scheme combines a partial inverse dynamics controller with a PID controller, tuned with the use of a “metaheuristic” search algorithm. The “metahe...
GRASP, or greedy randomized adaptive search procedure, is a multi-start metaheuristic that repeatedly applies local search starting from solutions constructed by a randomized greedy algorithm. In this chapter we review the basic building blocks of GRASP. We cover solution construction schemes, local search methods, and the use of path-relinking as a memory mechanism in GRASP. Combinatorial opti...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید