Wyniki wyszukiwania - BazTech

1

Elements of Method Improvement of Flood Zones Determination

Kryzhovets Tetiana

ECONTECHMOD : An International Quarterly Journal on Economics of Technology and Modelling Processes

|

2020

|

Vol. 9, No 1

25--29

EN

The article suggests a possible application of mathematical modeling zones and flooding characteristics that will improve the methodological basis in hydrological calculations and forecasting will provide opportunities for a better understanding of the complex mechanisms of formation flow. The computational scheme is applicable for vertically homogeneous flow conditions extending from steep river flows to tidal influenced estuaries. The system has been used in numerous engineering studies.

2

Optimization of membership function parameters for fuzzy controllers of an autonomous mobile robot using the flower pollination algorithm

Carvajal O. R., Castillo O., Soria J.

Journal of Automation Mobile Robotics and Intelligent Systems

|

2018

|

Vol. 12, No. 1

44--49

EN

In this work we describe the optimization of a Fuzzy Logic Controller (FLC) for an autonomous mobile robot that needs to follow a desired path. The FLC is for the simulation of its trajectory, the parameters of the membership functions of the FLC had not been previously optimized. We consider in this work with the flower pollination algorithm (FPA) as a method for optimizing the FLC. For this reason, we use the FPA to find the best parameters with the objective of minimizing the error between the trajectory of the robot and the reference. A comparative study of results with different metaheuristics is also presented in this work.

3

Process of market strategy optimization using distributed computing systems

Nowicki W., Bera A., Błaszyński P.

Management and Production Engineering Review

|

2015

|

Vol. 6, No. 4

87--93

EN

If market repeatability is assumed, it is possible with some real probability to deduct short term market changes by making some calculations. The algorithm, based on logical and statistically reasonable scheme to make decisions about opening or closing position on a market, is called an automated strategy. Due to market volatility, all parameters are changing from time to time, so there is need to constantly optimize them. This article describes a team organization process when researching market strategies. Individual team members are merged into small groups, according to their responsibilities. The team members perform data processing tasks through a cascade organization, providing solutions to speed up work related to the use of remote computing resources. They also work out how to store results in a suitable way, according to the type of task, and facilitate the publication of a large amount of results.

4

Routing flow-shop with buffers and ready times - comparison of selected solution algorithms

Józefczyk J., Markowski M., Balgabaeva L.

Management and Production Engineering Review

|

2014

|

Vol. 5, No. 4

26--35

EN

This article extends the former results concerning the routing flow-shop problem to minimize the makespan on the case with buffers, non-zero ready times and different speeds of machines. The corresponding combinatorial optimization problem is formulated. The exact as well as four heuristic solution algorithms are presented. The branch and bound approach is applied for the former one. The heuristic algorithms employ known constructive idea proposed for the former version of the problem as well as the Tabu Search metaheuristics. Moreover, the improvement procedure is proposed to enhance the quality of both heuristic algorithms. The conducted simulation experiments allow evaluating all algorithms. Firstly, the heuristic algorithms are compared with the exact one for small instances of the problem in terms of the criterion and execution times. Then, for larger instances, the heuristic algorithms are mutually compared. The case study regarding the maintenance of software products, given in the final part of the paper, illustrates the possibility to apply the results for real-world manufacturing systems.

5

Wybrane problemy optymalizacyjne strategicznego planowania w komunikacji miejskiej

Kisielewski P.

Logistyka

|

2014

|

nr 6

14337--14346, CD 6

PL

W pracy omówiono proces planowania strategicznego w komunikacji miejskiej. Przedstawiono w kolejności i pokrótce scharakteryzowano poszczególne etapy procesu tj. projektowanie globalnej sieci, planowanie linii komunikacyjnych i rozkładów jazdy. Przytoczono zasadnicze pozycje światowej literatury odnoszące się do procesu. Niezbędne dane do procesu planowania stanowią wyniki pomiarów potoków pasażerskich i ankietyzacji, przedstawiane w postaci więźby ruchu i macierzy migracji. W skrócie przedstawiono również modelowanie miejskiej sieci komunikacyjnej z wykorzystaniem teorii grafów. W pracy zaprezentowano modele matematyczne optymalizacji, funkcje celu, zmienne decyzyjne i ograniczenia, zastosowane w algorytmach komputerowego wspomagania procesu planowania. Funkcja celu na każdym etapie uwzględnia kompromis pomiędzy komfortem pasażerów i kosztem organizacji transportu. Przedstawiono przykłady i wnioski pod kątem wykorzystania w praktycznych implementacjach.

