Wszystkie pola: Search Method - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Experiments concerning hashing in the multiobjective tabu search method TAMOCO
Autorzy:: Hansen, M.
Powiązania:: https://bibliotekanauki.pl/articles/206866.pdf
Data publikacji:: 2000
Wydawca:: Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:: hashing
multiobjective combinatorial optimization (MOCO)
tabu search
Opis:: This paper examines the use of hashing in the multiobjective tabu search, TAMOCO. The hasliing method was suggested by Woodruff and Zemel (1993) as a method of avoiding return to the already examined solutions in the standard single-objective tabu search. While the traditional tabu list is capable of insuring this, it can normally only be used for cycles of a moderate length. The hashing method, however, can efficiently avoid cycles over a much larger number of iterations and must be considered a natural component in the tabu search tool-box. We report from two experiments on practical models where the hashing component has been included into the TAMOCO-procedure ; with two different outcomes.
Źródło:: Control and Cybernetics; 2000, 29, 3; 789-798
0324-8569
Pojawia się w:: Control and Cybernetics
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 2.

Tytuł:: Genetic algorithm combined with a local search method for identifying susceptibility genes
Autorzy:: Yang, C -H.
Moi, S. -H.
Lin, Y. -D.
Chuang, L. -Y.
Powiązania:: https://bibliotekanauki.pl/articles/91586.pdf
Data publikacji:: 2016
Wydawca:: Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
Tematy:: genetic algorithms
identifying susceptibility genes
local search algorithm
Opis:: Detecting genetic association models between single nucleotide polymorphisms (SNPs) in various disease-related genes can help to understand susceptibility to disease. Statistical tools have been widely used to detect significant genetic association models, according to their related statistical values, including odds ratio (OR), chi-square test (χ2), p-value, etc. However, the high number of computations entailed in such operations may limit the capacity of such statistical tools to detect high-order genetic associations. In this study, we propose lsGA algorithm, a genetic algorithm based on local search method, to detect significant genetic association models amongst large numbers of SNP combinations. We used two disease models to simulate the large data sets considering the minor allele frequency (MAF), number of SNPs, and number of samples. The three-order epistasis models were evaluated by chi-square test (χ2) to evaluate the significance (P-value < 0.05). Analysis results showed that lsGA provided higher chi-square test values than that of GA. Simple linear regression indicated that lsGA provides a significant advantage over GA, providing the highest β values and significant p-value.
Źródło:: Journal of Artificial Intelligence and Soft Computing Research; 2016, 6, 3; 203-212
2083-2567
2449-6499
Pojawia się w:: Journal of Artificial Intelligence and Soft Computing Research
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 3.

Tytuł:: A Search Method for Reassembling the Elements of a Broken 2D Object
Autorzy:: Montusiewicz, Jerzy
Skulimowski, Stanisław
Powiązania:: https://bibliotekanauki.pl/articles/102654.pdf
Data publikacji:: 2020
Wydawca:: Stowarzyszenie Inżynierów i Techników Mechaników Polskich
Tematy:: reassembling
exhaustive search
contour description
linguistic methods
puzzle
apictorial
wyczerpujące wyszukiwanie
opis konturu
ponowne złożenie
metody językowe
Opis:: Searching for and reassembling the elements that used to form one whole is a very common issue faced by archaeologists. This is because preparing an interesting museum exhibition consists in the presentation of the objects that have been put together, not a pile of messily disassembled puzzle pieces. The article presents the concept of using the linguistic methods in the process of joining the elements of a 2D jigsaw puzzle. The method developed in the first stage creates the edge description of an object by defined unit vectors of the same length but different directions, and assigns them a designation in the form of letters, which leads to the creation of abstract words in the form of a sequence of signs. In the second stage, the words with a defined length of strings belonging to two different objects are compared. The authors have created a program that performs an exhaustive search until the pool of available elements is fully exhausted. The conducted numerical experiments indicate the correctness of the method and effectiveness in determining the places of joining elements. The developed method will be useful to automate the reassembly of 2D elements from archaeological excavations.
Źródło:: Advances in Science and Technology. Research Journal; 2020, 14, 3; 49-56
2299-8624
Pojawia się w:: Advances in Science and Technology. Research Journal
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 4.

