Wyniki wyszukiwania - Biblioteka Nauki

1

Is Swarm Intelligence Able to Create Mazes?

100%

Połap D. , Woźniak M. , Napoli C. , Tramontana E.

International Journal of Electronics and Telecommunications

|

2015

|

tom Vol. 61, No. 4

305-310

EN

In this paper, the idea of applying Computational Intelligence in the process of creation board games, in particular mazes, is presented. For two different algorithms the proposed idea has been examined. The results of the experiments are shown and discussed to present advantages and disadvantages.

2

Real-Time Cloud-based Game Management System via Cuckoo Search Algorithm

100%

Połap D. , Woźniak M. , Napoli C. , Tramontana E.

International Journal of Electronics and Telecommunications

|

2015

|

tom Vol. 61, No. 4

333-338

EN

This paper analyses the idea of applying Swarm Intelligence in the process of managing the entire 2D board game in a real-time environment. For the proposed solution Game Management System is used as a cloud resource with a dedicated intelligent control agent. The described approach has been analysed on the basis of board games like mazes. The model and the control algorithm of the system is described and examined. The results of the experiments are presented and discussed to show possible advantages and isadvantages of the proposed method.

3

Heuristic algorithm for schedule optimization in FMS environment

80%

Błażewicz J. , Pawlak G. , Sterna M. , Walter B. , Zawirski M.

Foundations of Computing and Decision Sciences

|

1999

|

tom Vol. 24, No. 4

189-207

EN

The paper concerns an existing flexible manufacturing system containing two dedicated machines with three magazines of raw material and the transportation system in the form of the robot with a linear routing. Firstly, a mathematical model of the system has been developed. In general, there are batches of identical parts to be produced in the system for which the technological routes are defined and which constitute a job-shop environment. Additionally, the set-up times for batches and particular operations are taken into account. For this model a heuristic scheduling algorithm has been constructed. Computational experiments and simulation studies validated the model and the algorithm proposed.

4

A novel heuristic algorithm for minimum compliance topology optimization

80%

Bochenek B. , Mazur M.

Engineering Transactions

|

2016

|

tom Vol. 64, iss. 4

541--546

EN

The implementation of efficient and versatile methods to the generation of optimal topologies for engineering structural elements is one of the most important issues stimulating progress within the structural topology optimization area. Over the years, optimization problems have been typically solved by the use of classical gradient-based mathematical programming algorithms. Nowadays, these traditional techniques are more often replaced by other algorithms, usually by the ones based on heuristic rules. Heuristic optimization techniques are gaining widespread popularity among researchers because they are easy to implement numerically, do not require gradient information, and one can easily combine this type of algorithm with any finite element structural analysis code. In this paper, a novel heuristic algorithm for a minimum compliance topology optimization is proposed. Its effectiveness is illustrated by the results of numerical generation of optimal topologies for selected plane structures.

5

Specify of bottlenecks in conditions of unit and small-batch production

80%

Matuszek J. , Mleczko J.

Journal of Automation Mobile Robotics and Intelligent Systems

|

2009

|

tom Vol. 3, No. 3

102-109

EN

The manufacturing industry has evolved over the past several decades in response to changing customer needs. Customers have become more demanding and want products that can meet their specific individual requirements. The standard products previously produced in large batches are not sufficient to meet this variety demanded. Given the increased competition, both locally and globally, companies must also now respond faster to get and keep customers. Enterprises were forced to unit and small-batch production. Currently, advanced planning systems are coming into use, however their cost exceeds the possibilities of small and medium enterprises and algorithms used often require great customization to industries' needs and conditions of unit and small-batch production. The paper has been drawn on the basis of research on overloads of moving bottlenecks in conditions of unit and small batch production in real conditions having a big number of resources and tasks. The methods used so far are not capable of finding the global optimum of such big data ranges. The author took on building a heuristic algorithm, which could find solution good enough and based on TOC (Theory of Constraints) assumptions and verification of assumptions using tests in real production systems. The above method found application to the industrial scale, as extension of the ERP class system.

6

On Some Aspects of Genetic and Evolutionary Methods for Optimization Purposes

80%

Woźniak M. , Połap D.

International Journal of Electronics and Telecommunications

|

2015

|

tom Vol. 61, No. 1

7-16

EN

In this paper, the idea of applying some hybrid genetic algorithms with gradient local search and evolutionary optimization techniques is formulated. For two different test functions the proposed versions of the algorithms have been examined. Research results are presented and discussed to show potential efficiency in optimization purposes.

7

Approach for the development of heuristic process planning tool for sequencing NC machining operations

80%

Berger U. , Kretschmann R. , Arnold K. P. , Minhas S.