EN

In the paper the process of strategic planning in city transit has been described. Specific stages of the process, that is global network design, line planning and timetabling have been presented in turn and characterized. The worldwide basic references concerning the process have been denoted. Necessary data to planning process are taken from passenger flow measurements and questionnaires, presented in a form of passenger journey chart and migration matrix. Modeling of city transit network with the use of graph theory has been also briefly presented. Mathematical models of optimization, objective functions, decision variables and constrains applied in the algorithms of computer aided planning process have been described in the paper. The objective function at each stage of the process takes into account the compromise between the passenger comfort and the operational cost of transport. The examples and conclusions regarding practical implementations have been presented.

6

Zastosowanie hybrydowego operatora mutacji w obliczeniach ewolucyjnych

Handzel Z., Gajer M.

Elektronika : konstrukcje, technologie, zastosowania

|

2013

|

Vol. 54, nr 3

83-85

PL

W artykule zaproponowano wykorzystanie hybrydowego sposobu kodowania rozwiązań na materiale genetycznym ewoluujących osobników wraz z hybrydowym operatorem mutacji. Przyjęcie tego rodzaju sposobu kodowania rozwiązań pozwala na jednoczesne wykorzystanie w ramach tego samego algorytmu ewolucyjnego trzech różnych systemów kodowania (binarnego, na liczbach całkowitych i na liczbach rzeczywistych). Tego rodzaju sposób kodowania może okazać się korzystny w przypadku optymalizacji złożonych systemów technicznych, takich jak na przykład system elektroenergetyczny.

EN

In the paper we propose to use hybrid coding systems of solutions on the genetic material of evolving individuals together with the hybrid mutation operator. Such a way of coding of solutions allows simultaneous using three different coding systems in the same evolutionary algorithm (binary, based on natural numbers, and based on real numbers). Such a way of coding can be advantageous in the case of optimizing of complex technical systems, as for example electro-energetic systems.

7

Solving Markov decision processes by d-graph algorithms

Kátai Z.

Control and Cybernetics

|

2012

|

Vol. 41, no. 3

577-593

EN

Markov decision processes (MDPs) provide a mathematical model for sequential decisionmaking (sMDP/dMDP: stochastic/ deterministic MDP). We introduce the concept of generalized dMDP (g-dMDP) where each action may result in more than one next (parallel or clone) state. The common tools to represent dMDPs are digraphs, but these are inadequate for sMDPs and g-dMDPs. We introduce d-graphs as general tools to represent all the above mentioned processes (stationary versions). We also present a combined d-graph algorithm that implements dynamic programming strategies to find optimal policies for the finite/infinite horizon versions of these Markov processes. (The preliminary version of this paper was presented at the Conference MACRo 2011.)

8

A manufacturing network for generating added value from a geographical distance for the next generation

Yukawa K., Kawakami T.

Journal of Machine Engineering

|

2011

|

Vol. 11, No. 3

44--57

EN

n this study, we suggested a manufacturing network for generating added value from a geographical distance in terms of value creation from various management resources. Until today, most researchers focused on the Real Concentration of Production Base, which provides certain manufacturing benefits in these domains. However, "the Virtual Concentration of Production Bases" is realized by overcoming large physical distances and time differences between production bases, and creates greater added value for products. We attempted the simulation of the manufacturing network of creating the added value after having shown the new framework of network analysis in the manufacturing system.

9

Problem jakości rozwiązań w podejściu metaheurystycznym do problemu marszrutyzacji pojazdów

Walerjańczyk W., Maciejewski M.

Logistyka

|

2009

|

nr 6

CD-CD

PL

W artykule przedstawiono problematykę jakości rozwiązań uzyskiwanych w wyniku zastosowania metaherystycznych algorytmów w problemie marszrutyzacji pojazdów. Wskazano w nim najistotniejsze zagrożenia wynikające ze stosowania metod przybliżonych przy modelowaniu zjawisk rzeczywistych w systemach komputerowego wspomagania decyzji. Przedstawiono również budowę i działanie platformy zarządzania eksperymentami weryfikacyjnymi dla celów porównywania jakości rozwiązań generowanych przez różne programy optymalizacyjne. Przedstawiono wyniki eksperymentów obliczeniowych porównując efekty różnego podejścia do komputerowego wspomagania problemu marszrutyzacji pojazdów. Wskazano również na zagrożenia płynące z wrażliwości metod komputerowych na jakość danych wejściowych.