Tytuł:: Optymalizacja kosztów transportu metodą bezpośredniego poszukiwania
Optimization of cost transport by direct search method
Autorzy:: Winiczenko, R.
Powiązania:: https://bibliotekanauki.pl/articles/227638.pdf
Data publikacji:: 2009
Wydawca:: Wyższa Szkoła Menedżerska w Warszawie
Tematy:: optymalizacja kosztów transportu
metoda bezpośredniegi poszukiwania
optimization of cost transport
direct search method
Opis:: Celem artykułu jest prezentacja ogólnej zasady działania metody bezpośredniego poszukiwania oraz jej zastosowanie w liniowym problemie transportowym. W przeciwieństwie do tradycyjnych metod szukania punktu minimum, w których dla znalezienia minimum wykorzystuje się informację o gradiencie funkcji celu lub o pochodnych różnego rzędu, w algorytmie metody bezpośredniego poszukiwania analizuje się wprowadzony zbiór punktów wokół bieżącego punktu. Algorytm bezpośredniego poszukiwania może być zastosowany do zadań związanych z kosztami stałymi, zmiennymi ograniczeniami w postaci równań i nierówności czy wymaganiami dotyczącymi źródeł zaopatrzenia. Powyższe zadania często występują w różnych gałęziach przemysłowych, w tym również w branży spożywczej.
Direct search is a method for solving optimization problems which does not require any information about the gradient of the objective function. Unlike more traditional optimization methods which use information about the gradient or higher derivatives to search for an optimal point, a direct search algorithm searches a set of points around the current point, looking for one where the value of the objective function is lower than the value at the current point. The paper presents a general principle of direct search method operation and their application in cost transportation problem in food industry.
Źródło:: Postępy Techniki Przetwórstwa Spożywczego; 2009, 1; 133-136
0867-793X
2719-3691
Pojawia się w:: Postępy Techniki Przetwórstwa Spożywczego
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 5.

Tytuł:: A hybrid maximum power point search method using temperature measurements in partial shading conditions
Autorzy:: Mroczka, J.
Ostrowski, M.
Powiązania:: https://bibliotekanauki.pl/articles/221430.pdf
Data publikacji:: 2014
Wydawca:: Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:: maximum power point
partial shading
perturb and observe
temperature measurement
Opis:: Photovoltaic panels have a non-linear current-voltage characteristics to produce the maximum power at only one point called the maximum power point. In the case of the uniform illumination a single solar panel shows only one maximum power, which is also the global maximum power point. In the case an irregularly illuminated photovoltaic panel many local maxima on the power-voltage curve can be observed and only one of them is the global maximum. The proposed algorithm detects whether a solar panel is in the uniform insolation conditions. Then an appropriate strategy of tracking the maximum power point is taken using a decision algorithm. The proposed method is simulated in the environment created by the authors, which allows to stimulate photovoltaic panels in real conditions of lighting, temperature and shading.
Źródło:: Metrology and Measurement Systems; 2014, 21, 4; 733-740
0860-8229
Pojawia się w:: Metrology and Measurement Systems
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 6.

Tytuł:: Minimizing length in a mixed model two sided assembly line using exact search method
Autorzy:: Yadav, Ashish
Verma, Pawan
Agrawal, Sunil
Powiązania:: https://bibliotekanauki.pl/articles/406705.pdf
Data publikacji:: 2019
Wydawca:: Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:: two-sided assembly line balancing
mixed model
mathematical model
lingo-17 solver
Opis:: In the two-sided mixed-model assembly line, there is a process of installing two single stations in each position left and right of the assembly line with the combining of the product model. The main aim of this paper is to develop a new mathematical model for the mixed model two-sided assembly line balancing (MTALB) generally occurs in plants producing large-sized high-volume products such as buses or trucks. According to the literature review, authors focus on research gap that indicate in MTALB problem, minimize the length of the line play crucial role in industry space optimization.In this paper, the proposed mathematical model is applied to solve benchmark problems of two-sided mixed-model assembly line balancing problem to maximize the workload on each workstation which tends to increase the compactness in the beginning workstations which also helps to minimize the length of the line. Since the problem is well known as np-hard problem benchmark problem is solved using a branch and bound algorithm on lingo 17.0 solver and based on the computational results, station line eﬀectiveness and eﬃciency that is obtained by reducing the length of the line in mated stations of the assembly line is increased.
Źródło:: Management and Production Engineering Review; 2019, 10, 4; 72-80
2080-8208
2082-1344
Pojawia się w:: Management and Production Engineering Review
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 7.

Tytuł:: Optimal point to point path planning of flexible manipulator under large deformation by using harmony search method
Autorzy:: Esfandiar, H.
Korayem, M. H.
Powiązania:: https://bibliotekanauki.pl/articles/280605.pdf
Data publikacji:: 2016
Wydawca:: Polskie Towarzystwo Mechaniki Teoretycznej i Stosowanej
Tematy:: meta-heuristic optimization
harmony search
large deformation
flexible manipulator
Opis:: This paper aims at planning an optimal point to point path for a flexible manipulator under large deformation. For this purpose, the researchers use a direct method and meta-heuristic optimization process. In this paper, the maximum load carried by the manipulator and the minimum transmission time are taken as objective functions of the optimization process to get optimal path profiles. Kinematic constraints, the maximum velocity and acceleration, the dynamic constraint of the maximum torque applied to the arms and also the constraint of final point accuracy are discussed. For the optimization process, the Harmony Search (HS) method is used. To evaluate the effectiveness of the approach proposed, simulation studies are reviewed by considering a two-link flexible manipulator with the fixed base. The findings indicate that the proposed method is in power of dealing with nonlinear dynamics of the system. Furthermore, the results obtained by rigid, small and large deformation models are compared with each other.
Źródło:: Journal of Theoretical and Applied Mechanics; 2016, 54, 1; 179-193
1429-2955
Pojawia się w:: Journal of Theoretical and Applied Mechanics
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 8.