Applied Computer Science

|

2008

|

tom Vol. 4, no 2

17--41

EN

This chapter deals with the process planning for sequencing NC (numerical control) machining operations. This task of selecting and ordering of machining operations is still done manually in principle. In order to overcome this problem, an approach for enabling the automatic preparation of work plans with methods known from the graph theory is introduced in this chapter. Therefore a work plan is mapped into a directed graph in a mathematically defined way. Based on that, it is possible to use algorithms to find the shortest path and a Hamiltonian path inside this directed graph as optimal sequenced solution under given requirements. Thus, the work plan is structured and re-ordered. Finally the corresponding NC machining code will be generated and distributed to the machinery.

8

Evolutionary Algorithms Approach for Cutting Stock Problem

80%

Romanowski A. , Nowotniak R. , Kawecki K. , Jaworski T. , Chaniecki Z. , Grudzień K.

Image Processing & Communications

|

2012

|

tom Vol. 17, no. 4

297--306

EN

This paper contain study of three algorithms for optimisation of use of materials for cutting process. Cutting Stock Problem (CSP) and one dimensional guillotine cat variant of the CSP is introduced. Afterwards three different way of solving the problem are presented. For each of theme one algorithm is proposed. First is creating all the possible solutions and choosing the best one. Second is trying to recreate a human thinking process by using a heuristic search. Third one is inspired by an evolution process in the nature. Design and implementation of each of them is presented. Proposed algorithms are tested and compared to each other and also to the other known solutions.

9

Heurystyczny algorytm wyznaczania czasowo-optymalnego szeregowania zadań i rozdziału zasobów w systemie maszyn równoległych

80%

Buchalski Z.

Automatyka / Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie

|

2003

|

tom T. 7, z. 1-2

59-64

PL

Praca dotyczy zagadnienia czasowo-optymalnego przydziału n zadań niezależnych i zasobu nieodnawialnego do m maszyn równoległych. Zakłada się, że występuje stałość przydziału zasobów do maszyn w czasie wykonywania całego zbioru zadań. Dla zadanej funkcji czasu realizacji zadań sformułowano model matematyczny zagadnienia oraz zaprezentowano algorytm heurystyczny dla rozwiązania postawionego problemu. Przedstawiono wyniki eksperymentów obliczeniowych wykonanych na bazie zaproponowanego algorytmu heurystycznego.

EN

In the paper problem of time-optimal allocation of n independent tasks and nonrenewable resources to m parallel machines is considered. We assume, that is constancy of resources allocation to machines in processing time all tasks set. For some tasks execution time function the mathematical model of this problem is formulated and an heuristic algorithm for solution this problem is presented. Some results of executed numerical experiment for basis of proposed heuristic algorithm are presented.

10

Równoległe wykonywanie zadań przez system wielomaszynowy z uwzględnieniem minimalizacji czasu zakończenia wykonywania zadań

80%

Buchalski Z.

Automatyka / Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie

|

2001

|

tom T. 5, z. 1/2

113-120

PL

Praca dotyczy zagadnienia czasowo-optymalnego przydziału n zadań niezależnych i zasobu nieodnawialnego do m maszyn równoległych. Zakłada się, że występuje stałość przydziału zasobów do maszyn w czasie wykonywania całego zbioru zadań. Dla zadanej funkcji czasu realizacji zadań sformułowano model matematyczny zagadnienia oraz zaprezentowano algorytm heurystyczny dla rozwiązania postawionego problemu. Przedstawiono wyniki eksperymentów obliczeniowych wykonanych na bazie zaproponowanego algorytmu heurystycznego.

EN

In the paper problem of time-optimal allocation of n independent tasks and nonrenewable resources to m parallel machines is considered. We assume, that is constancy of resources allocation to machines in processing time all tasks set. For some tasks execution time function the mathematical model of this problem is formulated and an heuristic algorithm for solution this problem is presented. Some results of executed numerical experiment for basis of proposed heuristic algorithm are presented.

11

Production control in moving bottlenecks in conditions of unit and small-batch production

70%

Matuszek J. , Mleczko J.

Bulletin of the Polish Academy of Sciences. Technical Sciences

|

2009

|

tom Vol. 57, nr 3

229-239

EN

