PL
 |
EN
Preferencje help
Polish version English version Język
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 10

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  local search
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available remote InterCriteria Analyzis of Hybrid Ant Colony Optimization Algorithm for Multiple Knapsack Problem
Fidanova Stefka, Ganzha Maria, Roeva Olympia
Annals of Computer Science and Information Systems
|
2021
|
Vol. 25
173--180
EN
The local search procedure is a method for hybridization and improvement of the main algorithm, when complex problems are solved. It helps to avoid local optimums and to find faster the global one. In this paper we apply InterCriteria analysis (ICrA) on hybrid Ant Colony Optimization (ACO) algorithm for Multiple Knapsack Problem (MKP). The aim is to study the algorithm behavior comparing with traditional ACO algorithm. Based on the obtained numerical results and on the ICrA approach the efficiency and effectiveness of the proposed local search procedure are confirmed.
2
Content available The Impact of perturbation mechanisms on the operation of the swap heuristic
Misztal Wojciech
Archiwum Motoryzacji
|
2019
|
Vol. 86, nr 4
27--39
EN
In this study, an attempt was made to assess the impact of the most popular perturbation movements (i.e. Multiple-Swap(2-2), Multiple-Shift(2-2) and Multiple-K-Shift(1)), as well as the number of their calls on the quality of solutions and the time in which Swap(2-1) heuristics returns them. For this purpose, the iterative local search algorithm (ILS) was triggered, in which Swap(2-1) heuristics has cooperated with a single perturbation mechanism. The number of perturbations was changed in the range from 1 to 30. Each time the time and the difference between the percentage improvement of the objective function value of the solution obtained utilizing the Swap(2-1) algorithm cooperating with the perturbation mechanism and this algorithm working alone was checked. Based on the results obtained, it was found that the overall level of improvement in the quality of the returned solution is similar when using all of the considered perturbation mechanisms (is in the range of 2.49% to 4.02%). It has been observed that increasing the number of initiated perturbations does not guarantee an improvement in the quality of the returned solution. Perturbation movements similar to the motion initiated by the local search algorithm do not significantly improve the solution (they only entail extending the duration of action). The structure of the study has the following form. The Introduction chapter provides information on the Vehicle Routing Problem. The chapter Research methods contain a description of ILS and Swap(2-1) approaches and perturbation mechanisms considered. The last two chapters include the results of tests and conclusions.
3
Wyszukiwanie informacji z uwzględnieniem danych dotyczących lokalizacji
Kotulla A.
Studia Informatica
|
2011
|
Vol. 32, nr 2B
73-83
PL
Znacząca część zapytań realizowanych przez wyszukiwarki internetowe dotyczy wyszukiwania lokalnego. W artykule omówiona została problematyka wyszukiwania informacji uwzględniających lokalizację. Zaproponowano system dla zasobów internetowych w języku polskim, umożliwiający pozyskiwanie informacji uwzględniających lokalizację.
EN
A significant part of search queries parsed by web search engines refers to local resources. The problem of searching for information considering localization details is described in this paper. A new local search system is introduced, for web resources in polish language.
4
Content available remote An automaton Constraint for Local Search
He J., Flener P., Pearson J.
Fundamenta Informaticae
|
2011
|
Vol. 107, nr 2/3
223-248
EN
We explore the idea of using automata to implement new constraints for local search. This is already a successful approach in constraint-based global search. We show how to maintain the violations of a constraint and its variables via a deterministic finite automaton that describes a ground checker for that constraint. We extend the approach to counter automata, which are often much more convenient than finite automata, if not more independent of the constraint instance. We establish the practicality of our approach on several real-life combinatorial problems.
5
Content available remote Solving the Rectangular Packing Problem by a New Bottom-Left Placement Method Incorporated with a Multi-Start Local Search
Wetweerapong J., Remsungnen T.
Foundations of Computing and Decision Sciences
|
2010
|
Vol. 35, No. 2
127-141
EN
This paper presents a new Bottom-Left placement method for the rectangular packing problem. It is a modified version of the Row-Column Search (RCS) placement method for a faster packing. Incorporated with some improvement heuristics and a simple local search (LS), it is found to be quite efficient in solving easy to moderate packing problems. For the difficult packing problems, a multi- start mechanism is added in order to enable the packing process to overcome getting trapped to a local optimal solution. Testing on some well-known packing instances in the literature shows results that are both satisfied and informative.
6
Content available remote A critical review of the newest biologically-inspired algorithms for the flowshop scheduling problem
Duda J.
TASK Quarterly : scientific bulletin of Academic Computer Centre in Gdansk
|
2007
|
Vol. 11, No 1-2
7-19
EN
The three most recent bio-inspired heuristics proposed in the OR literature for solving the flowshop scheduling problem are revised in the paper. All of these algorithms use local search procedures to improve solutions achieved by the main procedure. The author tries to asses the gains from hybridizing such heuristics with local search procedures. The achieved results confirm that simple local search algorithms can compete successfully with much complex hybrids.
7
Przegląd badań wybranych problemów optymalizacyjnych
Woch M.
Studia Informatica
|
2007
|
Vol. 28, nr 4
81-93
EN
The article briefly presents Traveling Salesman Problem, Vehicle Routing Problem and Vehicle Routing Problem with Time Windows researches history. In this work researches and publications related to these problems are presented.
PL
Artykuł omawia historię badań nad problemami komiwojażera, dostaw oraz dostaw z oknami czasowymi. W pracy prezentowane są badania i publikacje związane z tymi problemami optymalizacyjnymi. Artykuł ma charakter przeglądowy i jako taki nie omawia uzyskanych wyników przez poszczególnych badaczy.
8
Content available Greedy randomised adaptive search procedures for topological design of MPLS networks
Mysłek A.
Journal of Telecommunications and Information Technology
|
2002
|
nr 2
26-32
EN
In this paper, the IP/MPLS network cost optimisation problem of selecting localisation of nodes and links, combined with link's dimensioning, is discussed. As the considered problem is hard, we discuss and propose greedy randomised adaptive search procedure (GRASP) based solution method. GRASP is an iterative randomised sampling technique which combines adaptive randomised greedy function in constructing initial solution with local search optimisation. The effectiveness of the method is illustrated by means of a numerical study. We compare the GRASP results with results for both exact and heuristic methods obtained in previous research concerning topological design problem.
9
Content available Tabu search - a guided tour
Hindsberger M., Vidal R.
Control and Cybernetics
|
2000
|
Vol. 29, no 3
631-651
EN
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.
10
Wykorzystanie zależności ruchów do przyspieszenia poszukiwania lokalnego i poszukiwania z tabu
Jagiełło J.
Zeszyty Naukowe. Automatyka / Politechnika Śląska
|
1998
|
z. 123
181-190
PL
Poszukiwania lokalne (ang. local search) i poszukiwania z tabu (ang. tabu search) są często dziś stosowanymi heurystykami do rozwiązywania trudnych praktycznych problemów optymalizacji dyskretnej. Przedstawiona w pracy metoda przyspieszenia działania algorytmów lokalnego poszukiwania i poszukiwania z tabu pozwala skrócić czas szukania rozwiązania lub poprawić jakość znalezionego rozwiązania bez wydłużania czasu obliczeń.
EN
Local search and tabu search are common used heuristics in solving of hard practical optimization problems. Presented method, in some cases, allow to archieve shorter time of searching desired solution or allow to find better solution in the same time.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.