EN

The paper presents the main aspects of solution quality in metaheuristic approach to vehicle routing problem. It shows discrepancies between final solutions when approximate algorithms are used. Implementation of a system for managing verification process of various algorithms is then discussed. The results of computational experiments were introduced to illustrate effects of different approaches to computer aided vehicle routing. Influence of data incompleteness and impreciseness on computed solutions is also discussed.

10

System doradczy liczby kryteriów optymalizacji obiektów budowlanych

Jendo S., Paczkowski W., Wilczyński P.

Zeszyty Naukowe Katedry Mechaniki Stosowanej / Politechnika Śląska

|

2005

|

z. 29

145-150

PL

Praca prezentuje system doradczy ułatwiający ustalenie właściwej liczby kryteriów w zagadnieniach optymalizacji obiektów budowlanych. System powstał przy użyciu programu Microsoft Excel i jest komputerową implementacją przedstawionej w pracy procedury. Przewiduje się, że prezentowany system doradczy będzie jednym z elementów tworzonego szerszego systemu ekspertowego, wspomagającego proces formułowania i rozwiązywania problemów dyskretnej optymalizacji obiektów.

EN

The paper deals with an advisory system helping in the selection of an appropriate number of objectives in civil engineering optimization problems. Procedures described in the paper are implemented using the Microsoft Excel code. The proposed advisory system will serve as one of the components of a larger expert system, which can be effectively applied in formulating and solving discrete optimization problems.

11

Numerical determination of quadratic-optimal regulator for linear systems with constraints

Cvejn J.

Archives of Control Sciences

|

2004

|

Vol. 14, no. 3/4

231-246

EN

The paper describes a way of determination of quadratic-optimal regulator for linear continuous and discrete systems with constraints. The method is based on direct numerical minimization of the quadratic criterion expressing the quality of control. Constant regulator matrix, independent on the starting state, is obtained as a result. Due to the constraints the optimal regulator however depends on initial state. Therefore, the problem formulation was modified by using an extended criterion of optimality that guarantees quality behavior for any initial state within a given set.

12

Management of Intellectual Capital

Banek T., Kulikowski R.

Bulletin of the Polish Academy of Sciences. Technical Sciences

|

2003

|

Vol. 51, nr 3

205-211

EN

Two different types of firm's activity are considered as portfolio selection problems. First activity is an ordinary one. The second is innovative and extra-ordinary. To be profitable it must have enough of an "intellectual capital" (IC). Optimization problems for the firm are solved and the notion of IC is defind. Two different methodologies are discussed.

13

A computer tool for supporting and evaluating convoys redeployment planning.

Tarapata Z.

Badania Operacyjne i Decyzje

|

2000

|

Nr 1

91-106

EN

A computer environment being utilized to examine redeployment planning for a few convoys in real terrain is presented. This tool enables support and evaluation of the movement planning (and its algorithms) of any object columns both for deterministic and stochastic structure of a network being a model of the terrain. A mathematical model of K convoys redeployment is described and optimization problems related to it both in reliable and unreliable network are formulated. To examine redeployment and its algorithms when any opponents exert destructive influence on the moving objects and network a simulation model of redeployment is discussed. A detailed description of present application is given and numerical example being solved by using the tool considered is shown. Moreover, possibilities of civilian applications of this tool are indicated.

PL

Zaprezentowano komputerowe środowisko wykorzystywane do oceny planowania przegrupowania konwojów w rzeczywistym terenie. Umożliwia ono wspomaganie i ocenę planowania ( i jego algorytmów) przemieszczenia dowolnych kolumn obiektów w sieci (będącej modelem terenu) o strukturze zarówno deterministycznej, jak i stochastycznej. Opisano matematyczny model przegrupowania K konwojów oraz sformułowano zadania optymalizacyjne dotyczące problemu przegrupowania w sieci zawodowej i niezawodowej. Aby zbadać przegrupowanie i jego algorytmy podczas niszczącego oddziaływania przeciwnika, podano model symulacyjny przegrupowania. Opisano szczegółowo aplikację będącą przedmiotem zainteresowania oraz przy użyciu możliwości innych, niż wojskowe, zastosowań prezentowanego oprogramowania.