Since the production is aimed at fulfilling specific needs of demanding customers and not at filling warehouses, the production volume should reflect the volume of orders. In times of fight for the client every order has to be performed on time. What is more, in limes of fight for shortening the delivery cycle, meeting safe deadlines, that is distant in time, is not enough. Companies are forced to meet short deadlines with keeping the product price competitiveness condition. It is hardly possible without a proper, APS (Advanced Planning System) class, advanced planning support system. Currently, advanced planning systems arc coming into use, however (heir cost exceeds the possibilities of small and medium enterprises and algorithms used often require great customization to industries' needs and conditions of unit and small-hatch production. The paper has been drawn on the basis of research on overloads of moving bottlenecks in conditions of unit and small batch production in real conditions having a big number of resources and tasks. The methods used so far are not capable of finding the global optimum of such big data ranges. At present few working enterprises in conditions of unit and small batch production, especially in small and medium-sized enterprises (SME), are exploiting techniques of the production process optimization. For this reason computer tools for applying to the industrial scale arc needed. The above method basis on the data so far collected in computer systems. Results of preliminary research were introduced from applying the possibility of TOC (Theory of Constraints) to the industrial scale for reducing bottlenecks in unit and small batch production. The authors built a heuristic algorithm which could find solution good enough and based on TOC assumptions and verification of assumptions using tests in real production systems. The above method found application to the industrial scale, as extension of the ERP class system.

12

Model–based energy efficient global path planning for a four–wheeled mobile robot

70%

Jaroszek P. , Trojnacki M.

Control and Cybernetics

|

2014

|

tom Vol. 43, no. 2

337--363

EN

This paper concerns an energy efficient global path planning algorithm for a four-wheeled mobile robot (4WMR). First, the appropriate graph search methods for robot path planning are described. The A* heuristic algorithm is chosen to find an optimal path on a 2D tile-decomposed map. Various criteria of optimization in path planning, like mobility, distance, or energy are reviewed. The adequate terrain representation is introduced. Each cell in the map includes information about ground height and type. Tire-ground interface for every terrain type is characterized by coefficients of friction and rolling resistance. The goal of the elaborated algorithm is to find an energy minimizing route for the given environment, based on the robot dynamics, its motor characteristics, and power supply constraints. The cost is introduced as a function of electrical energy consumption of each motor and other robot devices. A simulation study was performed in order to investigate the power consumption level for diverse terrain. Two 1600 m2 test maps, representing field and urban environments, were decomposed into 20x20 equal-sized square-shaped elements. Several simulation experiments have been carried out to highlight the differences between energy consumption of the classic shortest path approach, where cost function is represented as the path length, and the energy efficient planning method, where cost is related to electrical energy consumed during robot motion.

13

Optimization on permutations: related structures, problems interrelation, heuristic compositions, applications

70%

Miatselski M.

Technical Sciences / University of Warmia and Mazury in Olsztyn

|

2018

|

tom nr 21(1)

37--47

EN

A heuristics based approach to practical solving theoretically intractable combinatory and network problems is discussed. Compound heuristics (heuristics compositions) are suggested to be more efficient procedures for real size problem instances. Some aspects of the heuristics compositions topic are illustrated by optimum permutation problems. We describe a uniform presentation of the chief types of the problems and their interrelations, including the relation “to be a special case of a problem”. We consider a number of algebraic structures and combinatory constructions on permutation sets and present an inclusion chain of these constructions. The chain enables us to establish and clarify many interrelations for the minimum permutation problems, with algorithmic and complexity aspects taken into account. We also concern the applications of some problems as well.

14

Algorytm dla problemu losowego przydziału personelu

70%

Klimek M. , Łebkowski P.

Logistyka

|

2011

|

tom nr 2

PL

Artykuł prezentuje problem losowego przydziału personelu, który występuje w rzeczywistej firmie. Sformułowano model matematyczny dla tego zagadnienia. Następnie zaproponowano algorytm priorytetowy rozwiązujący problem losowej alokacji personelu. Na koniec przedstawiono przykład ilustrujący działanie algorytmu.

EN

This paper presents random personnel assignment problem which is found in real company. Mathematic model for this problem is formulated. Next priority algorithm solving random personnel allocation problem is proposed. Finally an illustrative example working of this algorithm is described.

15

Voice recognition through the use of Gabor transform and heuristic algorithm

70%

Woźniak M. , Połap D.

International Journal of Electronics and Telecommunications

|

2017

|

tom Vol. 63, No. 2

159--164

EN

Increasingly popular use of verification methods based on specific characteristics of people like eyeball, fingerprint or voice makes inventing more accurate and irrefutable methods of that urgent. In this work we present voice verification based on Gabor transformation. Proposed approach involves creation of spectrogram, which serves as a habitat for the population in selected heuristic algorithm. The use of heuristic allows for feature extraction to enable identity verification using classical neural network. The results of the research are presented and discussed to show efficiency of the proposed methodology.

16

Non-Monotonic Attribute Reduction in Decision-Theoretic Rough Sets

70%

Li H. , Zhou X. , Zhao J. , Liu D.

Fundamenta Informaticae

|

2013

|

tom Vol. 126, nr 4

415--432

EN

For most attribute reduction in Pawlak rough set model (PRS), monotonicity is a basic property for the quantitative measure of an attribute set. Based on the monotonicity, a series of attribute reductions in Pawlak rough set model such as positive-region-preserved reductions and condition entropy-preserved reductions are defined and the corresponding heuristic algorithms are proposed in previous rough sets research. However, some quantitative measures of attribute set may be non-monotonic in probabilistic rough set model such as decision-theoretic rough set (DTRS), and the non-monotonic definition of the attribute reduction should be reinvestigated and the heuristic algorithm should be reconsidered. In this paper, the monotonicity of the positive region in PRS and DTRS are comparatively discussed. Theoretic analysis shows that the positive region in DTRS model may be expanded with the decrease of the attributes, which is essentially different from that in PRS model. Hereby, a new non-monotonic attribute reduction is presented for the DTRS model in this paper, and a heuristic algorithm for searching the newly defined attribute reduction is proposed, in which the positive region is allowed to be expanded instead of remaining unchanged in the process of attribute reduction. Experimental analysis is included to validate the theoretic analysis and quantify the effectiveness of the proposed attribute reduction algorithm.

17

The Tabu Search approach in coherent co-synthesis of multiprocessors systems

60%

Drabowski M. , Czajkowski K.

Studia Informatica : systems and information technology

|

2006

|

tom Vol. 1(7)

31--45

EN

This paper presents the use of Tabu Search algorithm for solving the problems of coherent synthesis of multiprocessor computer systems. The paper includes a coherent solution of both optimization of partition resources and optimization of tasks scheduling. This publication shows results of computational experiments for different instances of system synthesis problems.

18

Rozwiązanie problemu komiwojażera przy użyciu algorytmu genetycznego

60%

Ochelska-Mierzejewska J.

Logistyka

|

2016

|

tom nr 1

350--356, CD1

PL

Firmy związane z dystrybucją i transportem próbują opracować trasy swoich pojazdów, aby możliwie zminimalizować koszty i umożliwić dostarczenie ich towarów w wystarczająco krótkim czasie. Rozwiązaniem tego zagadnienia może być znalezienie optymalnego rozwiązanie dla problemu komiwojażera przy zastosowaniu algorytmu genetycznego. W artykule przeanalizowano dobór parametrów wejściowych dla tego algorytmu umożliwiającego znalezienie rozwiązania i przedyskutowano otrzymane wyniki.

EN

Companies associated with the distribution and transport are trying to develop their vehicles and routes to minimize costs and delivery of their goods in a sufficiently short time. The solution to this problem is to find the optimal solution for the traveling salesman problem using genetic algorithm. The article analyzes the selection of input parameters for this algorithm which allows to find a solution and discussed the results.

19

Algorytmy zachłanne

60%

Woźna B.

Scientific Issues of Jan Długosz University in Częstochowa. Mathematics

|

1999

|

tom Vol. 6

122--143

20

Ant colony optimisation algorithm for the facility localisation problem

60%

Schiff K.

Technical Transactions

|

2018

|

tom Vol. 115, iss. 1

103--112

EN

This article describes a new ant colony optimisation algorithm for the facility localisation problem with a new heuristic pattern proposed by the author, which consists of three parts: the function of the average cost of client servicing; the total minimum cost of servicing from a site, which is selected and included into the solution; the function of improving the cost of already serviced clients. In this comparison, simulations were presented, and two parameters were observed: the number of sites and the cost of client servicing. The new algorithm allowed to improve the solution in both of these parameters.

PL

W artykule przedstawiono algorytm mrówkowy dla problemu lokalizacji fabryk z nową zaproponowaną heurystyką wyboru obiektów i został on porównany z innym znanym już z literatury przedmiotu algorytmem mrówkowym. Nowa heurystyka wyboru została wyrażona jako iloraz trzech funkcji pożądania wyboru, to jest funkcji określającej średni koszt obsługi klientów poprzez włączaną lokalizację do rozwiązania, funkcję określająca całkowitą minimalną sumę obsługiwania klientów z włączanej do rozwiązania lokalizacji oraz funkcję określająca maksymalną minimalizację kosztów obsługiwania klientów poprzez włączaną lokalizację, gdy ci klienci są już obsługiwani przez lokalizacje wybrane do rozwiązania. W artykule przedstawiono wyniki przeprowadzonych testów pod kątem uzyskania jak najmniejszej liczby lokalizacji i jak najmniejszego kosztu obsługiwania klientów w funkcji rozmiaru problemu i natężenia obsługiwania klientów z danej lokalizacji.