Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "Owsinski, J. W." wg kryterium: Autor


Wyświetlanie 1-9 z 9
Tytuł:
The bi-partial version of the p-median / p-center facility location problem and some algorithmic considerations
Autorzy:
Owsinski, J. W.
Powiązania:
https://bibliotekanauki.pl/articles/384947.pdf
Data publikacji:
2014
Wydawca:
Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Tematy:
facility location
p-median
p-center
clustering
bi-partial approach
Opis:
The paper introduces the bi-partial version of the well known p-median or p-center facility location problem. The bi-partial approach, developed by the author, primarily to deal with the clustering problems, is shown here to work for a problem that does not possess some of the essential properties, inherent to the bi-partial formulations. It is demonstrated that the classical objective function of the problem can be correctly interpreted in terms of the bi-partial approach, that it possesses the essential properties that are at the core of the bi-partial approach, and, finally, that the general algorithmic precepts of the bi-partial approach can also be applied to this problem. It is proposed that the use of bi-partial approach for similar problems can be beneficial from the point of view of flexibility and interpretation.
Źródło:
Journal of Automation Mobile Robotics and Intelligent Systems; 2014, 8, 3; 59-63
1897-8649
2080-2145
Pojawia się w:
Journal of Automation Mobile Robotics and Intelligent Systems
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Editorial : systems and operational research for modelling and decision making : a perspective from BOS conferences
Autorzy:
Owsiński, J. W.
Powiązania:
https://bibliotekanauki.pl/articles/406548.pdf
Data publikacji:
2013
Wydawca:
Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
Źródło:
Operations Research and Decisions; 2013, 23, 2; 5-9
2081-8858
2391-6060
Pojawia się w:
Operations Research and Decisions
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
New developments in fuzzy clustering with emphasis on special types of tasks
Autorzy:
Viattchenin, D. A.
Owsiński, J. W.
Kacprzyk, J.
Powiązania:
https://bibliotekanauki.pl/articles/206677.pdf
Data publikacji:
2018
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
clustering
fuzzy sets
possibilistic clustering
inference
three-way clustering
feature selection
Opis:
The paper is devoted to a survey of work done in fuzzy clustering, mainly during the first decade of the 21st century, and that with emphasis on various approachesto the problem, as well as various formulations of the very problem. That is why not only the classical formulations are treated, but several other problems, related to (the use of) clustering, like feature selection, inference systems, three-way clustering, and, on the other hand, such formulations of clustering as the possibilistic one or the one involving intuitionistic fuzzy sets. These are treated as the background for presentation of some specific ideas of the main author, concerning definite heuristic algorithms for effective solving of some of these problems.
Źródło:
Control and Cybernetics; 2018, 47, 2; 115-130
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A new heuristic possibilistic clustering algorithm for feature selection
Autorzy:
Kacprzyk, J.
Owsinski, J. W.
Viattchenin, D. A.
Powiązania:
https://bibliotekanauki.pl/articles/384599.pdf
Data publikacji:
2014
Wydawca:
Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Tematy:
feature selection
fuzzy correlation measure
possibilistic clustering
heuristic possibilistic clustering
fuzzy cluster
Opis:
The paper deals with the problem of selection of the most informative features. A new effective and efficient heuristic possibilistic clustering algorithm for feature selection is proposed. First, a brief description of basic concepts of the heuristic approach to possibilistic clustering is provided. A technique of initial data preprocessing is described and a fuzzy correlation measure is considered. The new algorithm is described and then illustrated on the well-known Iris data set benchmark and the results obtained are compared with those by using the conventional, well-known and widely employed method of principal component analysis (PCA). Conclusions and suggestions for future research are given.
Źródło:
Journal of Automation Mobile Robotics and Intelligent Systems; 2014, 8, 2; 40-46
1897-8649
2080-2145
Pojawia się w:
Journal of Automation Mobile Robotics and Intelligent Systems
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Extracting fuzzy classifications rules from three - way data
Autorzy:
Kacprzyk, J.
Owsinski, J. W.
Viattchenin, D. A.
Powiązania:
https://bibliotekanauki.pl/articles/385102.pdf
Data publikacji:
2014
Wydawca:
Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Tematy:
three-way data
possibilistic clustering
fuzzy cluster
typical point
fuzzy rule
Opis:
The paper deals in the conceptual way with the problem of extracting fuzzy classification rules from the three-way data meant in the sense of Sato and Sato [7]. A novel technique based on a heuristic method of possibilistic clustering is proposed. A description of basic concepts of a heuristic method of possibilistic clustering based on concept of an allotment is provided. A preprocessing technique for three-way data is shown. An extended method of constructing fuzzy classification rules based on clustering results is proposed. An illustrative example of the method’s application to the Sato and Sato’s data [7] is provided. An analysis of the experimental results obtained with some conclusions are given.
Źródło:
Journal of Automation Mobile Robotics and Intelligent Systems; 2014, 8, 2; 47-57
1897-8649
2080-2145
Pojawia się w:
Journal of Automation Mobile Robotics and Intelligent Systems
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ł:
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ł:
The kernel and shell structure as a tool for improving the graph of transportation connections
Autorzy:
Mażbic-Kulma, B.
Owsiński, J. W.
Sęp, K.
Stańczak, J.
Powiązania:
https://bibliotekanauki.pl/articles/406561.pdf
Data publikacji:
2013
Wydawca:
Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
Tematy:
transport
connections graph
hub and spoke
kernel and shell
α-clique
genetic algorithm
Opis:
A model of a transportation system is expected to be useful in simulations of a real system to solve given transportation tasks. A connection graph is routinely used to describe a transportation system. Vertices can be train stations, bus stops, airports etc. The edges show direct connections between vertices. A direct approach can be difficult and computational problems can arise in attempts to organize or optimize such a transportation system. Therefore, a method for aggregating such graphs was introduced, using a general kernel and shell structure and its particular instances: α-clique structured graphs of connections and a hub and spoke transformation of the source graph. These structures enable the concentration and ordering of transport between vertices and reduction of the analyzed graph. To obtain the desired structures, several versions of a specialized evolutionary algorithm were developed and applied.
Źródło:
Operations Research and Decisions; 2013, 23, 2; 91-105
2081-8858
2391-6060
Pojawia się w:
Operations Research and Decisions
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ł
    Wyświetlanie 1-9 z 9

    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