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 42
Tytuł:
Cluster Based Optimization of Routing in Distributed Sensor Networks Using Bayesian Networks with Tabu Search
Autorzy:
Bhajantri, L. B.
Nalini, N.
Powiązania:
https://bibliotekanauki.pl/articles/226310.pdf
Data publikacji:
2014
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
Distributed Sensor Networks
routing
cluster head
Bayesian Network
tabu search
Opis:
Distributed Sensor Networks (DSNs) have attracted significant attention over the past few years. A growing list of many applications can employ DSNs for increased effectiveness especially in hostile and remote are as. In all application salargen umber of sensors are expected and requiring careful architecture and management of the net work. Grouping nodes in toclusters has been the most popular approach for support scalability in DSN. This paper proposes acluster based optimization of routing in DSN by employing a Bayesi an network (BN) with Tabu search (TS) approach. BN based approach is used to select efficient cluster head sand construction of BN for the proposed scheme. This approach in corporates energy level of each node, band width and link efficiency. The optimization of routing is considered as a design issue in DSN due to lack of energy consumption, delay and maximum time required for data transmission between source nodes (cluster heads) to sink node. In this work optimization of routing takes place through cluster head nodes by using TS. Simulations have been conducted to compare the performance of the proposed approach with LEACH protocol. The objective of the proposed work is to improve the performance of network in terms of energy consumption, through put, packet delivery ratio, and time efficiency of optimization of routing. The results hows that the proposed approach perform better than LEACH protocol that utilizes minimum energy, latency for cluster formation and reduce over head of the protocol.
Źródło:
International Journal of Electronics and Telecommunications; 2014, 60, 2; 199-208
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Automatic parametric fault detection in complex analog systems based on a method of minimum node selection
Autorzy:
Bilski, A.
Wojciechowski, J.
Powiązania:
https://bibliotekanauki.pl/articles/330761.pdf
Data publikacji:
2016
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
complex analog system
support vector machine (SVM)
tabu search
genetic algorithm
parametric fault detection
system analogowy
maszyna wektorów wspierających
metoda tabu search
algorytm genetyczny
detekcja uszkodzeń
Opis:
The aim of this paper is to introduce a strategy to find a minimal set of test nodes for diagnostics of complex analog systems with single parametric faults using the support vector machine (SVM) classifier as a fault locator. The results of diagnostics of a video amplifier and a low-pass filter using tabu search along with genetic algorithms (GAs) as node selectors in conjunction with the SVM fault classifier are presented. General principles of the diagnostic procedure are first introduced, and then the proposed approach is discussed in detail. Diagnostic results confirm the usefulness of the method and its computational requirements. Conclusions on its wider applicability are provided as well.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2016, 26, 3; 655-668
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Harmonogramowanie robót budowlanych w systemie potokowym z niepewnymi danymi
Construction scheduling with tabu search algorithm and uncertain data
Autorzy:
Bożejko, W.
Hejducki, Z.
Rogalska, M.
Rajba, P.
Wodecki, M.
Powiązania:
https://bibliotekanauki.pl/articles/347653.pdf
Data publikacji:
2012
Wydawca:
Akademia Wojsk Lądowych imienia generała Tadeusza Kościuszki
Tematy:
niepewne dane
stabilność
harmonogramowanie
przeszukiwanie z tabu
roboty budowlane
uncertain data
stability
scheduling
tabu search
construction works
Opis:
W pracy rozpatrujemy problem harmonogramowania przedsięwzięć budowlanych realizowanych w systemie potokowym. Są to bardzo ważne zagadnienia praktyki budowlanej, mające znaczący i bezpośredni wpływ na ostateczne koszty realizacji. Przedstawiamy założenia do harmonogramowania robót, algorytm jego rozwiązywania opartego na metodzie przeszukiwania z tabu (ang. tabu search) oraz jego modyfikację dla przypadku, gdy niepewne są czasy wykonywania prac. Porównujemy stabilność rozwiązań w przypadku, gdy niepewne dane są reprezentowane przez zmienne losowe o rozkładzie normalnym lub liczby rozmyte w trzypunktowej reprezentacji.
This paper deals with some problems of synchronizing construction activities differing in their execution times. The methodology of calculating the times of execution of the activities, ensuring that there will be no collisions between them, is presented. The methodology is illustrated with numerical examples showing the successive steps of the algorithm and it is applied to complex works modelled as the flow shop problem. The tabu search algorithm is adapted to solve the problem.
Źródło:
Zeszyty Naukowe / Wyższa Szkoła Oficerska Wojsk Lądowych im. gen. T. Kościuszki; 2012, 4; 80-95
1731-8157
Pojawia się w:
Zeszyty Naukowe / Wyższa Szkoła Oficerska Wojsk Lądowych im. gen. T. Kościuszki
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Stable scheduling of single machine with probabilistic parameters
Autorzy:
Bożejko, W.
Rajba, P.
Wodecki, M.
Powiązania:
https://bibliotekanauki.pl/articles/200225.pdf
Data publikacji:
2017
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
scheduling
uncertain parameters
tabu search
stability
planowanie
niepewne parametry
stabilność
przeszukiwanie tabu
Opis:
We consider a stochastic variant of the single machine total weighted tardiness problem jobs parameters are independent random variables with normal or Erlang distributions. Since even deterministic problem is NP-hard, it is difficult to find global optimum for large instances in the reasonable run time. Therefore, we propose tabu search metaheuristics in this work. Computational experiments show that solutions obtained by the stochastic version of metaheuristics are more stable (i.e. resistant to data disturbance) than solutions generated by classic, deterministic version of the algorithm.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2017, 65, 2; 219-231
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Off-line and dynamic production scheduling - a comparative case study
Autorzy:
Bożek, A.
Wysocki, M.
Powiązania:
https://bibliotekanauki.pl/articles/406687.pdf
Data publikacji:
2016
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
flexible job shop
lot streaming
off-line scheduling
dynamic scheduling
tabu search
constraint programming
dispatching rule
Petri nets
multi-agent systems
Opis:
A comprehensive case study of manufacturing scheduling solutions development is given. It includes highly generalized scheduling problem as well as a few scheduling modes, methods and problem models. The considered problem combines flexible job shop structure, lot streaming with variable sublots, transport times, setup times, and machine calendars. Tabu search metaheuristic and constraint programming methods have been used for the off-line scheduling. Two dynamic scheduling methods have also been implemented, i.e., dispatching rules for the completely reactive scheduling and a multi-agent system for the predictivereactive scheduling. In these implementations three distinct models of the problem have been used, based on: graph representation, optimal constraint satisfaction, and Petri net formalism. Each of these solutions has been verified in computational experiments. The results are compared and some findings about advantages, disadvantages, and suggestions on using the solutions are formulated.
Źródło:
Management and Production Engineering Review; 2016, 7, 1; 21-32
2080-8208
2082-1344
Pojawia się w:
Management and Production Engineering Review
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Solving scheduling problems with integrated online sustainability observation using heuristic optimization
Autorzy:
Burduk, Anna
Musiał, Kamil
Balashov, Artem
Batako, Andre
Safonyk, Andrii
Powiązania:
https://bibliotekanauki.pl/articles/2173719.pdf
Data publikacji:
2022
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
production scheduling
sustainable development
genetic algorithm
meta-heuristics
intelligent optimization methods of production systems
tabu search
harmonogramowanie produkcji
zrównoważony rozwój
algorytm genetyczny
przeszukiwanie tabu
metaheurystyki
inteligentne metody optymalizacji systemów produkcyjnych
Opis:
The paper deals with the issue of production scheduling for various types of employees in a large manufacturing company where the decision-making process was based on a human factor and the foreman’s know-how, which was error-prone. Modern production processes are getting more and more complex. A company that wants to be competitive on the market must consider many factors. Relying only on human factors is not efficient at all. The presented work has the objective of developing a new employee scheduling system that might be considered a particular case of the job shop problem from the set of the employee scheduling problems. The Neuro-Tabu Search algorithm and the data gathered by manufacturing sensors and process controls are used to remotely inspect machine condition and sustainability as well as for preventive maintenance. They were used to build production schedules. The construction of the Neuro-Tabu Search algorithm combines the Tabu Search algorithm, one of the most effective methods of constructing heuristic algorithms for scheduling problems, and a self-organizing neural network that further improves the prohibition mechanism of the Tabu Search algorithm. Additionally, in the paper, sustainability with the use of Industry 4.0 is considered. That would make it possible to minimize the costs of employees’ work and the cost of the overall production process. Solving the optimization problem offered by Neuro-Tabu Search algorithm and real-time data shows a new way of production management.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2022, 70, 6; art. no. e143830
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Tabu Search and genetic algorithm for production process scheduling problem
Tabu Search i algorytmy genetyczne w harmonogramowaniu procesów produkcyjnych
Autorzy:
Burduk, Anna
Musiał, Kamil
Kochańska, Joanna
Górnicka, Dagmara
Stetsenko, Anastasia
Powiązania:
https://bibliotekanauki.pl/articles/361796.pdf
Data publikacji:
2019
Wydawca:
Wyższa Szkoła Logistyki
Tematy:
production process scheduling
Tabu Search
genetic algorithm
heuristic methods
intelligent methods
manufacturing
harmonogramowanie procesów produkcyjnych
algorytm genetyczny
metody heurystyczne
metody inteligentne
wytwarzanie
Opis:
Background: The paper deals with production process scheduling problem. In large companies, the decision-making process about operators' work, machines availability and production flow is a very difficult task, which is often being done by employees. Thus, not always the decision made is optimal in terms of cost, production time, etc. Methods: As a solution, two intelligent methods: Tabu Search and the genetic algorithm have been analyzed in field of production scheduling. The aim of this work was to examine the possibility of improving presented decision-making process that is being performed when scheduling, using Tabu Search and genetic algorithms. As a result of experimental research, it has been confirmed that the use of appropriately selected and parameterized intelligent methods allows for the optimization of the analyzed production process due to its duration. The research was case of study performed in cooperation with company that produces components for automotive industry. Results: Basing on collected and analyzed data, considered methods can be more or less successfully used in production process scheduling. Comparing both used algorithms, Tabu Search twice proposed worse solutions, the average operational time was 1.63% shorter than the actual one. In this case, better results were reached by using genetic algorithm - potential operational time was always shorter than the actual one, and it was reduced by 6.3% in total on average. Conclusion: Using algorithms allowed to achieve lower workload of employees and to reduce of operational time, which were the evaluation criteria in performed research. Managers of the analyzed company were pleased with the proposed solution and declared interest in developing these methods for future. This shows that intelligent methods can find, in relatively short time, the solution that is close to the optimal and acceptable from the problem point of view.
Wstęp: Artykuł opisuje problem harmonogramowania procesów produkcyjnych. W dużych przedsiębiorstwach proces podejmowania decyzji dotyczących pracy operatorów, maszyn, dostępności zasobów i przepływu produkcji jest bardzo złożonym zadaniem, często wykonywanym przez pracowników. W związku z tym podjęte decyzje nie zawsze są optymalne w kontekście kosztów, czasu produkcji itp. Metody: Jako rozwiązanie, przeanalizowane zostało użycie, w obszarze harmonogramowania produkcji, dwóch metod inteligentnych: Tabu Search i algorytmów genetycznych. Celem pracy było zbadanie możliwości doskonalenia procesu podejmowania decyzji, który jest wykonywany przy harmonogramowaniu produkcji, przy pomocy Tabu Search i algorytmów genetycznych. Jako wynik eksperymentu przeprowadzonego podczas badań, potwierdzono, że użycie odpowiednio wybranych oraz sparametryzowanych metod inteligentnych pozwala na optymalizację analizowanego procesu produkcji. Badania zostały wykonane we współpracy z przedsiębiorstwem zajmującym się produkcją komponentów dla branży motoryzacyjnej, jako studium przypadku. Wyniki: Zgodnie z zebranymi i przeanalizowanymi danymi, wybrane metody mogą być z mniejszym bądź większym powodzeniem stosowane w procesie harmonogramowania produkcji. Porównując zastosowane algorytmy, Tabu Search dwukrotnie zaproponował rozwiązanie gorsze od aktualnego podejścia przedsiębiorstwa, jednak czas produkcji został skrócony średnio o 1.63%. W tym przypadku, lepsze wyniki pozwoliło osiągnąć zastosowanie algorytmu genetycznego - potencjalny czas produkcji był zawsze krótszy od aktualnie stosowanego rozwiązania, a średni czas produkcji został zredukowany o 6.3%. Wnioski: Zastosowanie algorytmów pozwoliło na osiągnięcie niższego obciążenia pracą operatorów oraz zredukowanie czasu operacyjnego, co stanowiło kryteria oceny w przeprowadzonych badaniach. Kierownictwo analizowanego przedsiębiorstwa było zadowolone z zaproponowanych rozwiązań. Zdecydowali się na stosowanie omawianych metod w codziennym harmonogramowaniu produkcji oraz zadeklarowali zainteresowanie rozwojem stosowania metod w przyszłości. Metody inteligentne pozwalają znaleźć, w relatywnie krótkim czasie, rozwiązanie bliskie optymalnemu i akceptowalne z punktu widzenia analizowanego problemu.
Źródło:
LogForum; 2019, 15, 2; 181-189
1734-459X
Pojawia się w:
LogForum
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Research on optimization of unrelated parallel machine scheduling based on IG-TS algorithm
Autorzy:
Chi, Xinfu
Liu, Shijing
Li, Ce
Powiązania:
https://bibliotekanauki.pl/articles/2173693.pdf
Data publikacji:
2022
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
warp knitting machine
parallel machine scheduling
iterative greedy algorithm
tabu search
osnowarka
planowanie maszyn równoległych
algorytm zachłanny iteracyjny
przeszukiwanie tabu
Opis:
This issue is a typical NP-hard problem for an unrelated parallel machine scheduling problem with makespan minimization as the goal and no sequence-related preparation time. Based on the idea of tabu search (TS), this paper improves the iterative greedy algorithm (IG) and proposes an IG-TS algorithm with deconstruction, reconstruction, and neighborhood search operations as the main optimization process. This algorithm has the characteristics of the strong capability of global search and fast speed of convergence. The warp knitting workshop scheduling problem in the textile industry, which has the complex characteristics of a large scale, nonlinearity, uncertainty, and strong coupling, is a typical unrelated parallel machine scheduling problem. The IG-TS algorithm is applied to solve it, and three commonly used scheduling algorithms are set as a comparison, namely the GA-TS algorithm, ABC-TS algorithm, and PSO-TS algorithm. The outcome shows that the scheduling results of the IG-TS algorithm have the shortest manufacturing time and good robustness. In addition, the production comparison between the IG-TS algorithm scheduling scheme and the artificial experience scheduling scheme for the small-scale example problem shows that the IG-TS algorithm scheduling is slightly superior to the artificial experience scheduling in both planning and actual production. Experiments show that the IG-TS algorithm is feasible in warp knitting workshop scheduling problems, effectively realizing the reduction of energy and the increase in efficiency of a digital workshop in the textile industry.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2022, 70, 4; art. no. e141724
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The Tabu Search approach in coherent co-synthesis of multiprocessors systems
Autorzy:
Drabowski, M.
Czajkowski, K.
Powiązania:
https://bibliotekanauki.pl/articles/92834.pdf
Data publikacji:
2006
Wydawca:
Uniwersytet Przyrodniczo-Humanistyczny w Siedlcach
Tematy:
synthesis of system
coherent
identification resources
task scheduling
NP-complete problem
heuristic algorithm
tabu search algorithm
Opis:
This paper presents the use of Tabu Search algorithm for solving the problems of coherent synthesis of multiprocessor computer systems. The paper includes a coherent solution of both optimization of partition resources and optimization of tasks scheduling. This publication shows results of computational experiments for different instances of system synthesis problems.
Źródło:
Studia Informatica : systems and information technology; 2006, 1(7); 31-45
1731-2264
Pojawia się w:
Studia Informatica : systems and information technology
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ł:
Linear programming & metaheuristic approach for scheduling in the hybrid flowshop with resource constraints
Autorzy:
Figielska, E.
Powiązania:
https://bibliotekanauki.pl/articles/206283.pdf
Data publikacji:
2011
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
flowshop
parallel machines
resource constraints
heuristics
linear programming
genetic algorithms
simulated annealing
tabu search
Opis:
This paper deals with the problem of preemptive scheduling in a two-stage flowshop with parallel unrelated machines and additional renewable resources. The objective is the minimization of makespan. The problem is NP-hard. Heuristic algorithms are proposed which join the linear programming based procedures with metaheuristic algorithms: genetic, simulated annealing and tabu search algorithm. The performance of the proposed algorithms is experimentally evaluated by comparing the solutions with a lower bound on the optimal makespan. Results of a computational experiment show that these algorithms are able to produce good solutions in short computation time and that the metaheuristics significantly improve the results for the most difficult problems.
Źródło:
Control and Cybernetics; 2011, 40, 4; 1209-1230
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Hierarchical Multiobjective Routing in MPLS Networks with Two Service Classes - A Meta-Heuristic Solution
Autorzy:
Girao-Silva, R.
Craveirinha, J.
Clímaco, J.
Powiązania:
https://bibliotekanauki.pl/articles/308908.pdf
Data publikacji:
2009
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
multiobjective optimization
MPLS-Internet
routing models
simulated annealing
tabu search
Opis:
The paper begins by reviewing a two-level hierarchical multicriteria routing model for MPLS networks with two service classes (QoS and BE services) and alternative routing, as well as the foundations of a heuristic resolution approach, previously proposed by the authors. Afterwards a new approach, of meta-heuristic nature, based on the introduction of simulated annealing and tabu search techniques, in the structure of the dedicated heuristic, is described. The application of the developed procedures to a benchmarking case study will show that, in certain initial conditions, this approach provides improvements in the final results especially in more "difficult" situations detected through sensitivity analysis.
Źródło:
Journal of Telecommunications and Information Technology; 2009, 3; 20-37
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
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ł:
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ł:
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ł
Wyświetlanie 1-15 z 42

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