Autor: Vidal, R. - Katalog OPAC zbiorów

Skocz do pozycji: 1.

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ł

Zmień widok

na półce

Skocz do pozycji: 2.

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ł

Zmień widok

na półce

Skocz do pozycji: 3.

Tytuł:: Fixed channel assignment in cellular communication systems considering the whole set of packed patterns. An investigation based on metaheuristics
Autorzy:: Borges, P.
Vidal, R.
Powiązania:: https://bibliotekanauki.pl/articles/206293.pdf
Data publikacji:: 2000
Wydawca:: Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:: channel allocation
channel assignment
heuristics
mobile communication systems
patterns
search methods
Opis:: This paper addresses the problem of fixed channel assignment in cellular communication systems with nonuniform traffic distribution. The objective of the channel assignment is to minimise the average blocking probability. Methods for finding a good allocation can be based on first building a number of sets of cochannel cells or allocation patterns and then assigning them to channels. This usually implies that only a subset of the feasible region is attainable. The approach suggested in this paper uses the concept of packed pattern, since all patterns in an optimal solution will be of that kind. With a constructive method, the entire set of packed patterns is built and used in the optimisation process. The complexity (large-scale and nonlinearity) of the resulting problem suggested the use of general search procedures (local search, tabu search, simulated annealing, etc.), which have the further advantage of flexibility when dealing with extensions to the problem. A neighbouring structure was used, that facilitated the calculations while still allowing for the search in the entire solution space. A summary of extensive numerical experiments is presented. The outcome is an improvement over previous results.
Źródło:: Control and Cybernetics; 2000, 29, 3; 685-700
0324-8569
Pojawia się w:: Control and Cybernetics
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Informacja

Wyszukujesz frazę "Vidal, R." wg kryterium: Autor

Źródło danych

Dostawca treści

Kolekcja

Rok wydania

Wydawca

Temat

Autor

Typ dokumentu

Język