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ę "evolutionary" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-5 z 5
    Tytuł:
    Evolutionary approach to obtain graph covering by densely connected subgraphs
    Autorzy:
    Stańczak, J.
    Potrzebowski, H.
    Sęp, K.
    Powiązania:
    https://bibliotekanauki.pl/articles/206170.pdf
    Data publikacji:
    2011
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    graph
    clique
    graph clustering
    evolutionary algorithms
    Opis:
    This article describes two evolutionary methods for dividing a graph into densely connected structures. The first method deals with the clustering problem, where the element order plays an important role. This formulation is very useful for a wide range of Decision Support System (DSS) applications. The proposed clustering method consists of two stages. The first is the stage of data matrix reorganization, using a specialized evolutionary algorithm. The second stage is the final clustering step and is performed using a simple clustering method (SCM). The second described method deals with a completely new partitioning algorithm, based on the subgraph structure we call α-clique. The α-clique is a generalization of the clique concept with the introduction of parameter α, which imposes for all vertices of the subgraph the minimal percentage (α*100%) of vertices of this subgraph that must be connected with vertices of this α-clique. Traditional clique is an instance of α-clique with α = 1. Application of this parameter makes it possible to control the degree (or strength) of connections among vertices (nodes) of this subgraph structure. The evolutionary approach is proposed as a method that enables finding separate α-cliques that cover the set of graph vertices.
    Źródło:
    Control and Cybernetics; 2011, 40, 3; 849-875
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Evolutionary approach for obtaining the hub and spoke structure in the logistic network
    Autorzy:
    Mażbic-Kulma, B.
    Stańczak, J.
    Owsiński, J. W.
    Sęp, K.
    Powiązania:
    https://bibliotekanauki.pl/articles/343812.pdf
    Data publikacji:
    2011
    Wydawca:
    Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
    Tematy:
    kernel and shell
    hub and spoke
    logistic network
    evolutionary algorithm
    Opis:
    In order to describe transportation system, as a routine a connection graph would be used. Vertices of the graph can be train stations, bus stop, airports etc. The edges show direct connections between vertices. A direct application of such graph can be difficult and computational problems can occur while one would try to organize or optimize such a transportation system. Therefore, a method of aggregation of such graph was introduced, using the general kernel and shell structure and a hub and spoke transformation method of the source graph. These structures allow to concentrate and order the transport of goods/persons among vertices and enable to reduce the number of analyzed vertices as well as edges of the graph. In the presented paper we continue our work on kernel and shell and its instance hub and spoke methods of connection graph transformation. In this paper we develop model of the transportation system using the hub and spoke method with predetermined, minimum and indirectly described numbers of hub nodes. To obtain the desired structures, several versions of specialized evolutionary algorithm (EA) were developed and applied.
    Źródło:
    Total Logistic Management; 2011, 4; 89-105
    1689-5959
    Pojawia się w:
    Total Logistic Management
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Properties of an α-clique approach to obtaining the hub and spoke structure in optimization of transportation systems
    Autorzy:
    Mazbic-Kulma, B.
    Owsinski, J. W.
    Barski, A.
    Sęp, K.
    Stańczak, J.
    Powiązania:
    https://bibliotekanauki.pl/articles/205710.pdf
    Data publikacji:
    2018
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    transport
    transport systems
    graphs
    hub and spoke
    evolutionary algorithm
    time-wise profitability
    Opis:
    The paper is devoted to the analysis of a graph transformation, pertinent for the transport and logistic systems and their planning and management. Namely, we consider, for a given graph, representing some existing transport or logistic system, its transformation to a (non-equivalent) so-called ”hub-and-spoke” structure, known from both literature and practice of transportation and logistics. This structure is supposed to bring benefits in terms of functioning and economic performance of the respective systems. The transformation into the ”hub-and-spoke” is not only non-equivalent (regarding the original graph of the system), but is also, in general, non unique. The structure sought is composed of two kinds of elements - nodes of the graph (stations, airports, havens, etc.), namely: the subgraph of hubs, which, in principle, ought to constitute a complete sub-graph (a clique), and the ”spokes”, i.e. the subsets of nodes, each of which is connected in the ultimate structure only with one of the hubs. The paper proposes a relaxation of the hub-and-spoke structure by allowing the hub subgraph not to be complete, but at least connected, with a definite ”degree of completeness” (alpha), from where the name of ”alpha-clique”. It is shown how such structures can be obtained and what are the resulting benefits for various assumptions, regarding such structures. The benefits are measured here with travel times. The desired structures are sought with an evolutionary algorithm. It is shown on an academic example how the results vary and how the conclusions, relevant for practical purposes, can be drawn from such analyses, done with the methods here presented.
    Źródło:
    Control and Cybernetics; 2018, 47, 2; 173-189
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Identifying main center access hubs in a city using capacity and time criteria. The evolutionary approach
    Autorzy:
    Owsiński, J. W.
    Stańczak, J.
    Barski, A.
    Sęp, K.
    Powiązania:
    https://bibliotekanauki.pl/articles/205927.pdf
    Data publikacji:
    2016
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    transport
    urban transport system
    Hub and Spoke
    Park and Ride
    evolutionary algorithm
    Opis:
    In this paper we consider the well known Hub and Spoke problem, analyzed in the context of Warsaw Public Transport System. Our method was designed for data preprocessing so as to allow using a timetable obtained from the public transport web site after conversion into the required data format. A dedicated evolutionary algorithm method that detects the hubs of almost all available transport means was also developed. The hubs identified are well connected to the center of the city and to other identified hubs (characterized by high capacity or short travel time). These hubs may become the skeleton of the public transport system and, in particular, good points for locating Park and Ride facilities.
    Źródło:
    Control and Cybernetics; 2016, 45, 2; 207-223
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Finding structure kernel and shell with predetermined cardinality of kernel set, using evolutionary algorithm
    Zastosowanie metod ewolucyjnych do wyznaczania struktur kernel and shell w grafie połączeń
    Autorzy:
    Mażbic-Kulma, B.
    Stańczak, J.
    Sęp, K.
    Powiązania:
    https://bibliotekanauki.pl/articles/343831.pdf
    Data publikacji:
    2010
    Wydawca:
    Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
    Tematy:
    kernel and shell
    klika
    sieć logistyczna
    algorytm ewolucyjny
    clique
    logistic network
    evolutionary algorithm
    Opis:
    The theory of logistic transportation systems deals with models of phenomena connected with movement of goods and persons. The developed model of the transportation system is expected to simulate a real system, but also should help us to solve given transportation tasks. In order to describe transportation system (rail, bus or air), as a routine a connection graph would be used. Vertices of the graph can be train stations, bus stops etc. The edges show direct connections between vertices. Its direct application can be difficult and computational problems can occur while one would try to organize or optimize such a transportation system. Therefore, a method of aggregation of such graph was introduced, using the general kernel and shell structure and its particular instance the α-clique structured graphs of connections. In the present approach, we use a predetermined number of communication hubs with the possibility of direct determining which nodes should become hubs or selecting them by the solving method. This structure allows to concentrate and order the transport of goods/persons among vertices and enables to reduce the number of analyzed vertices as well as arcs/edges of the graph. To obtain the desired structure, an evolutionary algorithm (EA) was applied.
    Teoria logistycznych systemów transportowych zajmuje się zagadnieniem połączeń w przewozach ludzi i towarów. Od modelu systemu transportowego oczekuje się symulowania rzeczywistego systemu w celu rozwiązywania problemów transportowych. Do opisania systemów transportowych (kolejowych, drogowych czy lotniczych) przydatne mogą się okazać grafy. Wierzchołki grafu mogą odpowiadać węzłom logistycznym, takim jak: stacje kolejowe, przystanki autobusowe, lotniska itd., a krawędzie - bezpośrednim połączeniom pomiędzy węzłami. Dokładny model trudno byłoby analizować lub optymalizować, dlatego jako przydatny model proponujemy strukturę kernel and shell oraz jej szczególny przypadek - strukturę α-klikową jako graf odwzorowujący strukturę połączeń. Struktury te umożliwiają koncentrację i zarządzanie transportem pomiędzy węzłami. W celu uzyskania tej struktury stosujemy specjalizowany algorytm ewolucyjny (EA).
    Źródło:
    Total Logistic Management; 2010, 3; 53-64
    1689-5959
    Pojawia się w:
    Total Logistic Management
    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