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


Wyświetlanie 1-2 z 2
Tytuł:
On planning production and distribution with disrupted supply chains
Autorzy:
Szufel, Przemysław
Powiązania:
https://bibliotekanauki.pl/articles/2139334.pdf
Data publikacji:
2022-10-31
Wydawca:
Główny Urząd Statystyczny
Tematy:
production
optimisation techniques
simulation modelling
programming models
transportation economics
Opis:
This paper presents a model for short-term time-horizon production and distribution planning of a manufacturing company located in the middle of a supply chain. The model focuses on an unbalanced market with broken supply chains. This reflects the state of the current post-COVID-19 economy, which is additionally struggling with even more uncertainty and disruptions due to the Russian aggression against Ukraine. The manufacturer, operating on the post-pandemic and post-war market, on the one hand observes a soaring demand for its products, and on the other faces uncertainty regarding the availability of components (parts) used in the manufacturing process. The goal of the company is to maximise profits despite the uncertain availability of intermediate products. In the short term, the company cannot simply raise prices, as it is bound by long-term contracts with its business partners. The company also has to maintain a good relationship with its customers, i.e. businesses further in the supply chain, by proportionally dividing its insufficient production and trying to match production planning with the observed demand. The post-COVID-19 production-planning problem has been addressed with a robust mixed integer optimisation model along with a dedicated heuristic, which makes it possible to find approximate solutions in a large-scale real-world setting.
Źródło:
Przegląd Statystyczny; 2022, 69, 2; 20-36
0033-2372
Pojawia się w:
Przegląd Statystyczny
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Application of multiple criteria evolutionary algorithms to vector optimisation, decision support and reference point approaches
Autorzy:
Szczepański, M.
Wierzbicki, A.P.
Powiązania:
https://bibliotekanauki.pl/articles/307706.pdf
Data publikacji:
2003
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
algorytm ewolucyjny
optymalizacja wektorowa
evolutionary algorithm
vector optimisation
nadir point estimation
reference point techniques
Opis:
Multiple criteria evolutionary algorithms, being essentially parallel in their character, are a natural instrument of finding a representation of entire Pareto set (set of solutions and outcomes non-dominated in criteria space) for vector optimisation problems. However, it is well known that Pareto sets for problems with more than two criteria might become complicated and their representation very time-consuming. Thus, the application of such algorithms is essentially limited to bi-criteria problems or to vector optimisation problems with more criteria but of simple structure. Even in such cases, there are problems related to various important aspects of vector optimisation, such as the uniformity of representation of Pareto set, stopping tests or the accuracy of representing Pareto set, that are not fully covered by the broad literature on evolutionary algorithms in vector optimisation. These problems and related computational tests and experience are discussed in the paper. In order to apply evolutionary algorithms for decision support, it would be helpful to use them in an interactive mode. However, evolutionary algorithms are in their essence global and of batch type. Nevertheless, it is possible to introduce interactive aspects to evolutionary algorithms by focusing them on a part of Pareto set. The results of experimental tests of such modifications of evolutionary algorithms for vector optimisation are presented in the paper. Another issue related to vector optimisation problems with more than two criteria is the computational difficulty of estimating nadir points of Pareto set. The paper describes the use of diverse variants of evolutionary algorithms to the estimation of nadir points, together with experimental evidence.
Źródło:
Journal of Telecommunications and Information Technology; 2003, 3; 16-33
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-2 z 2

    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