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

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-5 z 5
    Tytuł:
    The extensive 1-median problem with radius on networks
    Autorzy:
    Nhan, Tran Hoai Ngoc
    Hung, Nguyen Thanh
    Nguyen, Kien Trung
    Powiązania:
    https://bibliotekanauki.pl/articles/29519649.pdf
    Data publikacji:
    2024
    Wydawca:
    Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
    Tematy:
    extensive facility
    median problem
    tree
    convex
    Opis:
    The median location problem concerns finding locations of one or several new facilities that minimize the overall weighted distances from the existing to the new facilities. We address the problem of locating one new facility with a radius r on networks. Furthermore, the radius r is flexible and the objective function is the conic combination of the traditional 1-median function and the value r. We call this problem an extensive 1-median problem with radius on networks. To solve the problem, we first induce the so-called finite dominating set, that contains all points on the underlying network and radius values which are candidate for the optimal solution of the problem. This helps to develop a combinatorial algorithm that solves the problem on a general network G = (V,E) in O(|E||V|3) time. We also consider the underlying problem with improved algorithm on trees. Based the convexity of the objective function with variable radius, we develop a linear time algorithm to find an extensive 1-median with radius on the underlying tree.
    Źródło:
    Opuscula Mathematica; 2024, 44, 1; 135-149
    1232-9274
    2300-6919
    Pojawia się w:
    Opuscula Mathematica
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Optimization of the position of the local distribution centre of the regional post logistics network
    Autorzy:
    Droździel, P.
    Wińska, A.
    Madleňák, R.
    Szumski, P.
    Powiązania:
    https://bibliotekanauki.pl/articles/375506.pdf
    Data publikacji:
    2017
    Wydawca:
    Politechnika Śląska. Wydawnictwo Politechniki Śląskiej
    Tematy:
    vehicle routing problem
    postal network
    optimization
    p-median problem
    sieć pocztowa
    optymalizacja
    Opis:
    The phenomenon of the present postal services is the fact that, customers expect the lowest price while maintaining the availability, security and on time delivery of mail items. We can find that, the costs associated with transport of the postal substrate is one of the most important factors affecting the total cost of the postal services. These transport costs depend on various factors such as the investment in vehicles purchase, operational costs of the postal vehicles (costs of maintenance, repairs, fuel costs of the vehicle, etc.) labour costs of the drivers and so on. For this reason, it is important to find such an operational - organizational solutions that can reduce the costs associated with the transportation of postal shipments, resulting in reducing the total cost of postal services. One option to do this is to minimize the length of postal transportation routes. This article presents the approach based on the application of graph theory to optimize existing connections of postal logistics network. Published results is oriented to revaluate existing position of local centre and find a location for the new local distribution centre potentially. New location of local distribution centre can to optimize (minimize) the total transport costs of the local postal transportation network in area of the Lublin Province.
    Źródło:
    Transport Problems; 2017, 12, 3; 43-50
    1896-0596
    2300-861X
    Pojawia się w:
    Transport Problems
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Center-based l1-clustering method
    Autorzy:
    Sabo, K.
    Powiązania:
    https://bibliotekanauki.pl/articles/330910.pdf
    Data publikacji:
    2014
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    l1 clustering
    data mining
    optimization
    weighted median problem
    metoda grupowania
    eksploracja danych
    optymalizacja
    Opis:
    In this paper, we consider the l1-clustering problem for a finite data-point set which should be partitioned into k disjoint nonempty subsets. In that case, the objective function does not have to be either convex or differentiable, and generally it may have many local or global minima. Therefore, it becomes a complex global optimization problem. A method of searching for a locally optimal solution is proposed in the paper, the convergence of the corresponding iterative process is proved and the corresponding algorithm is given. The method is illustrated by and compared with some other clustering methods, especially with the l2-clustering method, which is also known in the literature as a smooth k-means method, on a few typical situations, such as the presence of outliers among the data and the clustering of incomplete data. Numerical experiments show in this case that the proposed l1-clustering algorithm is faster and gives significantly better results than the l2-clustering algorithm.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2014, 24, 1; 151-163
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Robust p-median problem in changing networks
    Das Problem des P-Medians in den sich wechselnden Netzen
    Autorzy:
    Peško, Š.
    Majer, T.
    Powiązania:
    https://bibliotekanauki.pl/articles/374099.pdf
    Data publikacji:
    2015
    Wydawca:
    Politechnika Śląska. Wydawnictwo Politechniki Śląskiej
    Tematy:
    robust p-median problem
    uncertain edge length
    mixed integer linear programming
    MILP heuristic
    Gurobi solver
    network variables
    problem p medialny
    niepewna długość krawędzi
    programowanie liniowe mieszane
    heurystyka
    Gurobi
    sieci zmienne
    Opis:
    The robust p-median problem in changing networks is a version of known discrete p-median problem in network with uncertain edge lengths where uncertainty is characterised by given interval. The uncertainty in edge lengths may appear in travel time along the edges in any network location problem. Several possible future scenarios with respect to the lengths of edges are presented. The planner will want a strategy of positioning p medians that will be working "as well as possible" over the future scenarios. We present MILP formulation of the problem and the solution method based on exchange MILP heuristic. The cluster of each median is presented by rooted tree with the median as root. The performance of the proposed heuristic is compared to the optimal solution found via Gurobi solver for MILP models through some illustrative instances of Slovak road network in Zilina.
    Das Problem des P-Medians in den sich wechselnden Netzen ist eines der Versionen des bekannten diskreten Problems über P-Median im Netz mit nicht gewissen Abschnittlängen, wo die Unbestimmheit durch das gegebene Intervall angesetzt wird.Nicht gewisse Länge der Abschitte kann sich als Fahrtlänge in dem Gebiet des jeweiligen Lokationsproblem bestimmen. Wir führen einige Szenare mit Rücksicht auf Kantenlänge ein. Der Planer sucht die Strategie "möglichst guter" Plazierung von P-Medianen mit Rücksicht auf zukünftige Szenare. Wir stellen MILP-Formulierung des Problems und Lösungsverfahren vor, die auf der Tausch-Heuristik gegründet werden. Die zu jedem Median gehörende Ansammlung wird als der Baum mit Würzeln als Median präsentiert. Die Qualität der vorgeschlagenen Heuristik vergleichen wir mit der optimalen Lösung der erworbenen Gurobi-Solver für MILP-Modelle auf einigen Illustrationsinstanzen der Strassennetze in der Slowakischen Republik im Region Zilina.
    Źródło:
    Transport Problems; 2015, 10, 3; 125-130
    1896-0596
    2300-861X
    Pojawia się w:
    Transport Problems
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    The median solution of the newsvendor problem and some observations
    Autorzy:
    Sinha, P.
    Powiązania:
    https://bibliotekanauki.pl/articles/952856.pdf
    Data publikacji:
    2015
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    newsvendor problem
    median solution
    practical suitability
    solution
    Opis:
    We consider the median solution of the Newsvendor Problem. Some properties of such a solution are shown through a theoretical analysis and a numerical experiment. Sometimes, though not often, median solution may be better than solutions maximizing expected profit, or maximizing minimum possible, over distribution with the same average and standard deviation, expected profit, according to some criteria. We discuss the practical suitability of the objective function set and the solution derived, for the Newsvendor Problem, and other such random optimization problems.
    Źródło:
    Management and Production Engineering Review; 2015, 6, 3; 55-60
    2080-8208
    2082-1344
    Pojawia się w:
    Management and Production Engineering Review
    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