Tytuł:: Solving some deterministic finite horizon inventory models
Autorzy:: Sinha, P.
Powiązania:: https://bibliotekanauki.pl/articles/406508.pdf
Data publikacji:: 2013
Wydawca:: Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
Tematy:: inventory
finite horizon
globally optimal solution
search method
Opis:: Two single-item, deterministic, continuous, finite horizon inventory models having no shortage have been considered. A demand rate function, which is relatively general, for the item has been assumed. In the first model, units of the item do not deteriorate; while in the second units deteriorate in a constant fraction rate. Some optimality conditions are shown for the models. Based on these properties, single variable search methods have been described to obtain globally optimal solutions. Numerical experiments indicate that the methods yield acceptable solutions within small time and are suitable for practical applications.
Źródło:: Operations Research and Decisions; 2013, 23, 1; 63-74
2081-8858
2391-6060
Pojawia się w:: Operations Research and Decisions
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 9.

Tytuł:: Learning Search Algorithms: An Educational View
Autorzy:: Janota, M.
Šimák, V.
Hrbček, J.
Powiązania:: https://bibliotekanauki.pl/articles/116502.pdf
Data publikacji:: 2014
Wydawca:: Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
Tematy:: Search Algorithm
Learning Search Algorithms
educational view
Artificial Intelligence Method
Search Method
Labyrinth
Dijkstra algorithm
Opis:: Artificial intelligence methods find their practical usage in many applications including maritime industry. The paper concentrates on the methods of uninformed and informed search, potentially usable in solving of complex problems based on the state space representation. The problem of introducing the search algorithms to newcomers has its technical and psychological dimensions. The authors show how it is possible to cope with both of them through design and use of specialized authoring systems. A typical example of searching a path through the maze is used to demonstrate how to test, observe and compare properties of various search strategies. Performance of search methods is evaluated based on the common criteria.
Źródło:: TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2014, 8 no. 4; 565-570
2083-6473
2083-6481
Pojawia się w:: TransNav : International Journal on Marine Navigation and Safety of Sea Transportation
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 10.

Tytuł:: Cellular particle swarm optimization with a simple adaptive local search strategy for the permutation flow shop scheduling problem
Autorzy:: Seck-Tuoh-Mora, Juan C.
Medina-Marin, Joselito
Martinez-Gomez, Erick S.
Hernandez-Gress, Eva S.
Hernandez-Romero, Norberto
Volpi-Leon, Valeria
Powiązania:: https://bibliotekanauki.pl/articles/230060.pdf
Data publikacji:: 2019
Wydawca:: Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:: flow shop
particle swarm optimization (PSO)
local search strategy
hybrid search method
cellular automata
scheduling
Opis:: Permutation flow shop scheduling problem deals with the production planning of a number of jobs processed by a set of machines in the same order. Several metaheuristics have been proposed for minimizing the makespan of this problem. Taking as basis the previous Alternate Two-Phase PSO (ATPPSO) method and the neighborhood concepts of the Cellular PSO algorithm proposed for continuous problems, this paper proposes the improvement of ATPPSO with a simple adaptive local search strategy (called CAPSO-SALS) to enhance its performance. CAPSO-SALS keeps the simplicity of ATPPSO and boosts the local search based on a neighborhood for every solution. Neighbors are produced by interchanges or insertions of jobs which are selected by a linear roulette scheme depending of the makespan of the best personal positions. The performance of CAPSO-SALS is evaluated using the 12 different sets of Taillard’s benchmark problems and then is contrasted with the original and another previous enhancement of the ATPPSO algorithm. Finally, CAPSO-SALS is compared as well with other ten classic and state-of-art metaheuristics, obtaining satisfactory results.
Źródło:: Archives of Control Sciences; 2019, 29, 2; 205-226
1230-2384
Pojawia się w:: Archives of Control Sciences
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Informacja

Wyszukujesz frazę "Search Method" wg kryterium: Wszystkie pola

Źródło danych

Dostawca treści

Kolekcja

Rok wydania

Wydawca

Temat

Autor

Typ dokumentu

Język