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-5 z 5
    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ł:
    Efficiency of selected meta-heuristics applied to the TSP problem: a simulation study
    Autorzy:
    Kwaśnicka, H.
    Powiązania:
    https://bibliotekanauki.pl/articles/1931573.pdf
    Data publikacji:
    2003
    Wydawca:
    Politechnika Gdańska
    Tematy:
    ant colony
    genetic algorithms
    simulated annealing
    tabu search
    neural networks
    Opis:
    The paper presents a simulation study of the usefulness of a numberof meta-heuristicsused as optimisation methods forTSPproblems. The five considered approaches are outlined: GeneticAlgorithm, Simulated Annealing, Ant Colony System, Tabu Search and Hopfield Neural Network.Using a purpose-developed computer program, efficiency of the meta-heuriticshas been studied andcompared. Results obtained from about 40000 simulation runs are briefly presented and discussed.
    Źródło:
    TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk; 2003, 7, 1; 73-91
    1428-6394
    Pojawia się w:
    TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk
    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ł:
    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ł:
    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ł
      Wyświetlanie 1-5 z 5

      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