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ę "Nikulin, Yury" wg kryterium: Autor


Wyświetlanie 1-3 z 3
Tytuł:
Post-optimal analysis for multicriteria integer linear programming problem with parametric optimality
Autorzy:
Emelichev, Vladimir
Nikulin, Yury
Powiązania:
https://bibliotekanauki.pl/articles/2049980.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
post-optimal analysis
multiple criteria
quasistability radius
integer linear programming
parametric optimality
Opis:
This paper addresses a multicriteria problem of integer linear programming with parametric optimality. Parameterizations is introduced by dividing a set of objectives into a family of disjoint subsets, within each Pareto optimality is used to establish dominance between alternatives. The introduction of this principle allows us to connect such classical optimality sets as Pareto and extreme. The parameter space of admissible perturbations in such problem is formed by a set of additive matrices, with arbitrary Hölder’s norms specified in the solution and criterion spaces. The attainable lower and upper bounds for the radii of quasistability are obtained.
Źródło:
Control and Cybernetics; 2020, 49, 2; 163-178
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Bi-objective routing in a dynamic network: An application to maritime logistics
Autorzy:
Maskooki, Alaleh
Nikulin, Yury
Powiązania:
https://bibliotekanauki.pl/articles/2050033.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
travelling salesman
time dependent network
multi-objective optimization
integer programming
Opis:
A bi-objectiveMILP model for optimal routing in a dynamic network with moving targets (nodes) is developed, where all targets are not necessarily visited. Hence, our problem extends the moving target travelling salesman problem. The two objectives aim at finding the sequence of targets visited in a given time horizon by minimizing the total travel distance and maximizing the number of targets visited. Due to a huge number of binary variables, such a problem often becomes intractable in the real life cases. To reduce the computational burden, we introduce a measure of traffic density, based on which we propose a time horizon splitting heuristics. In a real-world case study of greenhouse gas emissions control, using Automatic Identification System data related to the locations of ships navigating in the Gulf of Finland, we evaluate the performance of the proposed method. Different splitting scenarios are analysed numerically. Even in the cases of a moderate scale, the results show that near-efficient values for the two objectives can be obtained by our splitting approach with a drastic decrease in computational time compared to the exact MILP method. A linear value function is introduced to compare the Pareto solutions obtained by different splitting scenarios. Given our results, we expect that the present study is valuable in logistic applications, specifically maritime management services and autonomous navigation.
Źródło:
Control and Cybernetics; 2020, 49, 2; 211--232
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Stability kernel in finite games with perturbed payoffs
Autorzy:
Emelichev, Vladimir
Nikulin, Yury
Powiązania:
https://bibliotekanauki.pl/articles/2183484.pdf
Data publikacji:
2022
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
post-optimal analysis
multiple criteria
kernel stability radius
independent perturbations
finite games
Pareto optimality
Nash equilibrium
Opis:
The parametric concept of equilibrium in a finite cooperative game of several players in a normal form is introduced. This concept is defined by the partitioning of a set of players into coalitions. Two extreme cases of such partitioning correspond to Pareto optimal and Nash equilibrium outcomes, respectively. The game is characterized by its matrix, in which each element is a subject for independent perturbations., i.e. a set of perturbing matrices is formed by a set of additive matrices, with two arbitrary Hölder norms specified independently in the outcome and criterion spaces. We undertake post-optimal analysis for the so-called stability kernel. The analytical expression for supreme levels of such perturbations is found. Numerical examples illustrate some of the pertinent cases.
Źródło:
Control and Cybernetics; 2022, 51, 1; 6--20
0324-8569
Pojawia się w:
Control and Cybernetics
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