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ł:
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ł:
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ł:
Optimal vehicle route schedules in picking up and delivering cargo containers considering time windows in logistics distribution networks: A case study
Autorzy:
Le, Thi Diem Chau
Nguyen, Duy Duc
Oláh, Judit
Pakurár, Miklós
Powiązania:
https://bibliotekanauki.pl/articles/1839502.pdf
Data publikacji:
2020
Wydawca:
Stowarzyszenie Menedżerów Jakości i Produkcji
Tematy:
vehicle routing problem
logistics distribution network
time window
guided local search
tabu search
simulated annealing
problem trasowania pojazdów
sieć dystrybucji
okno czasowe
wyszukiwanie lokalne
symulowane wyżarzanie
Opis:
This study describes a pickup and delivery vehicle routing problem, considering time windows in reality. The problem of tractor truck routes is formulated by a mixed integer programming model. Besides this, three algorithms - a guided local search, a tabu search, and simulated annealing - are proposed as solutions. The aims of our study are to optimize the number of internal tractor trucks used, and create optimal routes in order to minimize total logistics costs, including the fixed and variable costs of an internal vehicle group and the renting cost of external vehicles. Besides, our study also evaluates both the quality of solutions and the time to find optimal solutions to select the best suitable algorithm for the real problem mentioned above. A novel mathematical model is formulated by OR tools for Python. Compared to the current solution, our results reduced total costs by 18%, increased the proportion of orders completed by internal vehicles (84%), and the proportion of orders delivered on time (100%). Our study provides a mathematical model with time constraints and large job volumes for a complex distribution network in reality. The proposed mathematical model provides effective solutions for making decisions at logistics companies. Furthermore, our study emphasizes that simulated annealing is a more suitable algorithm than the two others for this vehicle routing problem.
Źródło:
Production Engineering Archives; 2020, 26, 4; 174-184
2353-5156
2353-7779
Pojawia się w:
Production Engineering Archives
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Two meta-heuristic algorithms for scheduling on unrelated machines with the late work criterion
Autorzy:
Wang, Wen
Chen, Xin
Musial, Jędrzej
Blazewicz, Jacek
Powiązania:
https://bibliotekanauki.pl/articles/330022.pdf
Data publikacji:
2020
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
late work minimization
unrelated machines
tabu search
genetic algorithm
minimalizacja opóźnienia
przeszukiwanie tabu
algorytm genetyczny
Opis:
A scheduling problem in considered on unrelated machines with the goal of total late work minimization, in which the late work of a job means the late units executed after its due date. Due to the NP-hardness of the problem, we propose two meta-heuristic algorithms to solve it, namely, a tabu search (TS) and a genetic algorithm (GA), both of which are equipped with the techniques of initialization, iteration, as well as termination. The performances of the designed algorithms are verified through computational experiments, where we show that the GA can produce better solutions but with a higher time consumption. Moreover, we also analyze the influence of problem parameters on the performances of these metaheuristics.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2020, 30, 3; 573-584
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
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ł:
Tabu Search Against Permutation Based Stream Ciphers
Autorzy:
Polak, I.
Boryczka, M.
Powiązania:
https://bibliotekanauki.pl/articles/227111.pdf
Data publikacji:
2018
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
tabu search
TS
cryptanalysis
RC4
VMPC
stream cipher
state recovery attack
Opis:
Encryption is one of the most effective methods of securing data confidentiality, whether stored on hard drives or transferred (e.g. by e-mail or phone call). In this paper a new state recovery attack with tabu search is introduced. Based on research and theoretical approximation it is shown that the internal state can be recovered after checking 2⁵² internal states for RC4 and 2¹⁸⁰ for VMPC.
Źródło:
International Journal of Electronics and Telecommunications; 2018, 64, 2; 137-145
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Heuristic algorithms for joint optimization of unicast and anycast traffic in elastic optical network-based large-scale computing systems
Autorzy:
Markowski, M.
Powiązania:
https://bibliotekanauki.pl/articles/330713.pdf
Data publikacji:
2017
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
elastic optical network
joint optimization
distributed data center
metaheuristic algorithm
tabu search
elastyczna sieć optyczna
optymalizacja wspólna
baza danych rozproszona
algorytm heurystyczny
metoda tabu search
Opis:
In recent years elastic optical networks have been perceived as a prospective choice for future optical networks due to better adjustment and utilization of optical resources than is the case with traditional wavelength division multiplexing networks. In the paper we investigate the elastic architecture as the communication network for distributed data centers. We address the problems of optimization of routing and spectrum assignment for large-scale computing systems based on an elastic optical architecture; particularly, we concentrate on anycast user to data center traffic optimization. We assume that computational resources of data centers are limited. For this offline problems we formulate the integer linear programming model and propose a few heuristics, including a meta-heuristic algorithm based on a tabu search method. We report computational results, presenting the quality of approximate solutions and efficiency of the proposed heuristics, and we also analyze and compare some data center allocation scenarios.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2017, 27, 3; 605-622
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
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ł:
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ł:
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ł:
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ł:
Assigning NMR spectra of irregular RNAs by heuristic algorithms
Autorzy:
Szachniuk, M.
Powiązania:
https://bibliotekanauki.pl/articles/201820.pdf
Data publikacji:
2015
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
bioinformatics
NMR
tabu search
beam search
RNA structure
bioinformatyka
wyszukiwarka tabu
wyszukiwarka wiązki
struktura RNA
Opis:
Computer-aided analysis and preprocessing of spectral data is a prerequisite for any study of molecular structures by Nuclear Magnetic Resonance (NMR) spectroscopy. The data processing stage usually involves a considerable dedication of time and expert knowledge to cope with peak picking, resonance signal assignment and calculation of structure parameters. A significant part of the latter step is performed in an automated way. However, in peak picking and resonance assignment a multistage manual assistance is still essential. The work presented here is focused on the theoretical modeling and analyzing the assignment problem by applying heuristic approaches to the NMR spectra recorded for RNA structures containing irregular regions.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2015, 63, 1; 329-338
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
BETTER ALTERNATIVES FOR STEPWISE DISCRIMINANT ANALYSIS
ALTERNATYWNE, LEPSZE METODY W KROKOWEJ ANALIZIE DYSKRYMINACYJNEJ
Autorzy:
Stąpor, Katarzyna
Powiązania:
https://bibliotekanauki.pl/articles/654331.pdf
Data publikacji:
2015
Wydawca:
Uniwersytet Łódzki. Wydawnictwo Uniwersytetu Łódzkiego
Tematy:
analiza dyskryminacyjna
procedury krokowe
selekcja cech
metaheurystyka
przeszukiwanie z tabu
discriminant analysis
stepwise procedures
feature selection
metaheuristic
tabu search
Opis:
Analiza dyskryminacyjna to jedna z metod umożliwiających klasyfikację obserwacji do jednej z predefiniowanych klas na podstawie wartości pomierzonych cech. Celem krokowej analizy dyskryminacyjnej (KAD) jest wybór podzbioru cech wejściowych przy zachowaniu możliwie dużej mocy dyskryminacyjnej. Zmniejszenie wymiarowości wejściowej przestrzeni cech jest konieczne z wielu powodów. W istniejących na rynku, komercyjnych pakietach do obliczeń statystycznych, KAD bazuje na klasycznych metodach selekcji cech. Metody te generują wiele problemów. W prezentowanej pracy zostanie przedstawiona alternatywna metoda wykorzystująca metaheurystykę przeszukiwania z tabu. Wyniki eksperymentalne na wzorcowych zbiorach danych są obiecujące.
Discriminant Analysis can best be defined as a technique which allows the classification of an individual into several dictinctive populations on the basis of a set of measurements. Stepwise discriminant analysis (SDA) is concerned with selecting the most important variables whilst retaining the highest discrimination power possible. The process of selecting a smaller number of variables is often necessary for a variety number of reasons. In the existing statistical software packages SDA is based on the classic feature selection methods. Many problems with such stepwise procedures have been identified. In this work the new method based on the metaheuristic strategy tabu search will be presented together with the experimental results conducted on the selected benchmark datasets. The results are promising.
Źródło:
Acta Universitatis Lodziensis. Folia Oeconomica; 2015, 1, 311
0208-6018
2353-7663
Pojawia się w:
Acta Universitatis Lodziensis. Folia Oeconomica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Scheduling of multiunit projects using tabu search algorithm
Autorzy:
Podolski, M.
Powiązania:
https://bibliotekanauki.pl/articles/347178.pdf
Data publikacji:
2015
Wydawca:
Akademia Wojsk Lądowych imienia generała Tadeusza Kościuszki
Tematy:
construction works scheduling
optimization
job scheduling
tabu search algorithm
Opis:
The paper describes problems of discrete optimization in scheduling of multiunit projects. A model of this kind of project with possibility of using many workgroups by the contractor has been presented. It leads to reduction of project duration. For solving NP-hard optimization problem, a tabu search algorithm has been applied in the model. The example of mod-el and application of the algorithm are also included in the paper.
Źródło:
Zeszyty Naukowe / Wyższa Szkoła Oficerska Wojsk Lądowych im. gen. T. Kościuszki; 2015, 1; 110-122
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ł:
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ł
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