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


Wyświetlanie 1-3 z 3
Tytuł:
A hybrid approach for scheduling transportation networks
Autorzy:
Dridi, M.
Kacem, I.
Powiązania:
https://bibliotekanauki.pl/articles/907640.pdf
Data publikacji:
2004
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
system transportowy
regulacja ruchu
algorytm genetyczny
optymalizacja wielokryterialna
transportation systems
traffic regulation
genetic algorithm
multicriteria optimization
Opis:
In this paper, we consider a regulation problem of an urban transportation network. From a given timetable, we aim to find a new schedule of multiple vehicles after the detection of a disturbance at a given time. The main objective is to find a solution maximizing the level of service for all passengers. This problem was intensively studied with evolutionary approaches and multi-agent techniques, but without identifying its type before. In this paper, we formulate the problem as a classical one in the case of an unlimited vehicle capacity. In the case of a limited capacity and an integrity constraint, the problem becomes difficult to solve. Then, a new coding and well-adapted operators are proposed for such a problem and integrated in a new evolutionary approach.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2004, 14, 3; 397-409
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A relation of dominance for the bicriterion bus routing problem
Autorzy:
Widuch, J.
Powiązania:
https://bibliotekanauki.pl/articles/330092.pdf
Data publikacji:
2017
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
multicriteria optimization
set of nondominated solutions
bicriterion shortest path problem
variable weights
label correcting algorithm
transportation problem
optymalizacja wielokryterialna
zbiór rozwiązań niezdominowanych
dwukryterialny problem najkrótszej ścieżki
zmienne wagi
problem transportowy
Opis:
A bicriterion bus routing (BBR) problem is described and analysed. The objective is to find a route from the start stop to the final stop minimizing the time and the cost of travel simultaneously. Additionally, the time of starting travel at the start stop is given. The BBR problem can be resolved using methods of graph theory. It comes down to resolving a bicriterion shortest path (BSP) problem in a multigraph with variable weights. In the paper, differences between the problem with constant weights and that with variable weights are described and analysed, with particular emphasis on properties satisfied only for the problem with variable weights and the description of the influence of dominated partial solutions on non-dominated final solutions. This paper proposes methods of estimation a dominated partial solution for the possibility of obtaining a non-dominated final solution from it. An algorithm for solving the BBR problem implementing these estimation methods is proposed and the results of experimental tests are presented.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2017, 27, 1; 133-155
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Simultaneous routing and flow rate optimization in energy-aware computer networks
Autorzy:
Jaskóła, P.
Arabas, P.
Karbowski, A.
Powiązania:
https://bibliotekanauki.pl/articles/331329.pdf
Data publikacji:
2016
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
MINLP
MIQP
network optimization
green networking
fairness
multicriteria
optymalizacja sieci
wielokryterialność
Opis:
The issue of energy-aware traffic engineering has become prominent in telecommunications industry in the last years. This paper presents a two-criteria network optimization problem, in which routing and bandwidth allocation are determined jointly, so as to minimize the amount of energy consumed by a telecommunication infrastructure and to satisfy given demands represented by a traffic matrix. A scalarization of the criteria is proposed and the choice of model parameters is discussed in detail. The model of power dissipation as a function of carried traffic in a typical software router is introduced. Then the problem is expressed in a form suitable for the mixed integer quadratic programming (MIQP) solver. The paper is concluded with a set of small, illustrative computational examples. Computed solutions are implemented in a testbed to validate the accuracy of energy consumption models and the correctness of the proposed traffic engineering algorithm.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2016, 26, 1; 231-243
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-3 z 3

    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