Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "Tabu Search" wg kryterium: Temat

  Lista filtrów
Wyrównaj
Wyświetlanie 1-15 z 38
Tytuł:
Scheduling with high variety of customized compound products
Autorzy:
Smutnicki, Cz.
Powiązania:
https://bibliotekanauki.pl/articles/1203939.pdf
Data publikacji:
2007
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
scheduling
tabu search
Opis:
Domestic appliance is an instance of manufacturing various products on clients demand with frequent changes of production. Although the technological process for each individual product is relatively simply, the variety of products, mixed orders, frequent machines changeovers, machines with unusual service policy, lack or limited storage, etc., generates quite nontrivial planning, batching and scheduling problems and furthermore of a huge size. In this paper, we present specific real process of production of refrigerators, mathematical and graph models of the problem and an outline of solution algorithm, based the on local search approach.
Źródło:
Decision Making in Manufacturing and Services; 2007, 1, 1-2; 91-110
1896-8325
2300-7087
Pojawia się w:
Decision Making in Manufacturing and Services
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Tabu search for the RNA partial degradation problem
Autorzy:
Rybarczyk, A.
Hertz, A.
Kasprzak, M.
Blazewicz, J.
Powiązania:
https://bibliotekanauki.pl/articles/330324.pdf
Data publikacji:
2017
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
RNA degradation
tabu search
bioinformatics
rozkład RNA
algorytm tabu search
bioinformatyka
Opis:
In recent years, a growing interest has been observed in research on RNA (ribonucleic acid), primarily due to the discovery of the role of RNA molecules in biological systems. They not only serve as templates in protein synthesis or as adapters in the translation process, but also influence and are involved in the regulation of gene expression. The RNA degradation process is now heavily studied as a potential source of such riboregulators. In this paper, we consider the so-called RNA partial degradation problem (RNA PDP). By solving this combinatorial problem, one can reconstruct a given RNA molecule, having as input the results of the biochemical analysis of its degradation, which possibly contain errors (false negatives or false positives). From the computational point of view the RNA PDP is strongly NP-hard. Hence, there is a need for developing algorithms that construct good suboptimal solutions. We propose a heuristic approach, in which two tabu search algorithms cooperate, in order to reconstruct an RNA molecule. Computational tests clearly demonstrate that the proposed approach fits well the biological problem and allows to achieve near-optimal results. The algorithm is freely available at http://www.cs.put.poznan.pl/arybarczyk/tabusearch.php.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2017, 27, 2; 401-415
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Solving multi-objective production scheduling problems with Tabu Search
Autorzy:
Loukil, T.
Teghem, J.
Fortemps, P.
Powiązania:
https://bibliotekanauki.pl/articles/206202.pdf
Data publikacji:
2000
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
multiple criteria
scheduling
tabu search
Opis:
Most of multiple criteria scheduling problems are NP-hard, so that exact procedures can only solve small problems and with two criteria. The complexity and the diversity of multiple criteria scheduling problems resulted in many alternative approaches to solve them. Exact and approximate procedures proposed in the literature are mainly dedicated to the problem to be solved and their performance depends on the problem data, on the criteria optimized, and are generally difficult to implement. We propose in this paper a Tabu Search approach to multiple criteria scheduling problems. The proposed procedure is a general flexible method, able to solve hard multiple criteria scheduling problems, easy to implement, and providing a set of potential efficient schedules. The criteria are any combination chosen from (C[sub max],T[sub max], L, N[sub T] and F).
Źródło:
Control and Cybernetics; 2000, 29, 3; 819-828
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Selecting a good configuration of one-way and two-way routes using tabu search
Autorzy:
Drezner, Z.
Salhi, S.
Powiązania:
https://bibliotekanauki.pl/articles/206880.pdf
Data publikacji:
2000
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
metaheuristics
network design
tabu search
Opis:
The problem of designing a near optimal configuration of a system of one-way and two-way routes is investigated. Each arc of the network can be designed as either a two-way arc or a one-way arc in one of the two directions. The traffic speed on a one-way arc is faster than the speed on a two-way arc by a given factor. The problem is to design a network which minimizes total travel time between all pairs of nodes by the proper selection of one-way and two-way arcs. Efficient implementations of the metaheuristic tabu search are designed for solving this network design problem. These approaches are tested on a set of network problems with encouraging results.
Źródło:
Control and Cybernetics; 2000, 29, 3; 725-740
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Tabu search - a guided tour
Autorzy:
Hindsberger, M.
Vidal, R.
Powiązania:
https://bibliotekanauki.pl/articles/205563.pdf
Data publikacji:
2000
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
combinatorial optimization
local search
metaheuristics
tabu search
Opis:
The main purpose of this paper is to provide an overview of the ideas behind Tabu Search - one of the most popular metaheuristic appoaches. For the sake of concreteness a simple example of the traveling salesman problem will be used in the discussion to illustrate the process of designing a Tabu Search algorithm. In addition, some extensions will be presented. Finally, applications will also be provided as well as references to more specialized publications.
Źródło:
Control and Cybernetics; 2000, 29, 3; 631-651
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Ship Collision Avoidance by Distributed Tabu Search
Autorzy:
Kim, D.
Hirayama, K.
Okimoto, M.
Powiązania:
https://bibliotekanauki.pl/articles/116919.pdf
Data publikacji:
2015
Wydawca:
Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
Tematy:
Safety of Navigation
Collision Avoidance
Distributed Tabu Search Algorithm (DTSA)
Distributed Local Search Algorithm (DLSA)
Quasi-Local Minimum (QLM)
Tabu Search Algorithm
Local Search Algorithm
Distributed Tabu Search
Opis:
More than 90% of world trade is transported by sea. The size and speed of ships is rapidly increasing in order to boost economic efficiency. If ships collide, the damage and cost can be astronomical. It is very difficult for officers to ascertain routes that will avoid collisions, especially when multiple ships travel the same waters. There are several ways to prevent ship collisions, such as lookouts, radar, and VHF radio. More advanced methodologies, such as ship domain, fuzzy theory, and genetic algorithm, have been proposed. These methods work well in one-on-one situations, but are more difficult to apply in multiple-ship situations. Therefore, we proposed the Distributed Local Search Algorithm (DLSA) to avoid ship collisions as a precedent study. DLSA is a distributed algorithm in which multiple ships communicate with each other within a certain area. DLSA computes collision risk based on the information received from neighboring ships. However, DLSA suffers from Quasi-Local Minimum (QLM), which prevents a ship from changing course even when a collision risk arises. In our study, we developed the Distributed Tabu Search Algorithm (DTSA). DTSA uses a tabu list to escape from QLM that also exploits a modified cost function and enlarged domain of next-intended courses to increase its efficiency. We conducted experiments to compare the performance of DLSA and DTSA. The results showed that DTSA outperformed DLSA.
Źródło:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2015, 9, 1; 23-29
2083-6473
2083-6481
Pojawia się w:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Tabu Search for target-radar assignment
Autorzy:
Hindsberger, M.
Vidal, R.
Powiązania:
https://bibliotekanauki.pl/articles/205568.pdf
Data publikacji:
2000
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
assignment
combinatorial optimization
metaheuristics
tabu search
Opis:
In this paper the problem of assigning air-defense illumination radars to enemy targets is presented. A Tabu Search metaheuristic solution is described and the results achieved are compared to those of other heuristic approaches. Implementation and experimental aspects are discussed. It is argued that Tabu Search could be used in near realtime decision making systems.
Źródło:
Control and Cybernetics; 2000, 29, 3; 701-724
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Tabu Search Algorithm for Survivable Network Design Problem with Simultaneous Unicast and Anycast Flows
Autorzy:
Gładysz, J.
Walkowiak, K.
Powiązania:
https://bibliotekanauki.pl/articles/226174.pdf
Data publikacji:
2010
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
anycast
network design
tabu search
survivability
Opis:
In this work we focus on the problem of survivable network design for simultaneous unicast and anycast flows. This problem follows from the growing popularity of network services applying the anycast paradigm. The anycasting is defined as one-to-one-of-many transmission and is applied in Domain Name Service (DNS), peer-to-peer (P2P) systems, Content Delivery Networks (CDN). In this work we formulate two models that enables joint optimization of network capacity, working and backup connections for both unicast and anycast flows. The goal is to minimize the network cost required to protect the network against failures using the single backup path approach. In the first model we consider modular link cost, in the second we are given a set of link proposal and we must select only one of them. Because these problems are NP-hard, therefore optimal solutions of branch-and-bounds or branch-and-cut methods can be generated for relatively small networks. Consequently, we propose a new heuristic algorithm based on Tabu Search method. We present results showing the effectiveness the proposed heuristic compared against optimal results. Moreover, we report results showing that the use of anycast paradigm can reduce the network cost.
Źródło:
International Journal of Electronics and Telecommunications; 2010, 56, 1; 41-47
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
SO(3) matrix transformation for rapid polarization search and coding in a three-plate polarizer
Autorzy:
Huang, C
Wang, X
Powiązania:
https://bibliotekanauki.pl/articles/174349.pdf
Data publikacji:
2015
Wydawca:
Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
Tematy:
SO(3) transformer
tabu search
polarization coding
Opis:
A SO(3) transformer of a three-plate polarizer is adopted to rapidly achieve the transformation of the polarized state. The polarization coding based on Stokes components S2 and S3 is analyzed and demonstrated. Tabu search algorithm is used to accelerate the transformation of the polarized state by utilizing Mueller matrix roots decomposition to decompose the SO(3) matrix, and substituting first order Taylor series approximations for the trigonometric functions in the SO(3) matrix. The results show that bias voltage is less than 120 V in the coding zone. The search speed of our algorithm is faster than the one without first order Taylor series approximations by 4 times.
Źródło:
Optica Applicata; 2015, 45, 1; 101-112
0078-5466
1899-7015
Pojawia się w:
Optica Applicata
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Fundamentals of scatter search and path relinking
Autorzy:
Glover, F.
Laguna, M.
Marti, R.
Powiązania:
https://bibliotekanauki.pl/articles/205907.pdf
Data publikacji:
2000
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
optymalizacja
evolutionary methods
metaheuristics
optimization
tabu search
Opis:
The evolutionary approach called Scatter Search, and its generalized form called Path Relinking, have proved unusually effective for solving a diverse array of optimization problems from both classical and real world settings. Scatter Search and Path Relinking differ from other evolutionary procedures, such as genetic algorithms, by providing unifying principles for joining solutions based on generalized path constructions (in both Euclidean and neighborhood spaces) and by utilizing strategic designs where other approaches resort to randomization. Scatter Search and Path Relinking are also intimately related to the Tabu Search metaheuristic, and derive additional advantages by making use of adaptive memory and associated memory-exploiting mechanisms that are capable of being adapted to particular contexts. We describe the features of Scatter Search and Path Relinking that set them apart from other evolutionary approaches, and that offer opportunities for creating increasingly more versatile and effective methods in the future.
Źródło:
Control and Cybernetics; 2000, 29, 3; 653-684
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Integrating pivot based search with branch and bound for binary MIPs
Autorzy:
Lokketangen, A.
Woodruff, D.
Powiązania:
https://bibliotekanauki.pl/articles/206756.pdf
Data publikacji:
2000
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
branch and bound
chunking
heuristics
tabu search
Opis:
This paper examines integration of a sophisticated, pivot-based tabu search into branch and bound for 0-1 MIPS and global diversification tests using chunking. Issues related to behavior of a tabu search within a branch and bound algorithm are analyzed using computational experiments. Results are presented showing that the inclusion of the local search sometimes results in fewer and nodes and lower CPU times even when used in a callback mode. The main benefit in incorporating a pivot based heuristic is that an integer feasible solution can be found earlier in the branching process. Computational experiments are presented showing that for some instances the overall search time is improved, while for some others the tabu search can find good solutions quickly.
Źródło:
Control and Cybernetics; 2000, 29, 3; 741-759
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
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ł
Tytuł:
A support vector machine with the tabu search algorithm for freeway incident detection
Autorzy:
Yao, B.
Hu, P.
Zhang, M.
Jin, M.
Powiązania:
https://bibliotekanauki.pl/articles/329943.pdf
Data publikacji:
2014
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
automated incident detection
support vector machine (SVM)
tabu search
freeway
maszyna wektorów wspierających
odcinek swobodny trasy
algorytm tabu search
Opis:
Automated Incident Detection (AID) is an important part of Advanced Traffic Management and Information Systems (ATMISs). An automated incident detection system can effectively provide information on an incident, which can help initiate the required measure to reduce the influence of the incident. To accurately detect incidents in expressways, a Support Vector Machine (SVM) is used in this paper. Since the selection of optimal parameters for the SVM can improve prediction accuracy, the tabu search algorithm is employed to optimize the SVM parameters. The proposed model is evaluated with data for two freeways in China. The results show that the tabu search algorithm can effectively provide better parameter values for the SVM, and SVM models outperform Artificial Neural Networks (ANNs) in freeway incident detection.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2014, 24, 2; 397-404
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An adaptive hybrid metaheuristic for permutation flowshop scheduling
Autorzy:
Moccellin, J.
Santos, M.
Powiązania:
https://bibliotekanauki.pl/articles/206870.pdf
Data publikacji:
2000
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
flowshop sequencing
hybrid metaheuristics
simulated annealing
tabu search
Opis:
In this paper we present a hybrid Tabu Search - Simulated Annealing heuristic fox the minimal makespan flowshop sequencing problem. In order to evaluate the effectiveness of the hybridization we compare the hybrid metaheuristic with pure Tabu Search and Simulated Annealing heuristics. The results from computational experience are discussed.
Źródło:
Control and Cybernetics; 2000, 29, 3; 761-771
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Problem-Independent Approach to Multiprocessor Dependent Task Scheduling
Autorzy:
Król, D.
Zydek, D.
Koszałka, L.
Powiązania:
https://bibliotekanauki.pl/articles/226364.pdf
Data publikacji:
2012
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
tasks scheduling
DAG
genetic algorithm
tabu search
makespan
Opis:
This paper concerns Directed Acyclic Graph task scheduling on parallel executors. The problem is solved using two new implementations of Tabu Search and genetic algorithm presented in the paper. A new approach to solution coding is also introduced and implemented in both metaheuristics algorithms. Results given by the algorithms are compared to those generated by greedy LPT and SS-FF algorithms; and HAR algorithm. The analysis of the obtained results of multistage simulation experiments confirms the conclusion that the proposed and implemented algorithms are characterized by very good performance and characteristics.
Źródło:
International Journal of Electronics and Telecommunications; 2012, 58, 4; 369-379
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 38

Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies