2011
1.
Przemysław Miazga
Topological Synthesis of Tree Shaped Structures Based on a Building Blocks Hypothesis Journal Article
In: Journal of Telecommunications and Information Technology, no. 4, pp. 45-49, 2011, ISSN: 1509-4553.
Abstract | Links | BibTeX | Tagi: kaeiog
@article{KAEiOG2011.JTIT.4,
title = {Topological Synthesis of Tree Shaped Structures Based on a Building Blocks Hypothesis},
author = {Przemysław Miazga},
url = {https://troja.uksw.edu.pl/pdf/kaeiog/KAEiOG2011.JTIT.4.pdf},
issn = {1509-4553},
year = {2011},
date = {2011-01-01},
journal = {Journal of Telecommunications and Information Technology},
number = {4},
pages = {45-49},
abstract = {In this paper a new approach to evolutionary controlled creation of electronic circuit connection topology is proposed. Microwave circuits consisting of a tree like connection of ideal transmission lines are considered. Assuming that a reasonable number of transmission lines in a tree network ranges from 10 to 100, the number of connection combinations is immense. From the engineering practice comes the hypothesis that any device can be decomposed into some functional building blocks consisting of one to dozen transmission lines. The variety of linking combinations in a tree with a limited depth is confined to hundreds or thousands of shapes. Therefore we can decrease the dimensionality of research space, applying evolution to building blocks only. Evolutionary algorithm (EA) which processes simultaneously the population of lambda functional blocks and population of mu circuits is proposed. A mu, lambda selection scheme with tournament together with specific encoding of solutions, and custom operators is implemented. The mu, lambda, alpha EA was tested on an example of the design of a microwave transistor matching circuit.},
keywords = {kaeiog},
pubstate = {published},
tppubtype = {article}
}
In this paper a new approach to evolutionary controlled creation of electronic circuit connection topology is proposed. Microwave circuits consisting of a tree like connection of ideal transmission lines are considered. Assuming that a reasonable number of transmission lines in a tree network ranges from 10 to 100, the number of connection combinations is immense. From the engineering practice comes the hypothesis that any device can be decomposed into some functional building blocks consisting of one to dozen transmission lines. The variety of linking combinations in a tree with a limited depth is confined to hundreds or thousands of shapes. Therefore we can decrease the dimensionality of research space, applying evolution to building blocks only. Evolutionary algorithm (EA) which processes simultaneously the population of lambda functional blocks and population of mu circuits is proposed. A mu, lambda selection scheme with tournament together with specific encoding of solutions, and custom operators is implemented. The mu, lambda, alpha EA was tested on an example of the design of a microwave transistor matching circuit.
2.
Andrzej Obuchowicz, Przemysław Prętki
Self-Adaptive Stable Mutation Based on Discrete Spectral Measure for Evolutionary Algorithms Journal Article
In: Journal of Telecommunications and Information Technology, no. 4, pp. 11-19, 2011, ISSN: 1509-4553.
Abstract | Links | BibTeX | Tagi: kaeiog
@article{KAEiOG2011.JTIT.1,
title = {Self-Adaptive Stable Mutation Based on Discrete Spectral Measure for Evolutionary Algorithms},
author = {Andrzej Obuchowicz and Przemysław Prętki},
url = {https://troja.uksw.edu.pl/pdf/kaeiog/KAEiOG2011.JTIT.1.pdf},
issn = {1509-4553},
year = {2011},
date = {2011-01-01},
journal = {Journal of Telecommunications and Information Technology},
number = {4},
pages = {11-19},
abstract = {In this paper, the concept of a multidimensional discrete spectral measure is introduced in the context of its application to the real-valued evolutionary algorithms. The notion of a discrete spectral measure makes it possible to uniquely define a class of multivariate heavy-tailed distributions, that have recently received substantial attention of the evolutionary optimization community. In particular, an adaptation procedure known from the distribution estimation algorithms (EDAs) is considered and the resulting estimated distribution is compared with the optimally selected referential distribution.},
keywords = {kaeiog},
pubstate = {published},
tppubtype = {article}
}
In this paper, the concept of a multidimensional discrete spectral measure is introduced in the context of its application to the real-valued evolutionary algorithms. The notion of a discrete spectral measure makes it possible to uniquely define a class of multivariate heavy-tailed distributions, that have recently received substantial attention of the evolutionary optimization community. In particular, an adaptation procedure known from the distribution estimation algorithms (EDAs) is considered and the resulting estimated distribution is compared with the optimally selected referential distribution.
3.
Krzysztof Trojanowski, Mikołaj Raciborski, Piotr Kaczyński
Self-Adaptive Differential Evolution with Hybrid Rules of Perturbation for Dynamic Optimization Journal Article
In: Journal of Telecommunications and Information Technology, no. 4, pp. 20-30, 2011, ISSN: 1509-4553.
Abstract | Links | BibTeX | Tagi: kaeiog
@article{KAEiOG2011.JTIT.2,
title = {Self-Adaptive Differential Evolution with Hybrid Rules of Perturbation for Dynamic Optimization},
author = {Krzysztof Trojanowski and Mikołaj Raciborski and Piotr Kaczyński},
url = {https://troja.uksw.edu.pl/pdf/kaeiog/KAEiOG2011.JTIT.2.pdf},
issn = {1509-4553},
year = {2011},
date = {2011-01-01},
journal = {Journal of Telecommunications and Information Technology},
number = {4},
pages = {20-30},
abstract = {In this paper an adaptive differential evolution approach for dynamic optimization problems is studied. A new benchmark suite Syringa is also presented. The suite allows to generate test-cases from a multiple number of dynamic optimization classes. Two dynamic benchmarks: Generalized Dynamic Benchmark Generator (GDBG) and Moving Peaks Benchmark (MPB) have been simulated in Syringa and in the presented research they were subject of the experimental research. Two versions of adaptive differential evolution approach, namely the jDE algorithm have been heavily tested: the pure version of jDE and jDE equipped with solutions mutated with a new operator. The operator uses a symmetric alpha-stable distribution variate for modification of the solution coordinates.},
keywords = {kaeiog},
pubstate = {published},
tppubtype = {article}
}
In this paper an adaptive differential evolution approach for dynamic optimization problems is studied. A new benchmark suite Syringa is also presented. The suite allows to generate test-cases from a multiple number of dynamic optimization classes. Two dynamic benchmarks: Generalized Dynamic Benchmark Generator (GDBG) and Moving Peaks Benchmark (MPB) have been simulated in Syringa and in the presented research they were subject of the experimental research. Two versions of adaptive differential evolution approach, namely the jDE algorithm have been heavily tested: the pure version of jDE and jDE equipped with solutions mutated with a new operator. The operator uses a symmetric alpha-stable distribution variate for modification of the solution coordinates.
4.
Ewa Niewiadomska-Szynkiewicz, Mariusz Kamola
Localization in Wireless Sensor Networks Using Heuristic Optimization Techniques Journal Article
In: Journal of Telecommunications and Information Technology, no. 4, pp. 55-64, 2011, ISSN: 1509-4553.
Abstract | Links | BibTeX | Tagi: kaeiog
@article{KAEiOG2011.JTIT.6,
title = {Localization in Wireless Sensor Networks Using Heuristic Optimization Techniques},
author = {Ewa Niewiadomska-Szynkiewicz and Mariusz Kamola},
url = {https://troja.uksw.edu.pl/pdf/kaeiog/KAEiOG2011.JTIT.6.pdf},
issn = {1509-4553},
year = {2011},
date = {2011-01-01},
journal = {Journal of Telecommunications and Information Technology},
number = {4},
pages = {55-64},
abstract = {Many applications of wireless sensor networks (WSN) require information about the geographic location of each sensor node. Devices that form WSN are expected to be remotely deployed in large numbers in a sensing field, and to self-organize to perform sensing and acting task. The goal of localization is to assign geographic coordinates to each device with unknown position in the deployment area. Recently, the popular strategy is to apply optimization algorithms to solve the localization problem. In this paper, we address issues associated with the application of heuristic techniques to accurate localization of nodes in a WSN system. We survey and discuss the location systems based on simulated annealing, genetic algorithms and evolutionary strategies. Finally, we describe and evaluate our methods that combine trilateration and heuristic optimization.},
keywords = {kaeiog},
pubstate = {published},
tppubtype = {article}
}
Many applications of wireless sensor networks (WSN) require information about the geographic location of each sensor node. Devices that form WSN are expected to be remotely deployed in large numbers in a sensing field, and to self-organize to perform sensing and acting task. The goal of localization is to assign geographic coordinates to each device with unknown position in the deployment area. Recently, the popular strategy is to apply optimization algorithms to solve the localization problem. In this paper, we address issues associated with the application of heuristic techniques to accurate localization of nodes in a WSN system. We survey and discuss the location systems based on simulated annealing, genetic algorithms and evolutionary strategies. Finally, we describe and evaluate our methods that combine trilateration and heuristic optimization.
5.
Paweł Zawistowski, Jarosław Arabas
Incrementally Solving Nonlinear Regression Tasks Using IBHM Algorithm Journal Article
In: Journal of Telecommunications and Information Technology, no. 4, pp. 65-72, 2011, ISSN: 1509-4553.
Abstract | Links | BibTeX | Tagi: kaeiog
@article{KAEiOG2011.JTIT.7,
title = {Incrementally Solving Nonlinear Regression Tasks Using IBHM Algorithm},
author = {Paweł Zawistowski and Jarosław Arabas},
url = {https://troja.uksw.edu.pl/pdf/kaeiog/KAEiOG2011.JTIT.7.pdf},
issn = {1509-4553},
year = {2011},
date = {2011-01-01},
journal = {Journal of Telecommunications and Information Technology},
number = {4},
pages = {65-72},
abstract = {This paper considers the black-box approximation problem where the goal is to create a regression model using only empirical data without incorporating knowledge about the character of nonlinearity of the approximated function. This paper reports on ongoing work on a nonlinear regression methodology called IBHM which builds a model being a combination of weighted nonlinear components. The construction process is iterative and is based on correlation analysis. Due to its iterative nature, the methodology does not require a priori assumptions about the final model structure which greatly simplifies its usage. Correlation based learning becomes ineffective when the dynamics of the approximated function is too high. In this paper we introduce weighted correlation coefficients into the learning process. These coefficients work as a kind of a local filter and help overcome the problem. Proof of concept experiments are discussed to show how the method solves approximation tasks. A brief discussion about complexity is also conducted.},
keywords = {kaeiog},
pubstate = {published},
tppubtype = {article}
}
This paper considers the black-box approximation problem where the goal is to create a regression model using only empirical data without incorporating knowledge about the character of nonlinearity of the approximated function. This paper reports on ongoing work on a nonlinear regression methodology called IBHM which builds a model being a combination of weighted nonlinear components. The construction process is iterative and is based on correlation analysis. Due to its iterative nature, the methodology does not require a priori assumptions about the final model structure which greatly simplifies its usage. Correlation based learning becomes ineffective when the dynamics of the approximated function is too high. In this paper we introduce weighted correlation coefficients into the learning process. These coefficients work as a kind of a local filter and help overcome the problem. Proof of concept experiments are discussed to show how the method solves approximation tasks. A brief discussion about complexity is also conducted.
6.
Adrian Wolny, Robert Schaefer
Improving Population-Based Algorithms with Fitness Deterioration Journal Article
In: Journal of Telecommunications and Information Technology, no. 4, pp. 31-44, 2011, ISSN: 1509-4553.
Abstract | Links | BibTeX | Tagi: kaeiog
@article{KAEiOG2011.JTIT.3,
title = {Improving Population-Based Algorithms with Fitness Deterioration},
author = {Adrian Wolny and Robert Schaefer},
url = {https://troja.uksw.edu.pl/pdf/kaeiog/KAEiOG2011.JTIT.3.pdf},
issn = {1509-4553},
year = {2011},
date = {2011-01-01},
journal = {Journal of Telecommunications and Information Technology},
number = {4},
pages = {31-44},
abstract = {This work presents a new hybrid approach for supporting sequential niching strategies called Cluster Supported Fitness Deterioration (CSFD). Sequential niching is one of the most promising evolutionary strategies for analyzing multimodal global optimization problems in the continuous domains embedded in the vector metric spaces. In each iteration CSFD performs the clustering of the random sample by OPTICS algorithm and then deteriorates the fitness on the area occupied by clusters. The selection pressure pushes away the next-step sample (population) from the basins of attraction of minimizers already recognized, speeding up finding the new ones. The main advantages of CSFD are low memory an computational complexity even in case of large dimensional problems and high accuracy of deterioration obtained by the flexible cluster definition delivered by OPTICS. The paper contains the broad discussion of niching strategies, detailed definition of CSFD and the series of the simple comparative tests.},
keywords = {kaeiog},
pubstate = {published},
tppubtype = {article}
}
This work presents a new hybrid approach for supporting sequential niching strategies called Cluster Supported Fitness Deterioration (CSFD). Sequential niching is one of the most promising evolutionary strategies for analyzing multimodal global optimization problems in the continuous domains embedded in the vector metric spaces. In each iteration CSFD performs the clustering of the random sample by OPTICS algorithm and then deteriorates the fitness on the area occupied by clusters. The selection pressure pushes away the next-step sample (population) from the basins of attraction of minimizers already recognized, speeding up finding the new ones. The main advantages of CSFD are low memory an computational complexity even in case of large dimensional problems and high accuracy of deterioration obtained by the flexible cluster definition delivered by OPTICS. The paper contains the broad discussion of niching strategies, detailed definition of CSFD and the series of the simple comparative tests.
7.
Jarosław Arabas
Evolutionary Computation for Global Optimization – Current Trends Journal Article
In: Journal of Telecommunications and Information Technology, no. 4, pp. 5-10, 2011, ISSN: 1509-4553.
Abstract | Links | BibTeX | Tagi: kaeiog
@article{KAEiOG2011.JTIT,
title = {Evolutionary Computation for Global Optimization – Current Trends},
author = {Jarosław Arabas},
url = {https://troja.uksw.edu.pl/pdf/kaeiog/KAEiOG2011.JTIT.pdf},
issn = {1509-4553},
year = {2011},
date = {2011-01-01},
journal = {Journal of Telecommunications and Information Technology},
number = {4},
pages = {5-10},
abstract = {This article comments on the development of Evolutionary Computation (EC) in the field of global optimization. A brief overview of EC fundamentals is provided together with the discussion of issues of parameter settings and adaptation, advances in the development of theory, new ideas emerging in the EC field and growing availability of massively parallel machines.},
keywords = {kaeiog},
pubstate = {published},
tppubtype = {article}
}
This article comments on the development of Evolutionary Computation (EC) in the field of global optimization. A brief overview of EC fundamentals is provided together with the discussion of issues of parameter settings and adaptation, advances in the development of theory, new ideas emerging in the EC field and growing availability of massively parallel machines.
8.
Maciej Michalak, Robert Nowak
Evolutionary Algorithm that Designs the DNA Synthesis Procedure Journal Article
In: Journal of Telecommunications and Information Technology, no. 4, pp. 50-54, 2011, ISSN: 1509-4553.
Abstract | Links | BibTeX | Tagi: kaeiog
@article{KAEiOG2011.JTIT.5,
title = {Evolutionary Algorithm that Designs the DNA Synthesis Procedure},
author = {Maciej Michalak and Robert Nowak},
url = {https://troja.uksw.edu.pl/pdf/kaeiog/KAEiOG2011.JTIT.5.pdf},
issn = {1509-4553},
year = {2011},
date = {2011-01-01},
journal = {Journal of Telecommunications and Information Technology},
number = {4},
pages = {50-54},
abstract = {Chemical synthesis of nucleotide chains is very erroneous for long sequences. Often a gene is constructed from short fragments joined with the use of complementary helper chains. The number of possible potential solutions for a long gene synthesis is very large, therefore a fast automated search is required. In the presented approach a modified method of long DNA construction is proposed. A computer program that searches for an optimal solution in the space of potential synthesis methods has been developed. This software uses an evolutionary algorithm for global optimization and a hillclimbing algorithm for local optimization. The long DNA construction method was tested on random sequences. The results are very promising. The next step is to perform experiments in a biotechnological wet laboratory involving DNA strand synthesis using the method designed by the presented software.},
keywords = {kaeiog},
pubstate = {published},
tppubtype = {article}
}
Chemical synthesis of nucleotide chains is very erroneous for long sequences. Often a gene is constructed from short fragments joined with the use of complementary helper chains. The number of possible potential solutions for a long gene synthesis is very large, therefore a fast automated search is required. In the presented approach a modified method of long DNA construction is proposed. A computer program that searches for an optimal solution in the space of potential synthesis methods has been developed. This software uses an evolutionary algorithm for global optimization and a hillclimbing algorithm for local optimization. The long DNA construction method was tested on random sequences. The results are very promising. The next step is to perform experiments in a biotechnological wet laboratory involving DNA strand synthesis using the method designed by the presented software.
9.
Karol Opara, Jarosław Arabas
Benchmarking Procedures for Continuous Optimization Algorithms Journal Article
In: Journal of Telecommunications and Information Technology, no. 4, pp. 73-80, 2011, ISSN: 1509-4553.
Abstract | Links | BibTeX | Tagi: kaeiog
@article{KAEiOG2011.JTIT.8,
title = {Benchmarking Procedures for Continuous Optimization Algorithms},
author = {Karol Opara and Jarosław Arabas},
url = {https://troja.uksw.edu.pl/pdf/kaeiog/KAEiOG2011.JTIT.8.pdf},
issn = {1509-4553},
year = {2011},
date = {2011-01-01},
journal = {Journal of Telecommunications and Information Technology},
number = {4},
pages = {73-80},
abstract = {Reliable comparison of optimization algorithms requires the use of specialized benchmarking procedures. This paper highlights motivations which influence their structure, discusses evaluation criteria of algorithms, typical ways of presenting and interpreting results as well as related statistical procedures. Discussions are based on examples from CEC and BBOB benchmarks. Moreover, attention is drawn to these features of comparison procedures, which make them susceptible to manipulation. In particular, novel application of the weak axiom of revealed preferences to the field of benchmarking shows why it may be misleading to assess algorithms on basis of their ranks for each of test problems. Additionally, an idea is presented of developing massively parallel implementation of benchmarks. Not only would this provide faster computation but also open the door to improving reliability of benchmarking procedures and promoting research into parallel implementations of optimization algorithms.},
keywords = {kaeiog},
pubstate = {published},
tppubtype = {article}
}
Reliable comparison of optimization algorithms requires the use of specialized benchmarking procedures. This paper highlights motivations which influence their structure, discusses evaluation criteria of algorithms, typical ways of presenting and interpreting results as well as related statistical procedures. Discussions are based on examples from CEC and BBOB benchmarks. Moreover, attention is drawn to these features of comparison procedures, which make them susceptible to manipulation. In particular, novel application of the weak axiom of revealed preferences to the field of benchmarking shows why it may be misleading to assess algorithms on basis of their ranks for each of test problems. Additionally, an idea is presented of developing massively parallel implementation of benchmarks. Not only would this provide faster computation but also open the door to improving reliability of benchmarking procedures and promoting research into parallel implementations of optimization algorithms.
10.
Bartłomiej Jacek Kubica
The "Second Derivative" of a Non-Differentiable Function and its Use in Interval Optimization Methods Journal Article
In: Journal of Telecommunications and Information Technology, no. 4, pp. 81-85, 2011, ISSN: 1509-4553.
Abstract | Links | BibTeX | Tagi: kaeiog
@article{KAEiOG2011.JTIT.9,
title = {The "Second Derivative" of a Non-Differentiable Function and its Use in Interval Optimization Methods},
author = {Bartłomiej Jacek Kubica},
url = {https://troja.uksw.edu.pl/pdf/kaeiog/KAEiOG2011.JTIT.9.pdf},
issn = {1509-4553},
year = {2011},
date = {2011-01-01},
journal = {Journal of Telecommunications and Information Technology},
number = {4},
pages = {81-85},
abstract = {The paper presents an idea to use weak derivatives in interval global optimization. It allows using the Newton operator to narrow domains of non-differentiable functions. Preliminary computational experiments are also presented.},
keywords = {kaeiog},
pubstate = {published},
tppubtype = {article}
}
The paper presents an idea to use weak derivatives in interval global optimization. It allows using the Newton operator to narrow domains of non-differentiable functions. Preliminary computational experiments are also presented.
2009
11.
Marcin Studniarski
Stopping criteria for a general model of genetic algorithm Proceedings Article
In: Arabas, J. (Ed.): Evolutionary Computation and Global Optimization, pp. 173-182, Warsaw University of Technology Publishing House Warsaw University of Technology Publishing House, 2009, ISSN: 0137-2343.
Abstract | Links | BibTeX | Tagi: kaeiog
@inproceedings{KAEiOG2009.173-182,
title = {Stopping criteria for a general model of genetic algorithm},
author = {Marcin Studniarski},
editor = {J. Arabas},
url = {https://troja.uksw.edu.pl/pdf/kaeiog/KAEiOG2009.173-182.pdf},
issn = {0137-2343},
year = {2009},
date = {2009-01-01},
booktitle = {Evolutionary Computation and Global Optimization},
number = {169},
pages = {173-182},
publisher = {Warsaw University of Technology Publishing House},
organization = {Warsaw University of Technology Publishing House},
series = {Prace Naukowe, Elektronika},
abstract = {We consider a general Markov chain model of genetic algorithm described in [3], Chapters 5 and 6. For this model, we establish an upper bound for the number of iterations which must be executed in order to .nd an optimal (or approximately optimal) solution with a prescribed probability. For the classical genetic algorithm with bitwise mutation, our result reduces to the main theorem of [1] in the case of one optimal solution, and gives some improvement over it in the case of many optimal solutions.},
keywords = {kaeiog},
pubstate = {published},
tppubtype = {inproceedings}
}
We consider a general Markov chain model of genetic algorithm described in [3], Chapters 5 and 6. For this model, we establish an upper bound for the number of iterations which must be executed in order to .nd an optimal (or approximately optimal) solution with a prescribed probability. For the classical genetic algorithm with bitwise mutation, our result reduces to the main theorem of [1] in the case of one optimal solution, and gives some improvement over it in the case of many optimal solutions.
12.
Aleksander Byrski, Robert Schaefer
Stochastic Dynamics of Evolutionary Multi-Agent Systems Proceedings Article
In: Arabas, J. (Ed.): Evolutionary Computation and Global Optimization, pp. 19-26, Warsaw University of Technology Publishing House Warsaw University of Technology Publishing House, 2009, ISSN: 0137-2343.
Abstract | Links | BibTeX | Tagi: kaeiog
@inproceedings{KAEiOG2009.27-34,
title = {Stochastic Dynamics of Evolutionary Multi-Agent Systems},
author = {Aleksander Byrski and Robert Schaefer},
editor = {J. Arabas},
url = {https://troja.uksw.edu.pl/pdf/kaeiog/KAEiOG2009.27-34.pdf},
issn = {0137-2343},
year = {2009},
date = {2009-01-01},
booktitle = {Evolutionary Computation and Global Optimization},
number = {169},
pages = {19-26},
publisher = {Warsaw University of Technology Publishing House},
organization = {Warsaw University of Technology Publishing House},
series = {Prace Naukowe, Elektronika},
abstract = {The refined model for the biologically inspired agent-based computation system EMAS conformed to BDI standard is presented. The considerations are based on the model of the system dynamics as the stationary Markov chain already presented. In the course of paper space of the system states is modified in order assure state coherency and set of actions is simplified. Such a model allows for better understanding the behavior of the proposed complex systems as well as their limitations.},
keywords = {kaeiog},
pubstate = {published},
tppubtype = {inproceedings}
}
The refined model for the biologically inspired agent-based computation system EMAS conformed to BDI standard is presented. The considerations are based on the model of the system dynamics as the stationary Markov chain already presented. In the course of paper space of the system states is modified in order assure state coherency and set of actions is simplified. Such a model allows for better understanding the behavior of the proposed complex systems as well as their limitations.
13.
Arkadiusz Cimiński, Kazimierz Duzinkiewicz
Specialized genetic operators in drinking water distribution systems control Proceedings Article
In: Arabas, J. (Ed.): Evolutionary Computation and Global Optimization, pp. 35-42, Warsaw University of Technology Publishing House Warsaw University of Technology Publishing House, 2009, ISSN: 0137-2343.
Abstract | Links | BibTeX | Tagi: kaeiog
@inproceedings{KAEiOG2009.35-42,
title = {Specialized genetic operators in drinking water distribution systems control},
author = {Arkadiusz Cimiński and Kazimierz Duzinkiewicz},
editor = {J. Arabas},
url = {https://troja.uksw.edu.pl/pdf/kaeiog/KAEiOG2009.35-42.pdf},
issn = {0137-2343},
year = {2009},
date = {2009-01-01},
booktitle = {Evolutionary Computation and Global Optimization},
number = {169},
pages = {35-42},
publisher = {Warsaw University of Technology Publishing House},
organization = {Warsaw University of Technology Publishing House},
series = {Prace Naukowe, Elektronika},
abstract = {Model-based predictive control (MPC) is an effective method for control of the large scale systems. The method relying on repeating applying the first element of the calculated control sequence to the system, based on the model of the system and available system output measurements. A time duration of control calculation is a crucial criterion for applying this method. In this paper effective algorithm of control the drinking water distribution system (DWDS) is presented. Algorithm is based on genetic algorithm (GA), specialized genetic operators (SPO) and simulator Epanet. To improve the GA convergence, specialized genetic operators based on system operator knowledge of practical system control are proposed. Effectiveness of proposed specialized genetic operators on the example DWDS of the Chojnice city is presented},
keywords = {kaeiog},
pubstate = {published},
tppubtype = {inproceedings}
}
Model-based predictive control (MPC) is an effective method for control of the large scale systems. The method relying on repeating applying the first element of the calculated control sequence to the system, based on the model of the system and available system output measurements. A time duration of control calculation is a crucial criterion for applying this method. In this paper effective algorithm of control the drinking water distribution system (DWDS) is presented. Algorithm is based on genetic algorithm (GA), specialized genetic operators (SPO) and simulator Epanet. To improve the GA convergence, specialized genetic operators based on system operator knowledge of practical system control are proposed. Effectiveness of proposed specialized genetic operators on the example DWDS of the Chojnice city is presented
14.
Anna I. Okrasa, Tomasz Gwizdałła
Simple 3D object reconstruction using global optimization Proceedings Article
In: Arabas, J. (Ed.): Evolutionary Computation and Global Optimization, pp. 137-144, Warsaw University of Technology Publishing House Warsaw University of Technology Publishing House, 2009, ISSN: 0137-2343.
Abstract | Links | BibTeX | Tagi: kaeiog
@inproceedings{KAEiOG2009.137-144,
title = {Simple 3D object reconstruction using global optimization},
author = {Anna I. Okrasa and Tomasz Gwizdałła},
editor = {J. Arabas},
url = {https://troja.uksw.edu.pl/pdf/kaeiog/KAEiOG2009.137-144.pdf},
issn = {0137-2343},
year = {2009},
date = {2009-01-01},
booktitle = {Evolutionary Computation and Global Optimization},
number = {169},
pages = {137-144},
publisher = {Warsaw University of Technology Publishing House},
organization = {Warsaw University of Technology Publishing House},
series = {Prace Naukowe, Elektronika},
abstract = {In the paper we deal with the problem of three-dimensional shape reconstruction when its two-dimensional projections from selected directions are available. This situation corresponds e.g. to the trial of digitalizing the shape from photographs. We propose a methods for creating the mesh, projecting the shape keeping the information about light and perspective. On this basis we use SA technique to modify this shape in a controlled way in order to reproduce the initially assumed one best.},
keywords = {kaeiog},
pubstate = {published},
tppubtype = {inproceedings}
}
In the paper we deal with the problem of three-dimensional shape reconstruction when its two-dimensional projections from selected directions are available. This situation corresponds e.g. to the trial of digitalizing the shape from photographs. We propose a methods for creating the mesh, projecting the shape keeping the information about light and perspective. On this basis we use SA technique to modify this shape in a controlled way in order to reproduce the initially assumed one best.
15.
Bartłomiej Jacek Kubica
Shared-Memory Parallelization of an Interval Equations Systems Solver – Comparison of Tools Proceedings Article
In: Arabas, J. (Ed.): Evolutionary Computation and Global Optimization, pp. 121-128, Warsaw University of Technology Publishing House Warsaw University of Technology Publishing House, 2009, ISSN: 0137-2343.
Abstract | Links | BibTeX | Tagi: kaeiog
@inproceedings{KAEiOG2009.121-128,
title = {Shared-Memory Parallelization of an Interval Equations Systems Solver – Comparison of Tools},
author = {Bartłomiej Jacek Kubica},
editor = {J. Arabas},
url = {https://troja.uksw.edu.pl/pdf/kaeiog/KAEiOG2009.121-128.pdf},
issn = {0137-2343},
year = {2009},
date = {2009-01-01},
booktitle = {Evolutionary Computation and Global Optimization},
number = {169},
pages = {121-128},
publisher = {Warsaw University of Technology Publishing House},
organization = {Warsaw University of Technology Publishing House},
series = {Prace Naukowe, Elektronika},
abstract = {This paper considers the shared-memory parallelization of an interval solver of underdetermined systems of nonlinear equations. Four threading libraries are investigated: OpenMP, POSIX threads, Boost threads and TBB. Directions for further investigations on multi-threaded interval algorithms are outlined.},
keywords = {kaeiog},
pubstate = {published},
tppubtype = {inproceedings}
}
This paper considers the shared-memory parallelization of an interval solver of underdetermined systems of nonlinear equations. Four threading libraries are investigated: OpenMP, POSIX threads, Boost threads and TBB. Directions for further investigations on multi-threaded interval algorithms are outlined.
16.
Bartłomiej Jacek Kubica
Performance inversion of interval Newton narrowing operators Proceedings Article
In: Arabas, J. (Ed.): Evolutionary Computation and Global Optimization, pp. 111-120, Warsaw University of Technology Publishing House Warsaw University of Technology Publishing House, 2009, ISSN: 0137-2343.
Abstract | Links | BibTeX | Tagi: kaeiog
@inproceedings{KAEiOG2009.111-120,
title = {Performance inversion of interval Newton narrowing operators},
author = {Bartłomiej Jacek Kubica},
editor = {J. Arabas},
url = {https://troja.uksw.edu.pl/pdf/kaeiog/KAEiOG2009.111-120.pdf},
issn = {0137-2343},
year = {2009},
date = {2009-01-01},
booktitle = {Evolutionary Computation and Global Optimization},
number = {169},
pages = {111-120},
publisher = {Warsaw University of Technology Publishing House},
organization = {Warsaw University of Technology Publishing House},
series = {Prace Naukowe, Elektronika},
abstract = {This paper describes a phenomenon of performance inversion of Newton operators – more precise operators might result in longer computation of a branch-and-prune method. Examples are presented and possible reasons of this behavior are discussed},
keywords = {kaeiog},
pubstate = {published},
tppubtype = {inproceedings}
}
This paper describes a phenomenon of performance inversion of Newton operators – more precise operators might result in longer computation of a branch-and-prune method. Examples are presented and possible reasons of this behavior are discussed
17.
Łukasz Bartnik, Jarosław Arabas
MOSFET parameter extraction with EKV model Proceedings Article
In: Arabas, J. (Ed.): Evolutionary Computation and Global Optimization, pp. 9-18, Warsaw University of Technology Publishing House Warsaw University of Technology Publishing House, 2009, ISSN: 0137-2343.
Abstract | Links | BibTeX | Tagi: kaeiog
@inproceedings{KAEiOG2009.9-18,
title = {MOSFET parameter extraction with EKV model},
author = {Łukasz Bartnik and Jarosław Arabas},
editor = {J. Arabas},
url = {https://troja.uksw.edu.pl/pdf/kaeiog/KAEiOG2009.9-18.pdf},
issn = {0137-2343},
year = {2009},
date = {2009-01-01},
booktitle = {Evolutionary Computation and Global Optimization},
number = {169},
pages = {9-18},
publisher = {Warsaw University of Technology Publishing House},
organization = {Warsaw University of Technology Publishing House},
series = {Prace Naukowe, Elektronika},
abstract = {This paper reports results of an ongoing research on MOSFET parameter extraction using the EKV model. This work continues efforts in finding the best method for efficient and robust parameter extraction based on voltage-current structure characteristics. In the extraction process, voltage-current characteristics are matched by the characteristics generated by the model. Values of parameters for which the best match is observed are the result of the extraction. The extraction process is considered an optimization problem, which is then solved by an evolutionary algorithm followed by the Nelder-Mead simplex. The influence of the measurement error on the extraction results is investigated experimentally},
keywords = {kaeiog},
pubstate = {published},
tppubtype = {inproceedings}
}
This paper reports results of an ongoing research on MOSFET parameter extraction using the EKV model. This work continues efforts in finding the best method for efficient and robust parameter extraction based on voltage-current structure characteristics. In the extraction process, voltage-current characteristics are matched by the characteristics generated by the model. Values of parameters for which the best match is observed are the result of the extraction. The extraction process is considered an optimization problem, which is then solved by an evolutionary algorithm followed by the Nelder-Mead simplex. The influence of the measurement error on the extraction results is investigated experimentally
18.
Maria Magdalena Czajko, Jacek Wojciechowski
MGRASP and MSAL Algorithms for Centralized Traffic Management of Large Wireless Sensor Networks Proceedings Article
In: Arabas, J. (Ed.): Evolutionary Computation and Global Optimization, pp. 43-50, Warsaw University of Technology Publishing House Warsaw University of Technology Publishing House, 2009, ISSN: 0137-2343.
Abstract | Links | BibTeX | Tagi: kaeiog
@inproceedings{KAEiOG2009.43-50,
title = {MGRASP and MSAL Algorithms for Centralized Traffic Management of Large Wireless Sensor Networks},
author = {Maria Magdalena Czajko and Jacek Wojciechowski},
editor = {J. Arabas},
url = {https://troja.uksw.edu.pl/pdf/kaeiog/KAEiOG2009.43-50.pdf},
issn = {0137-2343},
year = {2009},
date = {2009-01-01},
booktitle = {Evolutionary Computation and Global Optimization},
number = {169},
pages = {43-50},
publisher = {Warsaw University of Technology Publishing House},
organization = {Warsaw University of Technology Publishing House},
series = {Prace Naukowe, Elektronika},
abstract = {This paper concerns a hop and degree constrained minimum spanning forest problem with the minimization of the number of trees (HDMSFMT). HDMSFMT arises during the calculation of the shortest paths in large wireless sensor networks (LWSNs) with centralized traffic management. This is a bi-criteria optimization problem, which is shown in this paper to be NP-hard. We formulate the HDMSFMT problem using formal mathematical notations. Two efficient heuristic algorithms for HDMSFMT are proposed and compared, namely Multi-objective Simulated Allocation (MSAL) and Multi-objective Greedy Randomized Adaptive Search Procedure (MGRASP). Numerical examples show that it is possible to achieve a set of feasible and satisfactory results for a wide range of graphstextquoteright types.},
keywords = {kaeiog},
pubstate = {published},
tppubtype = {inproceedings}
}
This paper concerns a hop and degree constrained minimum spanning forest problem with the minimization of the number of trees (HDMSFMT). HDMSFMT arises during the calculation of the shortest paths in large wireless sensor networks (LWSNs) with centralized traffic management. This is a bi-criteria optimization problem, which is shown in this paper to be NP-hard. We formulate the HDMSFMT problem using formal mathematical notations. Two efficient heuristic algorithms for HDMSFMT are proposed and compared, namely Multi-objective Simulated Allocation (MSAL) and Multi-objective Greedy Randomized Adaptive Search Procedure (MGRASP). Numerical examples show that it is possible to achieve a set of feasible and satisfactory results for a wide range of graphstextquoteright types.
19.
Rafał Łojek
Influence of the Adaptive Saddle Slope Gradient on the Evolutionary Saddle Crossing Time Proceedings Article
In: Arabas, J. (Ed.): Evolutionary Computation and Global Optimization, pp. 129-136, Warsaw University of Technology Publishing House Warsaw University of Technology Publishing House, 2009, ISSN: 0137-2343.
Abstract | Links | BibTeX | Tagi: kaeiog
@inproceedings{KAEiOG2009.129-136,
title = {Influence of the Adaptive Saddle Slope Gradient on the Evolutionary Saddle Crossing Time},
author = {Rafał Łojek},
editor = {J. Arabas},
url = {https://troja.uksw.edu.pl/pdf/kaeiog/KAEiOG2009.129-136.pdf},
issn = {0137-2343},
year = {2009},
date = {2009-01-01},
booktitle = {Evolutionary Computation and Global Optimization},
number = {169},
pages = {129-136},
publisher = {Warsaw University of Technology Publishing House},
organization = {Warsaw University of Technology Publishing House},
series = {Prace Naukowe, Elektronika},
abstract = {The ability to cross saddles separating adaptive optima is one of the most interesting features of adaptive processes. It is especially promising in the case of multimodal optimization. This contribution deals with the impact of the saddle slope gradient on the time of the saddle crossing. A suitable adaptive landscape with variable saddle parameters is proposed. A simple model of evolution with the real valued traits; proportional selection, normally distributed modifications and without recombination is used.},
keywords = {kaeiog},
pubstate = {published},
tppubtype = {inproceedings}
}
The ability to cross saddles separating adaptive optima is one of the most interesting features of adaptive processes. It is especially promising in the case of multimodal optimization. This contribution deals with the impact of the saddle slope gradient on the time of the saddle crossing. A suitable adaptive landscape with variable saddle parameters is proposed. A simple model of evolution with the real valued traits; proportional selection, normally distributed modifications and without recombination is used.
20.
Iwona Karcz-Dulęba
Identification of a fitness function via a dynamical system generated by phenotypic evolution – a case study Proceedings Article
In: Arabas, J. (Ed.): Evolutionary Computation and Global Optimization, pp. 87-94, Warsaw University of Technology Publishing House Warsaw University of Technology Publishing House, 2009, ISSN: 0137-2343.
Abstract | Links | BibTeX | Tagi: kaeiog
@inproceedings{KAEiOG2009.87-94,
title = {Identification of a fitness function via a dynamical system generated by phenotypic evolution – a case study},
author = {Iwona Karcz-Dulęba},
editor = {J. Arabas},
url = {https://troja.uksw.edu.pl/pdf/kaeiog/KAEiOG2009.87-94.pdf},
issn = {0137-2343},
year = {2009},
date = {2009-01-01},
booktitle = {Evolutionary Computation and Global Optimization},
number = {169},
pages = {87-94},
publisher = {Warsaw University of Technology Publishing House},
organization = {Warsaw University of Technology Publishing House},
series = {Prace Naukowe, Elektronika},
abstract = {Studies of a dynamical system model generated by a phenotypic evolution may be exploited to identify an unknown fitness function of a textquotedblleftblack-boxtextquotedblright type. Depending on a fitness function itself and a standard deviation of mutation, the system converges either to stable fixed points or demonstrates a periodic and/or chaotic behavior. Stable fixed points locate fitness optima while the unstable behavior may indicate asymmetry of the function. A family of bimodal tent functions are analyzed with their parameters varied, in order to gain knowledge about their optima positions and heights, saddles widths and levels},
keywords = {kaeiog},
pubstate = {published},
tppubtype = {inproceedings}
}
Studies of a dynamical system model generated by a phenotypic evolution may be exploited to identify an unknown fitness function of a textquotedblleftblack-boxtextquotedblright type. Depending on a fitness function itself and a standard deviation of mutation, the system converges either to stable fixed points or demonstrates a periodic and/or chaotic behavior. Stable fixed points locate fitness optima while the unstable behavior may indicate asymmetry of the function. A family of bimodal tent functions are analyzed with their parameters varied, in order to gain knowledge about their optima positions and heights, saddles widths and levels
21.
Maciej Komosiński, Jan Polak
Evolving free-form stick ski jumpers and their neural control systems Proceedings Article
In: Arabas, J. (Ed.): Evolutionary Computation and Global Optimization, pp. 103-110, Warsaw University of Technology Publishing House Warsaw University of Technology Publishing House, 2009, ISSN: 0137-2343.
Abstract | Links | BibTeX | Tagi: kaeiog
@inproceedings{KAEiOG2009.103-110,
title = {Evolving free-form stick ski jumpers and their neural control systems},
author = {Maciej Komosiński and Jan Polak},
editor = {J. Arabas},
url = {https://troja.uksw.edu.pl/pdf/kaeiog/KAEiOG2009.103-110.pdf},
issn = {0137-2343},
year = {2009},
date = {2009-01-01},
booktitle = {Evolutionary Computation and Global Optimization},
number = {169},
pages = {103-110},
publisher = {Warsaw University of Technology Publishing House},
organization = {Warsaw University of Technology Publishing House},
series = {Prace Naukowe, Elektronika},
abstract = {This paper concerns evolution of three-dimensional stick agents in a simplified ski-jumping task. Both body morphologies and control systems are optimized. Evolutionary processes are performed in a range of conditions: the air drag and the friction of the ramp varies. Qualitative and quantitative analyses are presented that show how jump distance, jump height, and flight trajectory depend on environmental conditions. Jumping and landing strategies are investigated, and the most interesting evolved behaviors are reported.},
keywords = {kaeiog},
pubstate = {published},
tppubtype = {inproceedings}
}
This paper concerns evolution of three-dimensional stick agents in a simplified ski-jumping task. Both body morphologies and control systems are optimized. Evolutionary processes are performed in a range of conditions: the air drag and the friction of the ramp varies. Qualitative and quantitative analyses are presented that show how jump distance, jump height, and flight trajectory depend on environmental conditions. Jumping and landing strategies are investigated, and the most interesting evolved behaviors are reported.
22.
Roman Galar
Evolutionary Viewpoint on the Present Crisis Proceedings Article
In: Arabas, J. (Ed.): Evolutionary Computation and Global Optimization, pp. 57-62, Warsaw University of Technology Publishing House Warsaw University of Technology Publishing House, 2009, ISSN: 0137-2343.
Abstract | Links | BibTeX | Tagi: kaeiog
@inproceedings{KAEiOG2009.57-62,
title = {Evolutionary Viewpoint on the Present Crisis},
author = {Roman Galar},
editor = {J. Arabas},
url = {https://troja.uksw.edu.pl/pdf/kaeiog/KAEiOG2009.57-62.pdf},
issn = {0137-2343},
year = {2009},
date = {2009-01-01},
booktitle = {Evolutionary Computation and Global Optimization},
number = {169},
pages = {57-62},
publisher = {Warsaw University of Technology Publishing House},
organization = {Warsaw University of Technology Publishing House},
series = {Prace Naukowe, Elektronika},
abstract = {Evolutionary algorithms belong to these rare brands of rigorous fields of science that offer meaningful insights into creative activities of human societies. This contribution is a sketch of a possible study on the causes of the currently developing economic crisis from this perspective. Economy is considered as an adaptive system, which reached a degenerative stage due to mismanagement, resulting from misconception. References to simulated evolution are used to point on several malicious policies.},
keywords = {kaeiog},
pubstate = {published},
tppubtype = {inproceedings}
}
Evolutionary algorithms belong to these rare brands of rigorous fields of science that offer meaningful insights into creative activities of human societies. This contribution is a sketch of a possible study on the causes of the currently developing economic crisis from this perspective. Economy is considered as an adaptive system, which reached a degenerative stage due to mismanagement, resulting from misconception. References to simulated evolution are used to point on several malicious policies.
23.
Jarosław Stańczak
Evolutionary algorithm for market simulations Proceedings Article
In: Arabas, J. (Ed.): Evolutionary Computation and Global Optimization, pp. 163-172, Warsaw University of Technology Publishing House Warsaw University of Technology Publishing House, 2009, ISSN: 0137-2343.
Abstract | Links | BibTeX | Tagi: kaeiog
@inproceedings{KAEiOG2009.163-172,
title = {Evolutionary algorithm for market simulations},
author = {Jarosław Stańczak},
editor = {J. Arabas},
url = {https://troja.uksw.edu.pl/pdf/kaeiog/KAEiOG2009.163-172.pdf},
issn = {0137-2343},
year = {2009},
date = {2009-01-01},
booktitle = {Evolutionary Computation and Global Optimization},
number = {169},
pages = {163-172},
publisher = {Warsaw University of Technology Publishing House},
organization = {Warsaw University of Technology Publishing House},
series = {Prace Naukowe, Elektronika},
abstract = {Evolutionary algorithms (EA) have recently become not only tools for efficient optimization of very difficult problems, but also are applied to simulate behavior of different kinds of systems, among them also games, economic system and markets. This new domain of EA applications is known as Agent-Based Computational Economics (ACE). This article describes two applications of EA to simple market simulations. The main aim of EA in this approach is to find (sub-) optimal strategies of behavior for the participants of that market game. The first example is a simple market with only several participants and one product, well known as an instance of Cournot oligopoly game. The second example is more complicated and describes a market of permits for CO2 emission, created by the Kyoto Protocol and introduces to the simple Walrasian model the influence of calculated on-line permits prices.},
keywords = {kaeiog},
pubstate = {published},
tppubtype = {inproceedings}
}
Evolutionary algorithms (EA) have recently become not only tools for efficient optimization of very difficult problems, but also are applied to simulate behavior of different kinds of systems, among them also games, economic system and markets. This new domain of EA applications is known as Agent-Based Computational Economics (ACE). This article describes two applications of EA to simple market simulations. The main aim of EA in this approach is to find (sub-) optimal strategies of behavior for the participants of that market game. The first example is a simple market with only several participants and one product, well known as an instance of Cournot oligopoly game. The second example is more complicated and describes a market of permits for CO2 emission, created by the Kyoto Protocol and introduces to the simple Walrasian model the influence of calculated on-line permits prices.
24.
Rafał Dąbrowski, Bartłomiej Jacek Kubica
Comparison of Interval C/C++ Libraries in Global Optimization Proceedings Article
In: Arabas, J. (Ed.): Evolutionary Computation and Global Optimization, pp. 51-56, Warsaw University of Technology Publishing House Warsaw University of Technology Publishing House, 2009, ISSN: 0137-2343.
Abstract | Links | BibTeX | Tagi: kaeiog
@inproceedings{KAEiOG2009.51-56,
title = {Comparison of Interval C/C++ Libraries in Global Optimization},
author = {Rafał Dąbrowski and Bartłomiej Jacek Kubica},
editor = {J. Arabas},
url = {https://troja.uksw.edu.pl/pdf/kaeiog/KAEiOG2009.51-56.pdf},
issn = {0137-2343},
year = {2009},
date = {2009-01-01},
booktitle = {Evolutionary Computation and Global Optimization},
number = {169},
pages = {51-56},
publisher = {Warsaw University of Technology Publishing House},
organization = {Warsaw University of Technology Publishing House},
series = {Prace Naukowe, Elektronika},
abstract = {This article contains results of examination and comparison of some most popular interval libraries. Comparative analysis was based on investigating the efficiency of computations of simple functions and efficiency of the Interval-Branch-And-Bound global optimization method.},
keywords = {kaeiog},
pubstate = {published},
tppubtype = {inproceedings}
}
This article contains results of examination and comparison of some most popular interval libraries. Comparative analysis was based on investigating the efficiency of computations of simple functions and efficiency of the Interval-Branch-And-Bound global optimization method.
25.
Urszula Boryczka, Przemysław Juszczuk, Leszek Kłosowicz
A Comparative Study of Various Strategies in Differential Evolution Proceedings Article
In: Arabas, J. (Ed.): Evolutionary Computation and Global Optimization, pp. 19-26, Warsaw University of Technology Publishing House Warsaw University of Technology Publishing House, 2009, ISSN: 0137-2343.
Abstract | Links | BibTeX | Tagi: kaeiog
@inproceedings{KAEiOG2009.19-26,
title = {A Comparative Study of Various Strategies in Differential Evolution},
author = {Urszula Boryczka and Przemysław Juszczuk and Leszek Kłosowicz},
editor = {J. Arabas},
url = {https://troja.uksw.edu.pl/pdf/kaeiog/KAEiOG2009.19-26.pdf},
issn = {0137-2343},
year = {2009},
date = {2009-01-01},
booktitle = {Evolutionary Computation and Global Optimization},
number = {169},
pages = {19-26},
publisher = {Warsaw University of Technology Publishing House},
organization = {Warsaw University of Technology Publishing House},
series = {Prace Naukowe, Elektronika},
abstract = {This paper presents a comparison of various strategies of differential evolution. Differential evolution (DE) is a simple and powerful optimization method, which is mainly applied to numerical optimization and many other problems (for example: neural network train, filter design or image analysis). The comparison of various modifications (named strategies) of DE algorithm allows to choose the algorithm version which is best adjusted to desirable requirements. Three parameters are tested: speed, accuracy and completeness. The first section of this article presents general optimization problem and says a little about methods used to function optimization. The next section describes differential evolution basic algorithm is presented. Two different crossover methods, process of initial population creation and basic mutation schema are described. The third section describes the most popular DE strategies. In the fourth section a new modification (called lambda-modification) of DE algorithm is presented. Next section provides basic information about four test functions and differential evolution parameters used in research. The paper presents then summary and final conclusions.},
keywords = {kaeiog},
pubstate = {published},
tppubtype = {inproceedings}
}
This paper presents a comparison of various strategies of differential evolution. Differential evolution (DE) is a simple and powerful optimization method, which is mainly applied to numerical optimization and many other problems (for example: neural network train, filter design or image analysis). The comparison of various modifications (named strategies) of DE algorithm allows to choose the algorithm version which is best adjusted to desirable requirements. Three parameters are tested: speed, accuracy and completeness. The first section of this article presents general optimization problem and says a little about methods used to function optimization. The next section describes differential evolution basic algorithm is presented. Two different crossover methods, process of initial population creation and basic mutation schema are described. The third section describes the most popular DE strategies. In the fourth section a new modification (called lambda-modification) of DE algorithm is presented. Next section provides basic information about four test functions and differential evolution parameters used in research. The paper presents then summary and final conclusions.
26.
Piotr Osiński, Ewa Niewiadomska-Szynkiewicz
Comparative Study of Single System Image Clusters Proceedings Article
In: Arabas, J. (Ed.): Evolutionary Computation and Global Optimization, pp. 145-154, Warsaw University of Technology Publishing House Warsaw University of Technology Publishing House, 2009, ISSN: 0137-2343.
Abstract | Links | BibTeX | Tagi: kaeiog
@inproceedings{KAEiOG2009.145-154,
title = {Comparative Study of Single System Image Clusters},
author = {Piotr Osiński and Ewa Niewiadomska-Szynkiewicz},
editor = {J. Arabas},
url = {https://troja.uksw.edu.pl/pdf/kaeiog/KAEiOG2009.145-154.pdf},
issn = {0137-2343},
year = {2009},
date = {2009-01-01},
booktitle = {Evolutionary Computation and Global Optimization},
number = {169},
pages = {145-154},
publisher = {Warsaw University of Technology Publishing House},
organization = {Warsaw University of Technology Publishing House},
series = {Prace Naukowe, Elektronika},
abstract = {Cluster computing has been identified as an important new technology that may be used to solve complex scientific and engineering problems as well as to tackle many projects in commerce and industry. In this paper we present an overview of three Linuxbased SSI cluster systems. We compare their stability, performance and efficiency},
keywords = {kaeiog},
pubstate = {published},
tppubtype = {inproceedings}
}
Cluster computing has been identified as an important new technology that may be used to solve complex scientific and engineering problems as well as to tackle many projects in commerce and industry. In this paper we present an overview of three Linuxbased SSI cluster systems. We compare their stability, performance and efficiency
27.
Marek W. Gutowski
Breakthrough in Interval Data Fitting II. From Ranges to Means and Standard Deviations Proceedings Article
In: Arabas, J. (Ed.): Evolutionary Computation and Global Optimization, pp. 73-78, Warsaw University of Technology Publishing House Warsaw University of Technology Publishing House, 2009, ISSN: 0137-2343.
Abstract | Links | BibTeX | Tagi: kaeiog
@inproceedings{KAEiOG2009.73-78,
title = {Breakthrough in Interval Data Fitting II. From Ranges to Means and Standard Deviations},
author = {Marek W. Gutowski},
editor = {J. Arabas},
url = {https://troja.uksw.edu.pl/pdf/kaeiog/KAEiOG2009.73-78.pdf},
issn = {0137-2343},
year = {2009},
date = {2009-01-01},
booktitle = {Evolutionary Computation and Global Optimization},
number = {169},
pages = {73-78},
publisher = {Warsaw University of Technology Publishing House},
organization = {Warsaw University of Technology Publishing House},
series = {Prace Naukowe, Elektronika},
abstract = {Interval analysis, when applied to the so called problem of experimental data fitting, appears to be still in its infancy. Sometimes, partly because of the unrivaled reliability of interval methods, we do not obtain any results at all. Worse yet, if this happens, then we are left in the state of complete ignorance concerning the unknown parameters of interest. This is in sharp contrast with widespread statistical methods of data analysis. In this paper I show the connections between those two approaches: how to process experimental data rigorously, using interval methods, and present the final results either as intervals (guaranteed, rigorous results) or in a more familiar probabilistic form: as a mean value and its standard deviation.},
keywords = {kaeiog},
pubstate = {published},
tppubtype = {inproceedings}
}
Interval analysis, when applied to the so called problem of experimental data fitting, appears to be still in its infancy. Sometimes, partly because of the unrivaled reliability of interval methods, we do not obtain any results at all. Worse yet, if this happens, then we are left in the state of complete ignorance concerning the unknown parameters of interest. This is in sharp contrast with widespread statistical methods of data analysis. In this paper I show the connections between those two approaches: how to process experimental data rigorously, using interval methods, and present the final results either as intervals (guaranteed, rigorous results) or in a more familiar probabilistic form: as a mean value and its standard deviation.
28.
Marek W. Gutowski
Breakthrough in Interval Data Fitting I. The Role of Hausdorff Distance Proceedings Article
In: Arabas, J. (Ed.): Evolutionary Computation and Global Optimization, pp. 63-72, Warsaw University of Technology Publishing House Warsaw University of Technology Publishing House, 2009, ISSN: 0137-2343.
Abstract | Links | BibTeX | Tagi: kaeiog
@inproceedings{KAEiOG2009.63-72,
title = {Breakthrough in Interval Data Fitting I. The Role of Hausdorff Distance},
author = {Marek W. Gutowski},
editor = {J. Arabas},
url = {https://troja.uksw.edu.pl/pdf/kaeiog/KAEiOG2009.63-72.pdf},
issn = {0137-2343},
year = {2009},
date = {2009-01-01},
booktitle = {Evolutionary Computation and Global Optimization},
number = {169},
pages = {63-72},
publisher = {Warsaw University of Technology Publishing House},
organization = {Warsaw University of Technology Publishing House},
series = {Prace Naukowe, Elektronika},
abstract = {This is the first of two papers describing the process of fitting experimental data under interval uncertainty. Probably the most often encountered application of global optimization methods is finding the so called best fitted values of various parameters, as well as their uncertainties, based on experimental data. Here I present the methodology, designed from the very beginning as an interval-oriented tool, meant to replace to the large extent the famous Least Squares (LSQ) and other slightly less popular methods. Contrary to its classical counterparts, the presented method does not require any poorly justified prior assumptions, like smallness of experimental uncertainties or their normal (Gaussian) distribution. Using interval approach, we are able to fit rigorously and reliably not only the simple functional dependencies, with no extra effort when both variables are uncertain, but also the cases when the constitutive equation exists in implicit rather than explicit functional form. The magic word and a key to success of interval approach appears the Hausdorff distance.},
keywords = {kaeiog},
pubstate = {published},
tppubtype = {inproceedings}
}
This is the first of two papers describing the process of fitting experimental data under interval uncertainty. Probably the most often encountered application of global optimization methods is finding the so called best fitted values of various parameters, as well as their uncertainties, based on experimental data. Here I present the methodology, designed from the very beginning as an interval-oriented tool, meant to replace to the large extent the famous Least Squares (LSQ) and other slightly less popular methods. Contrary to its classical counterparts, the presented method does not require any poorly justified prior assumptions, like smallness of experimental uncertainties or their normal (Gaussian) distribution. Using interval approach, we are able to fit rigorously and reliably not only the simple functional dependencies, with no extra effort when both variables are uncertain, but also the cases when the constitutive equation exists in implicit rather than explicit functional form. The magic word and a key to success of interval approach appears the Hausdorff distance.
29.
Tomasz Gwizdałła
Belief Propagation and Potts Model Proceedings Article
In: Arabas, J. (Ed.): Evolutionary Computation and Global Optimization, pp. 79-86, Warsaw University of Technology Publishing House Warsaw University of Technology Publishing House, 2009, ISSN: 0137-2343.
Abstract | Links | BibTeX | Tagi: kaeiog
@inproceedings{KAEiOG2009.79-86,
title = {Belief Propagation and Potts Model},
author = {Tomasz Gwizdałła},
editor = {J. Arabas},
url = {https://troja.uksw.edu.pl/pdf/kaeiog/KAEiOG2009.79-86.pdf},
issn = {0137-2343},
year = {2009},
date = {2009-01-01},
booktitle = {Evolutionary Computation and Global Optimization},
number = {169},
pages = {79-86},
publisher = {Warsaw University of Technology Publishing House},
organization = {Warsaw University of Technology Publishing House},
series = {Prace Naukowe, Elektronika},
abstract = {In the paper there are presented the results of steady state searching for 3-5 state Potts model. The results of simulation are presented and its efficiency is discussed. Finally the model is adapted to the trial of reconstruction of grey scaled images initially blurred by the special modi—cation procedure. The results show the usefulness of the simple method in the process of contour recognition.},
keywords = {kaeiog},
pubstate = {published},
tppubtype = {inproceedings}
}
In the paper there are presented the results of steady state searching for 3-5 state Potts model. The results of simulation are presented and its efficiency is discussed. Finally the model is adapted to the trial of reconstruction of grey scaled images initially blurred by the special modi—cation procedure. The results show the usefulness of the simple method in the process of contour recognition.
30.
Joanna Kołodziej, Marcin Rybarski
An Application of Hierarchical Genetic Strategy in sequential scheduling of permutated independent jobs Proceedings Article
In: Arabas, J. (Ed.): Evolutionary Computation and Global Optimization, pp. 95-102, Warsaw University of Technology Publishing House Warsaw University of Technology Publishing House, 2009, ISSN: 0137-2343.
Abstract | Links | BibTeX | Tagi: kaeiog
@inproceedings{KAEiOG2009.95-102,
title = {An Application of Hierarchical Genetic Strategy in sequential scheduling of permutated independent jobs},
author = {Joanna Kołodziej and Marcin Rybarski},
editor = {J. Arabas},
url = {https://troja.uksw.edu.pl/pdf/kaeiog/KAEiOG2009.95-102.pdf},
issn = {0137-2343},
year = {2009},
date = {2009-01-01},
booktitle = {Evolutionary Computation and Global Optimization},
number = {169},
pages = {95-102},
publisher = {Warsaw University of Technology Publishing House},
organization = {Warsaw University of Technology Publishing House},
series = {Prace Naukowe, Elektronika},
abstract = {The aim of this paper is to present an implementation of Hierarchic Genetic Strategy (HGS) in solving the Permutation Flowshop Scheduling Problem (PFSP). We defined a hierarchic scheduler based on HGS structure for the exploration of the wide and complicated optimization landscape studied by Reeves [6]. The objective of our work is to examine several variations of HGS operators in order to identify a configuration of operators and parameters that works best for the problem. From the experimental study we observed that HGS implementation outperforms existing schedulers in many of considered instances of a static benchmark for the problem.},
keywords = {kaeiog},
pubstate = {published},
tppubtype = {inproceedings}
}
The aim of this paper is to present an implementation of Hierarchic Genetic Strategy (HGS) in solving the Permutation Flowshop Scheduling Problem (PFSP). We defined a hierarchic scheduler based on HGS structure for the exploration of the wide and complicated optimization landscape studied by Reeves [6]. The objective of our work is to examine several variations of HGS operators in order to identify a configuration of operators and parameters that works best for the problem. From the experimental study we observed that HGS implementation outperforms existing schedulers in many of considered instances of a static benchmark for the problem.
31.
Daniel Andrzej Piętak, Paweł J. Napiórkowski, Zbigniew Walczak, Jacek Wojciechowski
Application of Genetic Algorithm with Real Representation to COULEX Data Analysis Proceedings Article
In: Arabas, J. (Ed.): Evolutionary Computation and Global Optimization, pp. 155-162, Warsaw University of Technology Publishing House Warsaw University of Technology Publishing House, 2009, ISSN: 0137-2343.
Abstract | Links | BibTeX | Tagi: kaeiog
@inproceedings{KAEiOG2009.155-162,
title = {Application of Genetic Algorithm with Real Representation to COULEX Data Analysis},
author = {Daniel Andrzej Piętak and Paweł J. Napiórkowski and Zbigniew Walczak and Jacek Wojciechowski},
editor = {J. Arabas},
url = {https://troja.uksw.edu.pl/pdf/kaeiog/KAEiOG2009.155-162.pdf},
issn = {0137-2343},
year = {2009},
date = {2009-01-01},
booktitle = {Evolutionary Computation and Global Optimization},
number = {169},
pages = {155-162},
publisher = {Warsaw University of Technology Publishing House},
organization = {Warsaw University of Technology Publishing House},
series = {Prace Naukowe, Elektronika},
abstract = {The development of a new genetic algorithm designed for the data analysis in the nuclear physic experiment is presented. The calculations performed with the multidimensional test function identified the weakness of the real representation implemented to the genetic algorithm. The tests presented in this paper will result in upgrade of genetic operators which will be applied for the real physic case of the COULEX data analysis.},
keywords = {kaeiog},
pubstate = {published},
tppubtype = {inproceedings}
}
The development of a new genetic algorithm designed for the data analysis in the nuclear physic experiment is presented. The calculations performed with the multidimensional test function identified the weakness of the real representation implemented to the genetic algorithm. The tests presented in this paper will result in upgrade of genetic operators which will be applied for the real physic case of the COULEX data analysis.
2008
32.
Joanna Sztapczyńska, Roman Śmierzchalski
Strength Pareto Evolutionary Approach to Weather Routing – Preliminary Results Proceedings Article
In: Arabas, J. (Ed.): Evolutionary Computation and Global Optimization, pp. 221-228, Warsaw University of Technology Publishing House Warsaw University of Technology Publishing House, Augustów, Poland, 2008, ISBN: 0137-2343.
Abstract | Links | BibTeX | Tagi: kaeiog
@inproceedings{KAEiOG2008.24,
title = {Strength Pareto Evolutionary Approach to Weather Routing – Preliminary Results},
author = {Joanna Sztapczyńska and Roman Śmierzchalski},
editor = {J. Arabas},
url = {https://troja.uksw.edu.pl/pdf/kaeiog/KAEiOG2008.24.pdf},
isbn = {0137-2343},
year = {2008},
date = {2008-01-01},
booktitle = {Evolutionary Computation and Global Optimization},
number = {165},
pages = {221-228},
publisher = {Warsaw University of Technology Publishing House},
address = {Augustów, Poland},
organization = {Warsaw University of Technology Publishing House},
series = {Prace Naukowe, Elektronika},
abstract = {This paper describes application of Strength Pareto Evolutionary Algorithm (SPEA) to an optimization problem in weather routing. The paper includes a description of SPEA algorithm and defines the constrained weather routing optimization problem. It also presents a proposal and preliminary test results of SPEA-based weather routing evolutionary algorithm.},
keywords = {kaeiog},
pubstate = {published},
tppubtype = {inproceedings}
}
This paper describes application of Strength Pareto Evolutionary Algorithm (SPEA) to an optimization problem in weather routing. The paper includes a description of SPEA algorithm and defines the constrained weather routing optimization problem. It also presents a proposal and preliminary test results of SPEA-based weather routing evolutionary algorithm.
33.
Artur Stasikowski, Tomasz Gwizdałła
Some New Methods in the Evolutionary Search of Atomic Cluster Shape Proceedings Article
In: Arabas, J. (Ed.): Evolutionary Computation and Global Optimization, pp. 213-220, Warsaw University of Technology Publishing House Warsaw University of Technology Publishing House, Augustów, Poland, 2008, ISBN: 0137-2343.
Abstract | Links | BibTeX | Tagi: kaeiog
@inproceedings{KAEiOG2008.23,
title = {Some New Methods in the Evolutionary Search of Atomic Cluster Shape},
author = {Artur Stasikowski and Tomasz Gwizdałła},
editor = {J. Arabas},
url = {https://troja.uksw.edu.pl/pdf/kaeiog/KAEiOG2008.23.pdf},
isbn = {0137-2343},
year = {2008},
date = {2008-01-01},
booktitle = {Evolutionary Computation and Global Optimization},
number = {165},
pages = {213-220},
publisher = {Warsaw University of Technology Publishing House},
address = {Augustów, Poland},
organization = {Warsaw University of Technology Publishing House},
series = {Prace Naukowe, Elektronika},
abstract = {The problem of atomic structure optimization related to the minimization of its total energy is a fundamental physical problem as well as hard computational task. For the few last years we have presented some observations concerning the advantages and drawbacks of EA used as a tool to solve such questions. In this paper we would like to present some new approaches devoted to improve the general, not problem oriented part of algorithm. The results obtained for two techniques: population migration and Opposition- Based Learning show that the specific operators, designed for the given problem are still the most important part of algorithm.},
keywords = {kaeiog},
pubstate = {published},
tppubtype = {inproceedings}
}
The problem of atomic structure optimization related to the minimization of its total energy is a fundamental physical problem as well as hard computational task. For the few last years we have presented some observations concerning the advantages and drawbacks of EA used as a tool to solve such questions. In this paper we would like to present some new approaches devoted to improve the general, not problem oriented part of algorithm. The results obtained for two techniques: population migration and Opposition- Based Learning show that the specific operators, designed for the given problem are still the most important part of algorithm.
34.
Przemysław Miazga
Simulation-Based Optimization – Myths and Reality Proceedings Article
In: Arabas, J. (Ed.): Evolutionary Computation and Global Optimization, pp. 131-138, Warsaw University of Technology Publishing House Warsaw University of Technology Publishing House, Augustów, Poland, 2008, ISBN: 0137-2343.
Abstract | Links | BibTeX | Tagi: kaeiog
@inproceedings{KAEiOG2008.14,
title = {Simulation-Based Optimization – Myths and Reality},
author = {Przemysław Miazga},
editor = {J. Arabas},
url = {https://troja.uksw.edu.pl/pdf/kaeiog/KAEiOG2008.14.pdf},
isbn = {0137-2343},
year = {2008},
date = {2008-01-01},
booktitle = {Evolutionary Computation and Global Optimization},
number = {165},
pages = {131-138},
publisher = {Warsaw University of Technology Publishing House},
address = {Augustów, Poland},
organization = {Warsaw University of Technology Publishing House},
series = {Prace Naukowe, Elektronika},
abstract = {The present paper discusses the influence of simulation model accuracy on the convergence of electromagnetic structure simulation-based optimization. Neither response surface approximation method nor the algorithm of moving window filtering, commonly used for simulation error compensation, is not fully capable of guaranteeing proper convergence. The non-expensive device model with coarse meshing and a modified error compensation method can yield satisfactory results in a reasonable time.},
keywords = {kaeiog},
pubstate = {published},
tppubtype = {inproceedings}
}
The present paper discusses the influence of simulation model accuracy on the convergence of electromagnetic structure simulation-based optimization. Neither response surface approximation method nor the algorithm of moving window filtering, commonly used for simulation error compensation, is not fully capable of guaranteeing proper convergence. The non-expensive device model with coarse meshing and a modified error compensation method can yield satisfactory results in a reasonable time.
35.
Robert Sawko, Grzegorz Skorupa
A New Approach to Global Optimization: Sheep Optimization Proceedings Article
In: Arabas, J. (Ed.): Evolutionary Computation and Global Optimization, pp. 181-188, Warsaw University of Technology Publishing House Warsaw University of Technology Publishing House, Augustów, Poland, 2008, ISBN: 0137-2343.
Abstract | Links | BibTeX | Tagi: kaeiog
@inproceedings{KAEiOG2008.20,
title = {A New Approach to Global Optimization: Sheep Optimization},
author = {Robert Sawko and Grzegorz Skorupa},
editor = {J. Arabas},
url = {https://troja.uksw.edu.pl/pdf/kaeiog/KAEiOG2008.20.pdf},
isbn = {0137-2343},
year = {2008},
date = {2008-01-01},
booktitle = {Evolutionary Computation and Global Optimization},
number = {165},
pages = {181-188},
publisher = {Warsaw University of Technology Publishing House},
address = {Augustów, Poland},
organization = {Warsaw University of Technology Publishing House},
series = {Prace Naukowe, Elektronika},
abstract = {The paper presents a new meta-heuristics for solving continuous optimization problems of finding a global optimum. The algorithm is based on the behavior of a specific animal species. The main inspiration for this method was a flock of sheep, which after consuming the grass in a certain area, starts to search for new sources of food when the local sources are depleted. A special penalty function to enforce that kind of behavior is proposed. The penalty function together with a gradient-based optimization algorithm became a mechanism for avoiding local maximums and for more thorough exploration of the set of feasible solutions. The comparison with the basic genetic algorithm is presented.},
keywords = {kaeiog},
pubstate = {published},
tppubtype = {inproceedings}
}
The paper presents a new meta-heuristics for solving continuous optimization problems of finding a global optimum. The algorithm is based on the behavior of a specific animal species. The main inspiration for this method was a flock of sheep, which after consuming the grass in a certain area, starts to search for new sources of food when the local sources are depleted. A special penalty function to enforce that kind of behavior is proposed. The penalty function together with a gradient-based optimization algorithm became a mechanism for avoiding local maximums and for more thorough exploration of the set of feasible solutions. The comparison with the basic genetic algorithm is presented.
36.
Piotr Wąsiewicz, Anna Wójtowicz-Krawiec, Andrzej Płucienniczak
Molecular NOR Logic Gate Proceedings Article
In: Arabas, J. (Ed.): Evolutionary Computation and Global Optimization, pp. 237-244, Warsaw University of Technology Publishing House Warsaw University of Technology Publishing House, Augustów, Poland, 2008, ISBN: 0137-2343.
Abstract | Links | BibTeX | Tagi: kaeiog
@inproceedings{KAEiOG2008.26,
title = {Molecular NOR Logic Gate},
author = {Piotr Wąsiewicz and Anna Wójtowicz-Krawiec and Andrzej Płucienniczak},
editor = {J. Arabas},
url = {https://troja.uksw.edu.pl/pdf/kaeiog/KAEiOG2008.26.pdf},
isbn = {0137-2343},
year = {2008},
date = {2008-01-01},
booktitle = {Evolutionary Computation and Global Optimization},
number = {165},
pages = {237-244},
publisher = {Warsaw University of Technology Publishing House},
address = {Augustów, Poland},
organization = {Warsaw University of Technology Publishing House},
series = {Prace Naukowe, Elektronika},
abstract = {Molecular computing created for implementing logic systems, solving NP-difficult problems on nanoscale depends on DNA self-assembly abilities and on modifying DNA with the help of enzymes during genetic operations. In the typical DNA computing a sequence of operations executed on DNA molecules in parallel is called an algorithm, which is also determined by a model of DNA chains. This methodology is similar to the soft hardware specialized architecture driven here by heating, cooling and enzymes, especially polymerases used for copying strings. This work presents a unique approach to implementation of OR, NOR logic gates on molecules. It requires the representation of signals by DNA molecules. The presented method allows for constructing logic gates with many inputs and for executing them at the same quantity of elementary operations, regardless of a number of input signals. The NOR gate was implemented with the help of modified polymerase Taq, which stops its activity, when it meets a molecular obstacle on its way. The appropriate experiment was conducted to confirm the possibilities of the suggested implementation. Laboratory results were discussed.},
keywords = {kaeiog},
pubstate = {published},
tppubtype = {inproceedings}
}
Molecular computing created for implementing logic systems, solving NP-difficult problems on nanoscale depends on DNA self-assembly abilities and on modifying DNA with the help of enzymes during genetic operations. In the typical DNA computing a sequence of operations executed on DNA molecules in parallel is called an algorithm, which is also determined by a model of DNA chains. This methodology is similar to the soft hardware specialized architecture driven here by heating, cooling and enzymes, especially polymerases used for copying strings. This work presents a unique approach to implementation of OR, NOR logic gates on molecules. It requires the representation of signals by DNA molecules. The presented method allows for constructing logic gates with many inputs and for executing them at the same quantity of elementary operations, regardless of a number of input signals. The NOR gate was implemented with the help of modified polymerase Taq, which stops its activity, when it meets a molecular obstacle on its way. The appropriate experiment was conducted to confirm the possibilities of the suggested implementation. Laboratory results were discussed.
37.
Jan J. Mulawka
A Molecular Inference via Colorimetric Change Proceedings Article
In: Arabas, J. (Ed.): Evolutionary Computation and Global Optimization, pp. 139-146, Warsaw University of Technology Publishing House Warsaw University of Technology Publishing House, Augustów, Poland, 2008, ISBN: 0137-2343.
Abstract | Links | BibTeX | Tagi: kaeiog
@inproceedings{KAEiOG2008.15,
title = {A Molecular Inference via Colorimetric Change},
author = {Jan J. Mulawka},
editor = {J. Arabas},
url = {https://troja.uksw.edu.pl/pdf/kaeiog/KAEiOG2008.15.pdf},
isbn = {0137-2343},
year = {2008},
date = {2008-01-01},
booktitle = {Evolutionary Computation and Global Optimization},
number = {165},
pages = {139-146},
publisher = {Warsaw University of Technology Publishing House},
address = {Augustów, Poland},
organization = {Warsaw University of Technology Publishing House},
series = {Prace Naukowe, Elektronika},
abstract = {In this work the inference performed on DNA molecules is considered.The process known as self-assembling of DNA strands is fundamental to achieve longer chains of molecules encoding knowledge base. By proper organization of this process any logic operations can be accomplished. In particular, systems based on decision trees may be easy assembled. A severe problem of nano-systems is to provide communication between nano-world and real-world. To solve this problem it is proposed to make use of colorimetric change phenomenon. Here an inference procedure is proposed that allows to check the knowledge base in form of decision tree. Although DNA strands react in the nano-world, due to optical read-out the inference result is attained quickly and easy. Thus, complicated and expensive operations of genetic engineering laboratory are eliminated.},
keywords = {kaeiog},
pubstate = {published},
tppubtype = {inproceedings}
}
In this work the inference performed on DNA molecules is considered.The process known as self-assembling of DNA strands is fundamental to achieve longer chains of molecules encoding knowledge base. By proper organization of this process any logic operations can be accomplished. In particular, systems based on decision trees may be easy assembled. A severe problem of nano-systems is to provide communication between nano-world and real-world. To solve this problem it is proposed to make use of colorimetric change phenomenon. Here an inference procedure is proposed that allows to check the knowledge base in form of decision tree. Although DNA strands react in the nano-world, due to optical read-out the inference result is attained quickly and easy. Thus, complicated and expensive operations of genetic engineering laboratory are eliminated.
38.
Przemysław Kobylański
Modeling Fuzzy Intervals With Constraint Logic Programming Proceedings Article
In: Arabas, J. (Ed.): Evolutionary Computation and Global Optimization, pp. 9-22, Warsaw University of Technology Publishing House Warsaw University of Technology Publishing House, Augustów, Poland, 2008, ISBN: 0137-2343.
Abstract | Links | BibTeX | Tagi: kaeiog
@inproceedings{KAEiOG2008.1,
title = {Modeling Fuzzy Intervals With Constraint Logic Programming},
author = {Przemysław Kobylański},
editor = {J. Arabas},
url = {https://troja.uksw.edu.pl/pdf/kaeiog/KAEiOG2008.1.pdf},
isbn = {0137-2343},
year = {2008},
date = {2008-01-01},
booktitle = {Evolutionary Computation and Global Optimization},
number = {165},
pages = {9-22},
publisher = {Warsaw University of Technology Publishing House},
address = {Augustów, Poland},
organization = {Warsaw University of Technology Publishing House},
series = {Prace Naukowe, Elektronika},
abstract = {In this paper the method of modeling fuzzy intervals in fuzzy decisionmaking is presented. Described method makes use of constraint logic programming and it is based on the concept of descriptors. This approach is very general and it is consistent with Zadehtextquoterights extension principle and Bellman-Zadeh concept of fuzzy decision making. It fulfills Klirtextquoterights requisite constraint and deals effectively with a drowning effect too. The idea of descriptors of fuzzy intervals and fuzzy constraints is illustrated with computational example of flexible scheduling problem in which robust for drowning effect schedule is found.},
keywords = {kaeiog},
pubstate = {published},
tppubtype = {inproceedings}
}
In this paper the method of modeling fuzzy intervals in fuzzy decisionmaking is presented. Described method makes use of constraint logic programming and it is based on the concept of descriptors. This approach is very general and it is consistent with Zadehtextquoterights extension principle and Bellman-Zadeh concept of fuzzy decision making. It fulfills Klirtextquoterights requisite constraint and deals effectively with a drowning effect too. The idea of descriptors of fuzzy intervals and fuzzy constraints is illustrated with computational example of flexible scheduling problem in which robust for drowning effect schedule is found.
39.
Robert Nowak, Marcin Romaniuk
Long DNA Strands Synthesis Optimizing Proceedings Article
In: Arabas, J. (Ed.): Evolutionary Computation and Global Optimization, pp. 157-164, Warsaw University of Technology Publishing House Warsaw University of Technology Publishing House, Augustów, Poland, 2008, ISBN: 0137-2343.
Abstract | Links | BibTeX | Tagi: kaeiog
@inproceedings{KAEiOG2008.17,
title = {Long DNA Strands Synthesis Optimizing},
author = {Robert Nowak and Marcin Romaniuk},
editor = {J. Arabas},
url = {https://troja.uksw.edu.pl/pdf/kaeiog/KAEiOG2008.17.pdf},
isbn = {0137-2343},
year = {2008},
date = {2008-01-01},
booktitle = {Evolutionary Computation and Global Optimization},
number = {165},
pages = {157-164},
publisher = {Warsaw University of Technology Publishing House},
address = {Augustów, Poland},
organization = {Warsaw University of Technology Publishing House},
series = {Prace Naukowe, Elektronika},
abstract = {The method described in this paper helps to syntheses DNA (deoxyribonucleic acid) molecules with length about 1000 bp, using typical techniques enable to create strands of length up to 70 bp. The given DNA strand is divided into smaller fragments, and next these fragments are connected by proposed protocol in genetic laboratory. The evolutionary algorithm is used to find the optimal solution. The freely accessible application called longdna, based on presented ideas was implemented and tested on simulated and real data.},
keywords = {kaeiog},
pubstate = {published},
tppubtype = {inproceedings}
}
The method described in this paper helps to syntheses DNA (deoxyribonucleic acid) molecules with length about 1000 bp, using typical techniques enable to create strands of length up to 70 bp. The given DNA strand is divided into smaller fragments, and next these fragments are connected by proposed protocol in genetic laboratory. The evolutionary algorithm is used to find the optimal solution. The freely accessible application called longdna, based on presented ideas was implemented and tested on simulated and real data.
40.
Ewa Niewiadomska-Szynkiewicz, Agnieszka Zawadzka
Integrated Software Platform for Parallel Global Optimization Proceedings Article
In: Arabas, J. (Ed.): Evolutionary Computation and Global Optimization, pp. 147-156, Warsaw University of Technology Publishing House Warsaw University of Technology Publishing House, Augustów, Poland, 2008, ISBN: 0137-2343.
Abstract | Links | BibTeX | Tagi: kaeiog
@inproceedings{KAEiOG2008.16,
title = {Integrated Software Platform for Parallel Global Optimization},
author = {Ewa Niewiadomska-Szynkiewicz and Agnieszka Zawadzka},
editor = {J. Arabas},
url = {https://troja.uksw.edu.pl/pdf/kaeiog/KAEiOG2008.16.pdf},
isbn = {0137-2343},
year = {2008},
date = {2008-01-01},
booktitle = {Evolutionary Computation and Global Optimization},
number = {165},
pages = {147-156},
publisher = {Warsaw University of Technology Publishing House},
address = {Augustów, Poland},
organization = {Warsaw University of Technology Publishing House},
series = {Prace Naukowe, Elektronika},
abstract = {The paper is concerned with global optimization techniques and their parallel implementation. We describe an integrated software platform GOOL–PV (Global Optimization Object-oriented Library–Parallel Version) that provides the tools for solving complex optimization problems on parallel and multi-core computers or computer clusters. Finally, we present the comparative study of sequential and parallel global optimization algorithms based on numerical results for a standard set of multimodal functions.},
keywords = {kaeiog},
pubstate = {published},
tppubtype = {inproceedings}
}
The paper is concerned with global optimization techniques and their parallel implementation. We describe an integrated software platform GOOL–PV (Global Optimization Object-oriented Library–Parallel Version) that provides the tools for solving complex optimization problems on parallel and multi-core computers or computer clusters. Finally, we present the comparative study of sequential and parallel global optimization algorithms based on numerical results for a standard set of multimodal functions.
41.
Urszula Boryczka, Leszek Kłosowicz
Initialization with Repetitions Method for Sequential Niche Techniques Proceedings Article
In: Arabas, J. (Ed.): Evolutionary Computation and Global Optimization, pp. 51-58, Warsaw University of Technology Publishing House Warsaw University of Technology Publishing House, Augustów, Poland, 2008, ISBN: 0137-2343.
Abstract | Links | BibTeX | Tagi: kaeiog
@inproceedings{KAEiOG2008.5,
title = {Initialization with Repetitions Method for Sequential Niche Techniques},
author = {Urszula Boryczka and Leszek Kłosowicz},
editor = {J. Arabas},
url = {https://troja.uksw.edu.pl/pdf/kaeiog/KAEiOG2008.5.pdf},
isbn = {0137-2343},
year = {2008},
date = {2008-01-01},
booktitle = {Evolutionary Computation and Global Optimization},
number = {165},
pages = {51-58},
publisher = {Warsaw University of Technology Publishing House},
address = {Augustów, Poland},
organization = {Warsaw University of Technology Publishing House},
series = {Prace Naukowe, Elektronika},
abstract = {This paper presents a new method of initialization population for sequential niching techniques, in which, evolutionary algorithm (EA) for determining a single local extreme has been employed. Knowledge of the localization of optima, determined in earlier runs of EA has been exploited in this approach. Initialization of a single individual consists in repeating its location until it is placed in the search subspace does not connected with any niche determined earlier. This approach contributes to the enhancement of convergence and to the improvement of achieved results.},
keywords = {kaeiog},
pubstate = {published},
tppubtype = {inproceedings}
}
This paper presents a new method of initialization population for sequential niching techniques, in which, evolutionary algorithm (EA) for determining a single local extreme has been employed. Knowledge of the localization of optima, determined in earlier runs of EA has been exploited in this approach. Initialization of a single individual consists in repeating its location until it is placed in the search subspace does not connected with any niche determined earlier. This approach contributes to the enhancement of convergence and to the improvement of achieved results.
42.
Anna Witkowska, Roman Śmierzchalski
Identifying Ship Parameters with the Aid of Genetic Algorithm Proceedings Article
In: Arabas, J. (Ed.): Evolutionary Computation and Global Optimization, pp. 245-252, Warsaw University of Technology Publishing House Warsaw University of Technology Publishing House, Augustów, Poland, 2008, ISBN: 0137-2343.
Abstract | Links | BibTeX | Tagi: kaeiog
@inproceedings{KAEiOG2008.27,
title = {Identifying Ship Parameters with the Aid of Genetic Algorithm},
author = {Anna Witkowska and Roman Śmierzchalski},
editor = {J. Arabas},
url = {https://troja.uksw.edu.pl/pdf/kaeiog/KAEiOG2008.27.pdf},
isbn = {0137-2343},
year = {2008},
date = {2008-01-01},
booktitle = {Evolutionary Computation and Global Optimization},
number = {165},
pages = {245-252},
publisher = {Warsaw University of Technology Publishing House},
address = {Augustów, Poland},
organization = {Warsaw University of Technology Publishing House},
series = {Prace Naukowe, Elektronika},
abstract = {The article discusses the problem of identifying dynamic parameters of the Bech-Wagner model in such a way that the output characteristics of the model are close to those of a model ship bearing the shipyard symbol B-481. The identification has been carried out in the off-line mode using a genetic algorithm. The included results of simulation calculations, done using Matlab/Simulink, testify to correct operation, in terms of accuracy and rate, of the genetic algorithm.},
keywords = {kaeiog},
pubstate = {published},
tppubtype = {inproceedings}
}
The article discusses the problem of identifying dynamic parameters of the Bech-Wagner model in such a way that the output characteristics of the model are close to those of a model ship bearing the shipyard symbol B-481. The identification has been carried out in the off-line mode using a genetic algorithm. The included results of simulation calculations, done using Matlab/Simulink, testify to correct operation, in terms of accuracy and rate, of the genetic algorithm.
43.
Krzysztof Adamski
Hybrid Optimization Algorithm using Evolutionary Algorithm and Local Search Method with its Application in Digital FIR Filter Design Proceedings Article
In: Arabas, J. (Ed.): Evolutionary Computation and Global Optimization, pp. 23-32, Warsaw University of Technology Publishing House Warsaw University of Technology Publishing House, Augustów, Poland, 2008, ISBN: 0137-2343.
Abstract | Links | BibTeX | Tagi: kaeiog
@inproceedings{KAEiOG2008.2,
title = {Hybrid Optimization Algorithm using Evolutionary Algorithm and Local Search Method with its Application in Digital FIR Filter Design},
author = {Krzysztof Adamski},
editor = {J. Arabas},
url = {https://troja.uksw.edu.pl/pdf/kaeiog/KAEiOG2008.2.pdf},
isbn = {0137-2343},
year = {2008},
date = {2008-01-01},
booktitle = {Evolutionary Computation and Global Optimization},
number = {165},
pages = {23-32},
publisher = {Warsaw University of Technology Publishing House},
address = {Augustów, Poland},
organization = {Warsaw University of Technology Publishing House},
series = {Prace Naukowe, Elektronika},
abstract = {This paper is devoted to the application of an Evolutionary Algorithm to the design of Finite Impulse Response Filters (FIR). A hybrid algorithm is proposed, which consists of a robust global optimization method (Evolutionary Algorithm - EA) and a good local optimization method (Quasi-Newton - QN). An experimental comparison of the hybrid algorithm against EA and QN alone indicates that EA yields filters with the better amplitude characteristics than QN. Furthermore the hybrid method yields filters with even better amplitude characteristics and in some times, it needs significantly less time than EA alone to reach good solutions.},
keywords = {kaeiog},
pubstate = {published},
tppubtype = {inproceedings}
}
This paper is devoted to the application of an Evolutionary Algorithm to the design of Finite Impulse Response Filters (FIR). A hybrid algorithm is proposed, which consists of a robust global optimization method (Evolutionary Algorithm - EA) and a good local optimization method (Quasi-Newton - QN). An experimental comparison of the hybrid algorithm against EA and QN alone indicates that EA yields filters with the better amplitude characteristics than QN. Furthermore the hybrid method yields filters with even better amplitude characteristics and in some times, it needs significantly less time than EA alone to reach good solutions.
44.
Jarosław Arabas, Sławomir Szostak
Hybrid Evolutionary Algorithm in MOSFET Parameter Extraction Proceedings Article
In: Arabas, J. (Ed.): Evolutionary Computation and Global Optimization, pp. 33-42, Warsaw University of Technology Publishing House Warsaw University of Technology Publishing House, Augustów, Poland, 2008, ISBN: 0137-2343.
Abstract | Links | BibTeX | Tagi: kaeiog
@inproceedings{KAEiOG2008.3,
title = {Hybrid Evolutionary Algorithm in MOSFET Parameter Extraction},
author = {Jarosław Arabas and Sławomir Szostak},
editor = {J. Arabas},
url = {https://troja.uksw.edu.pl/pdf/kaeiog/KAEiOG2008.3.pdf},
isbn = {0137-2343},
year = {2008},
date = {2008-01-01},
booktitle = {Evolutionary Computation and Global Optimization},
number = {165},
pages = {33-42},
publisher = {Warsaw University of Technology Publishing House},
address = {Augustów, Poland},
organization = {Warsaw University of Technology Publishing House},
series = {Prace Naukowe, Elektronika},
abstract = {In this paper we report an ongoing research on applying evolutionary computation to the identification of technological parameters of MOS transistors (MOSFETs) using the current-voltage measurements. The identification consists in approximating the observed values of the current with the values generated by the transistor model. Values of parameters for which the smallest approximation error is observed are assumed to be the best estimations to the real values. The model is nonlinear and nondifferentiable, and the error function takes multiple local minima with respect to the parameter values. We apply a combination of an evolutionary algorithm together with the Nelder-Mead method to minimize the error function and we experimentally investigate the effectiveness of the proposed approach.},
keywords = {kaeiog},
pubstate = {published},
tppubtype = {inproceedings}
}
In this paper we report an ongoing research on applying evolutionary computation to the identification of technological parameters of MOS transistors (MOSFETs) using the current-voltage measurements. The identification consists in approximating the observed values of the current with the values generated by the transistor model. Values of parameters for which the smallest approximation error is observed are assumed to be the best estimations to the real values. The model is nonlinear and nondifferentiable, and the error function takes multiple local minima with respect to the parameter values. We apply a combination of an evolutionary algorithm together with the Nelder-Mead method to minimize the error function and we experimentally investigate the effectiveness of the proposed approach.
45.
Piotr Orantek, Tadeusz Burczyński
The Granular Computing in Uncertain Optimization Problems Proceedings Article
In: Arabas, J. (Ed.): Evolutionary Computation and Global Optimization, pp. 173-180, Warsaw University of Technology Publishing House Warsaw University of Technology Publishing House, Augustów, Poland, 2008, ISBN: 0137-2343.
Abstract | Links | BibTeX | Tagi: kaeiog
@inproceedings{KAEiOG2008.19,
title = {The Granular Computing in Uncertain Optimization Problems},
author = {Piotr Orantek and Tadeusz Burczyński},
editor = {J. Arabas},
url = {https://troja.uksw.edu.pl/pdf/kaeiog/KAEiOG2008.19.pdf},
isbn = {0137-2343},
year = {2008},
date = {2008-01-01},
booktitle = {Evolutionary Computation and Global Optimization},
number = {165},
pages = {173-180},
publisher = {Warsaw University of Technology Publishing House},
address = {Augustów, Poland},
organization = {Warsaw University of Technology Publishing House},
series = {Prace Naukowe, Elektronika},
abstract = {The paper is devoted to applications of evolutionary algorithms in identification of structures being under the uncertain conditions. Uncertainties can occur in boundary conditions, in material or geometrical parameters of structures and are modeled by three kinds of granularity: interval mathematics, fuzzy sets and theory of probability. In order to formulate the optimization problem for such a class of problems by means of evolutionary algorithms the chromosomes are considered as interval, fuzzy and random vectors whose genes are represented by: (i) interval numbers, (ii) fuzzy numbers and (iii) random variables, respectively. Description of evolutionary algorithms with granular representation of data is presented in this paper. Various concepts of evolutionary operator such as a crossover and a mutation and methods of selections are described. In order to evaluate the fitness functions the interval, fuzzy and stochastic finite element methods are applied. Several numerical tests and examples of identification of uncertain parameters are presented.},
keywords = {kaeiog},
pubstate = {published},
tppubtype = {inproceedings}
}
The paper is devoted to applications of evolutionary algorithms in identification of structures being under the uncertain conditions. Uncertainties can occur in boundary conditions, in material or geometrical parameters of structures and are modeled by three kinds of granularity: interval mathematics, fuzzy sets and theory of probability. In order to formulate the optimization problem for such a class of problems by means of evolutionary algorithms the chromosomes are considered as interval, fuzzy and random vectors whose genes are represented by: (i) interval numbers, (ii) fuzzy numbers and (iii) random variables, respectively. Description of evolutionary algorithms with granular representation of data is presented in this paper. Various concepts of evolutionary operator such as a crossover and a mutation and methods of selections are described. In order to evaluate the fitness functions the interval, fuzzy and stochastic finite element methods are applied. Several numerical tests and examples of identification of uncertain parameters are presented.
46.
Joanna Kołodziej
Grammar-based Model of Hierarchical Genetic Strategy - Preliminary Study Proceedings Article
In: Arabas, J. (Ed.): Evolutionary Computation and Global Optimization, pp. 95-102, Warsaw University of Technology Publishing House Warsaw University of Technology Publishing House, Augustów, Poland, 2008, ISBN: 0137-2343.
Abstract | Links | BibTeX | Tagi: kaeiog
@inproceedings{KAEiOG2008.10,
title = {Grammar-based Model of Hierarchical Genetic Strategy - Preliminary Study},
author = {Joanna Kołodziej},
editor = {J. Arabas},
url = {https://troja.uksw.edu.pl/pdf/kaeiog/KAEiOG2008.10.pdf},
isbn = {0137-2343},
year = {2008},
date = {2008-01-01},
booktitle = {Evolutionary Computation and Global Optimization},
number = {165},
pages = {95-102},
publisher = {Warsaw University of Technology Publishing House},
address = {Augustów, Poland},
organization = {Warsaw University of Technology Publishing House},
series = {Prace Naukowe, Elektronika},
abstract = {The scope of this paper is the construction of Hierarchical Genetic Strategy theoretical model based on the L-systems framework. The model was defined in the case of inactive prefix comparison procedure of HGS. We applied Vosetextquoterights theory in a short formal analysis of basic search mechanisms implemented in the strategy.},
keywords = {kaeiog},
pubstate = {published},
tppubtype = {inproceedings}
}
The scope of this paper is the construction of Hierarchical Genetic Strategy theoretical model based on the L-systems framework. The model was defined in the case of inactive prefix comparison procedure of HGS. We applied Vosetextquoterights theory in a short formal analysis of basic search mechanisms implemented in the strategy.
47.
Marek W. Gutowski
Exploring the Search Space With Intervals Proceedings Article
In: Arabas, J. (Ed.): Evolutionary Computation and Global Optimization, pp. 77-84, Warsaw University of Technology Publishing House Warsaw University of Technology Publishing House, Augustów, Poland, 2008, ISBN: 0137-2343.
Abstract | Links | BibTeX | Tagi: kaeiog
@inproceedings{KAEiOG2008.8,
title = {Exploring the Search Space With Intervals},
author = {Marek W. Gutowski},
editor = {J. Arabas},
url = {https://troja.uksw.edu.pl/pdf/kaeiog/KAEiOG2008.8.pdf},
isbn = {0137-2343},
year = {2008},
date = {2008-01-01},
booktitle = {Evolutionary Computation and Global Optimization},
number = {165},
pages = {77-84},
publisher = {Warsaw University of Technology Publishing House},
address = {Augustów, Poland},
organization = {Warsaw University of Technology Publishing House},
series = {Prace Naukowe, Elektronika},
abstract = {The term global optimization is used in several contexts. Most often we are interested in finding such a point (or points) in many-dimensional search space at which the objective functiontextquoterights value is optimal, i.e. maximal or minimal. Sometimes, however, we are also interested in stability of the solution, that is in its robustness against small perturbations. Here I present the original, interval-analysis-based family of methods designed for exhaustive exploration of the search space. The power of interval methods makes it possible to reach all mentioned goals within a single, unified framework.},
keywords = {kaeiog},
pubstate = {published},
tppubtype = {inproceedings}
}
The term global optimization is used in several contexts. Most often we are interested in finding such a point (or points) in many-dimensional search space at which the objective functiontextquoterights value is optimal, i.e. maximal or minimal. Sometimes, however, we are also interested in stability of the solution, that is in its robustness against small perturbations. Here I present the original, interval-analysis-based family of methods designed for exhaustive exploration of the search space. The power of interval methods makes it possible to reach all mentioned goals within a single, unified framework.
48.
Witold Beluch, Tadeusz Burczyński, Adam Długosz
Evolutionary Multi-Objective Optimization of Laminates Proceedings Article
In: Arabas, J. (Ed.): Evolutionary Computation and Global Optimization, pp. 43-50, Warsaw University of Technology Publishing House Warsaw University of Technology Publishing House, Augustów, Poland, 2008, ISBN: 0137-2343.
Abstract | Links | BibTeX | Tagi: kaeiog
@inproceedings{KAEiOG2008.4,
title = {Evolutionary Multi-Objective Optimization of Laminates},
author = {Witold Beluch and Tadeusz Burczyński and Adam Długosz},
editor = {J. Arabas},
url = {https://troja.uksw.edu.pl/pdf/kaeiog/KAEiOG2008.4.pdf},
isbn = {0137-2343},
year = {2008},
date = {2008-01-01},
booktitle = {Evolutionary Computation and Global Optimization},
number = {165},
pages = {43-50},
publisher = {Warsaw University of Technology Publishing House},
address = {Augustów, Poland},
organization = {Warsaw University of Technology Publishing House},
series = {Prace Naukowe, Elektronika},
abstract = {The paper deals with the application of the global optimization methods to the multi-objective optimization of laminates. A multi-layered, fibre-reinforced and hybrid laminates are considered. Different optimization criteria connected with the laminatestextquoteright cost, modal properties and stiffness are taken into account. As the optimization criteria usually cannot be satisfied simultaneously, the multi-objective optimization methods are employed. The multi-objective evolutionary algorithm with the Pareto approach is used as the global optimization method. The Finite Element Method is used to solve a boundary-value problem for the laminates. The stacking sequence and the number or plies made of different materials are design variables. The discrete as well as continuous fibre orientation angles in particular plies are considered. Numerical example presenting non-dominated solutions for two contradictory optimization criteria is attached.},
keywords = {kaeiog},
pubstate = {published},
tppubtype = {inproceedings}
}
The paper deals with the application of the global optimization methods to the multi-objective optimization of laminates. A multi-layered, fibre-reinforced and hybrid laminates are considered. Different optimization criteria connected with the laminatestextquoteright cost, modal properties and stiffness are taken into account. As the optimization criteria usually cannot be satisfied simultaneously, the multi-objective optimization methods are employed. The multi-objective evolutionary algorithm with the Pareto approach is used as the global optimization method. The Finite Element Method is used to solve a boundary-value problem for the laminates. The stacking sequence and the number or plies made of different materials are design variables. The discrete as well as continuous fibre orientation angles in particular plies are considered. Numerical example presenting non-dominated solutions for two contradictory optimization criteria is attached.
49.
Barbara Mażbic-Kulma, Henryk Potrzebowski, Jarosław Stańczak, Krzysztof Sęp
Evolutionary Approach to Solve Hub-and-Spoke Problem Using a-cliques Proceedings Article
In: Arabas, J. (Ed.): Evolutionary Computation and Global Optimization, pp. 121-130, Warsaw University of Technology Publishing House Warsaw University of Technology Publishing House, Augustów, Poland, 2008, ISBN: 0137-2343.
Abstract | Links | BibTeX | Tagi: kaeiog
@inproceedings{KAEiOG2008.13,
title = {Evolutionary Approach to Solve Hub-and-Spoke Problem Using a-cliques},
author = {Barbara Mażbic-Kulma and Henryk Potrzebowski and Jarosław Stańczak and Krzysztof Sęp},
editor = {J. Arabas},
url = {https://troja.uksw.edu.pl/pdf/kaeiog/KAEiOG2008.13.pdf},
isbn = {0137-2343},
year = {2008},
date = {2008-01-01},
booktitle = {Evolutionary Computation and Global Optimization},
number = {165},
pages = {121-130},
publisher = {Warsaw University of Technology Publishing House},
address = {Augustów, Poland},
organization = {Warsaw University of Technology Publishing House},
series = {Prace Naukowe, Elektronika},
abstract = {The theory of transportation systems deals with models of phenomena connected with movement of goods and persons. The model of the transportation system should simulate a real system, but should also be a tool that enables to solve given transportation tasks. In order to describe transportation system (rail, bus or air), as a routine a connection graph would be used. Vertices of the graph can be train stations, bus stops or in case of air transport – airports. The edges of the graph show direct connections between vertices. It can be noticed that such a graph can have many vertices as well as many edges. Its direct application can be difficult and computational problems can occur while one would try to organize or optimize such a transportation system. Therefore, a method of aggregation of such a graph was introduced, using the hub-and-spoke structured graph of connections. This structure enables to concentrate and order the transport of goods/persons among vertices. To obtain the hub-and-soke structure an evolutionary algorithm (EA) was applied. EA divides the connection graph into alpha-cliques (a generalization of the notion of a clique, which groups into sub-graphs highly connected vertices) and then in each alpha-clique a vertex with a maximum degree in this sub-graph and a maximal number of connections among other selected hubs is chosen. The alpha-clique with chosen vertex constitutes a "hub" with point-to-point connections - "spokes". This method enables reducing the number of analyzed vertices as well as arcs of the graph. Examples visualizing functioning of the described algorithms are presented later in this paper.},
keywords = {kaeiog},
pubstate = {published},
tppubtype = {inproceedings}
}
The theory of transportation systems deals with models of phenomena connected with movement of goods and persons. The model of the transportation system should simulate a real system, but should also be a tool that enables to solve given transportation tasks. In order to describe transportation system (rail, bus or air), as a routine a connection graph would be used. Vertices of the graph can be train stations, bus stops or in case of air transport – airports. The edges of the graph show direct connections between vertices. It can be noticed that such a graph can have many vertices as well as many edges. Its direct application can be difficult and computational problems can occur while one would try to organize or optimize such a transportation system. Therefore, a method of aggregation of such a graph was introduced, using the hub-and-spoke structured graph of connections. This structure enables to concentrate and order the transport of goods/persons among vertices. To obtain the hub-and-soke structure an evolutionary algorithm (EA) was applied. EA divides the connection graph into alpha-cliques (a generalization of the notion of a clique, which groups into sub-graphs highly connected vertices) and then in each alpha-clique a vertex with a maximum degree in this sub-graph and a maximal number of connections among other selected hubs is chosen. The alpha-clique with chosen vertex constitutes a "hub" with point-to-point connections - "spokes". This method enables reducing the number of analyzed vertices as well as arcs of the graph. Examples visualizing functioning of the described algorithms are presented later in this paper.
50.
Piotr Orantek, Witold Beluch, Tadeusz Burczyński
Evolutionary Algorithm in Identification of Stochastic Parameters of Laminates Proceedings Article
In: Arabas, J. (Ed.): Evolutionary Computation and Global Optimization, pp. 165-172, Warsaw University of Technology Publishing House Warsaw University of Technology Publishing House, Augustów, Poland, 2008, ISBN: 0137-2343.
Abstract | Links | BibTeX | Tagi: kaeiog
@inproceedings{KAEiOG2008.18,
title = {Evolutionary Algorithm in Identification of Stochastic Parameters of Laminates},
author = {Piotr Orantek and Witold Beluch and Tadeusz Burczyński},
editor = {J. Arabas},
url = {https://troja.uksw.edu.pl/pdf/kaeiog/KAEiOG2008.18.pdf},
isbn = {0137-2343},
year = {2008},
date = {2008-01-01},
booktitle = {Evolutionary Computation and Global Optimization},
number = {165},
pages = {165-172},
publisher = {Warsaw University of Technology Publishing House},
address = {Augustów, Poland},
organization = {Warsaw University of Technology Publishing House},
series = {Prace Naukowe, Elektronika},
abstract = {The paper deals with the identification of material constants in multi-layered composites. Simple and hybrid (with laminas made of different materials) laminates are considered. Material constants are presented in a stochastic form to model their uncertainty. The Evolutionary Algorithm based on such representation of the data is used as the global optimization method. Chromosomes are represented by multidimensional random vectors consisting of random genes in the form of independent random variables with the Gaussian density probability functions. The stochastic optimization problem is replaced by a deterministic one by evolutionary computing of chromosomes having genes consisting of mean values and standard deviations. Modal analysis methods are employed to collect measurement data necessary for the identification. The Finite Element Method in stochastic version is used to solve the boundary-value problem for laminates. Numerical examples showing efficiency of the method are presented.},
keywords = {kaeiog},
pubstate = {published},
tppubtype = {inproceedings}
}
The paper deals with the identification of material constants in multi-layered composites. Simple and hybrid (with laminas made of different materials) laminates are considered. Material constants are presented in a stochastic form to model their uncertainty. The Evolutionary Algorithm based on such representation of the data is used as the global optimization method. Chromosomes are represented by multidimensional random vectors consisting of random genes in the form of independent random variables with the Gaussian density probability functions. The stochastic optimization problem is replaced by a deterministic one by evolutionary computing of chromosomes having genes consisting of mean values and standard deviations. Modal analysis methods are employed to collect measurement data necessary for the identification. The Finite Element Method in stochastic version is used to solve the boundary-value problem for laminates. Numerical examples showing efficiency of the method are presented.