Search results

Filters

  • Journals
  • Authors
  • Keywords
  • Date
  • Type

Search results

Number of results: 251
items per page: 25 50 75
Sort by:
Download PDF Download RIS Download Bibtex

Abstract

The present study has been taken up to emphasize the role of the hybridization process for optimizing a given reinforced concrete (RC) frame. Although various primary techniques have been hybrid in the past with varying degree of success, the effect of hybridization of enhanced versions of standard optimization techniques has found little attention. The focus of the current study is to see if it is possible to maintain and carry the positive effects of enhanced versions of two different techniques while using their hybrid algorithms. For this purpose, enhanced versions of standard particle swarm optimization (PSO) and a standard gravitational search algorithm (GSA), were considered for optimizing an RC frame. The enhanced version of PSO involves its democratization by considering all good and bad experiences of the particles, whereas the enhanced version of the GSA is made self-adaptive by considering a specific range for certain parameters, like the gravitational constant and a set of agents with the best fitness values. The optimization process, being iterative in nature, has been coded in C++. The analysis and design procedure is based on the specifications of Indian codes. Two distinct advantages of enhanced versions of standard PSO and GSA, namely, better capability to escape from local optima and a faster convergence rate, have been tested for the hybrid algorithm. The entire formulation for optimal cost design of a frame includes the cost of beams and columns. The variables of each element of structural frame have been considered as continuous and rounded off appropriately to consider practical limitations. An example has also been considered to emphasize the validity of this optimum design procedure.

Go to article

Authors and Affiliations

Sonia Chutani
Jagbir Singh
Download PDF Download RIS Download Bibtex

Abstract

This paper presents an approach based on NURBS (non-uniform rational B-splines) to achieve a seismic response surface (SRS) from a group of points obtained by using an analytical model of RC joints. NURBS based on the genetic algorithm is an important mathematical tool and consists of generalizations of Bezier curves and surfaces and B-splines. Generally, the accuracy of the design process of joints depends on the number of control points that are captured in the results of experimental research on real specimens. The values obtained from the specimens are the best tools to use in seismic analysis, though more expensive when compared to values simulated by SRSs. The SRS proposed in this paper can be applied to obtain surfaces that show site effect results on destructions of beam-column joint, taking into account different site conditions for a specific earthquake. The efficiency of this approach is demonstrated by the retrieval of simulated-versus-analytical results.

Go to article

Authors and Affiliations

R. Tabatabaei Mirhosseini
Download PDF Download RIS Download Bibtex

Abstract

In the article we study a model of network transmissions with Active Queue Management in an intermediate IP router. We use the OMNET++ discrete event simulator to model the varies variants of the CHOKe algoithms. We model a system where CHOKe, xCHOKe and gCHOKe are the AQM policy. The obtained results shows the behaviour of these algorithms. The paper presents also the implementation of AQM mechanisms in the router based on Linux.
Go to article

Authors and Affiliations

Jerzy Klamka
Adam Domański
Joanna Domańska
Download PDF Download RIS Download Bibtex

Abstract

Cooling of the hot gas path components plays a key role in modern gas turbines. It allows, due to efficiency reasons, to operate the machines with temperature exceeding components' melting point. The cooling system however brings about some disadvantages as well. If so, we need to enforce the positive effects of cooling and diminish the drawbacks, which influence the reliability of components and the whole machine. To solve such a task we have to perform an optimization which makes it possible to reach the desired goal. The task is approached in the 3D configuration. The search process is performed by means of the evolutionary approach with floatingpoint representation of design variables. Each cooling structure candidate is evaluated on the basis of thermo-mechanical FEM computations done with Ansys via automatically generated script file. These computations are parallelized. The results are compared with the reference case which is the C3X airfoil and they show a potential stored in the cooling system. Appropriate passage distribution makes it possible to improve the operation condition for highly loaded components. Application of evolutionary approach, although most suitable for such problems, is time consuming, so more advanced approach (Conjugate Heat Transfer) requires huge computational power. The analysis is based on original procedure which involves optimization of size and location of internal cooling passages of cylindrical shape within the airfoil. All the channels can freely move within the airfoil cross section and also their number can change. Such a procedure is original.

Go to article

Authors and Affiliations

Grzegorz Nowak
Download PDF Download RIS Download Bibtex

Abstract

A substantial quantity of research on muffler design has been restricted to a low frequency range using the plane wave theory. Based on this theory, which is a one-dimensional wave, no higher order wave has been considered. This has resulted in underestimating acoustical performances at higher frequencies when doing muffler analysis via the plane wave model. To overcome the above drawbacks, researchers have assessed a three-dimensional wave propagating for a simple expansion chamber muffler. Therefore, the acoustic effect of a higher order wave (a high frequency wave) is considered here. Unfortunately, there has been scant research on expansion chamber mufflers equipped with baffle plates that enhance noise elimination using a higher-order-mode analysis. Also, space-constrained conditions of industrial muffler designs have never been properly addressed. So, in order to improve the acoustical performance of an expansion chamber muffler within a constrained space, the optimization of an expansion chamber muffler hybridized with multiple baffle plates will be assessed. In this paper, the acoustical model of the expansion chamber muffler will be established by assuming that it is a rigid rectangular tube driven by a piston along the tube wall. Using an eigenfunction (higher-order-mode analysis), a four-pole system matrix for evaluating acoustic performance (STL) is derived. To improve the acoustic performance of the expansion chamber muffler, three kinds of expansion chamber mufflers (KA-KC) with different acoustic mechanisms are introduced and optimized for a targeted tone using a genetic algorithm (GA). Before the optimization process is performed, the higher-order-mode mathematical models of three expansion chamber mufflers (A-C) with various allocations of inlets/outlets and various chambers are also confirmed for accuracy. Results reveal that the STL of the expansion chamber mufflers at the targeted tone has been largely improved and the acoustic performance of a reverse expansion chamber muffler is more efficient than that of a straight expansion chamber muffler. Moreover, the STL of the expansion chamber mufflers will increase as the number of the chambers that separate with baffles increases.
Go to article

Authors and Affiliations

Min-Chie Chiu
Ying-Chun Chang
Download PDF Download RIS Download Bibtex

Abstract

Static Var Compensator (SVC) is a popular FACTS device for providing reactive power support in power systems and its placement representing the location and size has significant influence on network loss, while keeping the voltage magnitudes within the acceptable range. This paper presents a Firefly algorithm based optimization strategy for placement of SVC in power systems with a view of minimizing the transmission loss besides keeping the voltage magnitude within the acceptable range. The method uses a self-adaptive scheme for tuning the parameters in the Firefly algorithm. The strategy is tested on three IEEE test systems and their results are presented to demonstrate its effectiveness.

Go to article

Authors and Affiliations

R. Selvarasu
M. Surya Kalavathi
C. Christober Asir Rajan
Download PDF Download RIS Download Bibtex

Abstract

The cyclic modular approach is proposed for mechatronic object design. The approach is based on a new conceptual model of the object and a new algorithm of its design. The model consists of invariant and changeable parts. The parts have a hierarchical structure. The proposed algorithm allows for creating the object from the basis principle to the construction step by step. It makes it possible to design an adequate object in all forms of its representations: structure, schematic diagram, mathematical model and construction. Each of these forms has an invariant part, i.e. the structure of the functioning process of the object. Application of the proposed approach reduces the time needed for the object design.

Go to article

Authors and Affiliations

Oleksandr Uzunov
Download PDF Download RIS Download Bibtex

Abstract

Scheduling of multiobjective problems has gained the interest of the researchers. Past many

decades, various classical techniques have been developed to address the multiobjective problems,

but evolutionary optimizations such as genetic algorithm, particle swarm, tabu search

method and many more are being successfully used. Researchers have reported that hybrid

of these algorithms has increased the efficiency and effectiveness of the solution. Genetic

algorithms in conjunction with Pareto optimization are used to find the best solution for

bi-criteria objectives. Numbers of applications involve many objective functions, and application

of the Pareto front method may have a large number of potential solutions. Selecting

a feasible solution from such a large set is difficult to arrive the right solution for the decision

maker. In this paper Pareto front ranking method is proposed to select the best parents for

producing offspring’s necessary to generate the new populations sets in genetic algorithms.

The bi-criteria objectives minimizing the machine idleness and penalty cost for scheduling

process is solved using genetic algorithm based Pareto front ranking method. The algorithm

is coded in Matlab, and simulations were carried out for the crossover probability of 0.6,

0.7, 0.8, and 0.9. The results obtained from the simulations are encouraging and consistent

for a crossover probability of 0.6.

Go to article

Authors and Affiliations

B.V. Raghavendra
Download PDF Download RIS Download Bibtex

Abstract

One of the least expensive and safest diagnostic modalities routinely used is ultrasound imaging. An attractive development in this field is a two-dimensional (2D) matrix probe with three-dimensional (3D) imaging. The main problems to implement this probe come from a large number of elements they need to use. When the number of elements is reduced the side lobes arising from the transducer change along with the grating lobes that are linked to the periodic disposition of the elements. The grating lobes are reduced by placing the elements without any consideration of the grid. In this study, the Binary Bat Algorithm (BBA) is used to optimize the number of active elements in order to lower the side lobe level. The results are compared to other optimization methods to validate the proposed algorithm.

Go to article

Authors and Affiliations

Dina Mohamed Tantawy
Mohamed Eladawy
Mohamed Alimaher Hassan
Roaa Mubarak
Download PDF Download RIS Download Bibtex

Abstract

The contribution main from this research is modularity and better processing time in detecting community by using K-1 coloring. Testing performed on transaction datasets remittance on P2P platforms where the Louvain Coloring algorithm is better in comparison to Louvain Algorithm Data used is data transfer transactions made by customers on the P2P Online platform. The data is the User data that has information transfer transactions, Card data that has information card, IP data that has IP information, and Device data that has information device. Every user owns unique 128-bit identification, and other nodes representing card, device, and IP are assigned a random UUID. The Device node has the guide, and device properties. IP nodes only have property guide and node User has property fraud Money Transfer, guide, money Transfer Error Cancel Amount, first Charge back Date. Each node has a unique 128-bit guide, with the amount whole of as many as 789,856 nodes. Application technique K-1 staining on Louvain algorithm shows enhancement value modularity and better processing time for detecting community on the network large scale. Through a series of exercises and tests carried out in various scenarios, it shows that the experiments carried out in this paper, namely the Louvain Coloring algorithm, are more effective and efficient than the Louvain algorithm in scenario 1,3, and 5 meanwhile For Scenarios 2 and 4 Louvain Algorithm is better.
Go to article

Authors and Affiliations

Heru Mardiansyah
1
Saib Suwilo
2
Erna Budiarti Nababan
3
Syahril Efendi
1

  1. Department Computer Science, Faculty of Computer Science and Information Technology, Universitas Sumatera Utara, Medan, Indonesia
  2. Department Mathematics, Faculty of Mathematics and Natural Sciences, Universitas Sumatera Utara, Medan, Indonesia
  3. Department Data Science and Artificial Intelligence, Faculty of Computer Science and Information Technology, Universitas Sumatera Utara, Medan, Indonesia
Download PDF Download RIS Download Bibtex

Abstract

A spectrum defragmentation problem in elastic optical networks was considered under the assumption that all connections can be realized in switching nodes. But this assumption is true only when the switching fabric has appropriate combinatorial properties. In this paper, we consider a defragmentation problem in one architecture of wavelength-spacewavelength switching fabrics. First, we discuss the requirements for this switching fabric, below which defragmentation does not always end with success. Then, we propose defragmentation algorithms and evaluate them by simulation. The results show that proposed algorithms can increase the number of connections realized in the switching fabric and reduce the loss probability.

Go to article

Authors and Affiliations

Remigiusz Rajewski
Wojciech Kabaciński
Atyaf Al-Tameemi
Download PDF Download RIS Download Bibtex

Abstract

Economic Load Dispatch (ELD) is utilized in finding the optimal combination of the real power generation that minimizes total generation cost, yet satisfying all equality and inequality constraints. It plays a significant role in planning and operating power systems with several generating stations. For simplicity, the cost function of each generating unit has been approximated by a single quadratic function. ELD is a subproblem of unit commitment and a nonlinear optimization problem. Many soft computing optimization methods have been developed in the recent past to solve ELD problems. In this paper, the most recently developed population-based optimization called the Salp Swarm Algorithm (SSA) has been utilized to solve the ELD problem. The results for the ELD problem have been verified by applying it to a standard 6-generator system with and without due consideration of transmission losses. The finally obtained results using the SSA are compared to that with the Particle Swarm Optimization (PSO) algorithm. It has been observed that the obtained results using the SSA are quite encouraging.
Go to article

Bibliography

[1] Rogers G., Power systems oscillations, Springer Science & Business Media (2012).
[2] Grainger J.J., StevensonW.D., Chang G.W., Power Systems Analysis, Mc Graw Hill Education (2003).
[3] Soft S., Power system economics: designing markets for electricity, Wiley-Interscience, Piscataway, NJ: New York (2002).
[4] Sheta A., Faris H., Braik M., Mirjalil S., Nature-Inspired Metaheuristics Search Algorithms for Solving the Economic Load Dispatch Problem of Power System: A Comparison Study, Applied Nature-Inspired Computing: Algorithms and Case Studies, Springer, pp. 199–230 (2020).
[5] Singht H.P., Singht Brar Y., Koyhari D.P., Reactive power based fair calculation approach for multiobjective load dispatch problem, Archives of Electrical Engineering, vol. 68, no. 4, pp. 719–735 (2019).
[6] Mistri A., Kumar Roy P., Mandal B., Chaotic biogeography-based optimization (CBBO) algorithm applied to economic load dispatch problem, Proceedings of National Conference on Emerging Trends on Sustainable Technology and Engineering Applications (NCETSTEA), Durgapur, India, pp. 1–5 (2020).
[7] Zhang Q., Zou D., Duan N., Shen X., An adaptive differential evolutionary algorithm incorporating multiple mutation strategies for the economic load dispatch problem, Applied Soft Computing, vol. 78, pp. 641–669 (2019).
[8] Singh D., Dhillon J.S., Ameliorated greywolf optimization for economic load dispatch problem, Energy, vol. 169, pp. 398–419 (2019).
[9] Raja M.A.Z., Ahmed U., Zameer A., Kiani A.K., Chaudhary N.I., Bio-inspired heuristics hybrid with sequential quadratic programming and interior-point methods for reliable treatment of economic load dispatch problem, Neutral Computing and Applications, vol. 31, no. S1, pp. 447–475 (2019).
[10] Hr S., Kaboli A., Alqallaf A.K., Solving non-convex economic load dispatch problem via artificial cooperative search algorithm, Expert Systems with Applications, vol. 128, pp. 14–27 (2019).
[11] Al-Betar M.A., Awadallah M.A., Krishan M.M., A non-convex economic load dispatch problem with valve loading effect using a hybrid grey wolf optimizer, Neutral Computing and Applications, vol. 32, pp. 12127–12154 (2020).
[12] Mirjalili S., Gandomi A.H., Mirjalili S.Z., Saremi S., Faris H., Mirjalili S.M., Salp SwarmAlgorithm: A bio-inspired optimizer for engineering design problems, Advances in Engineering Software, vol. 114, pp. 163–191 (2017).
[13] Yang B., Zhonga L., Zhang X., Shua H., Yu T., Li H., Sun L., Novel bio-inspired memetic salp swarm algorithm and application to MPPT for PV systems considering partial shading condition, Journal of Cleaner Production, vol. 215, pp. 1203–1222 (2019).
[14] Ibrahim R.A., Ewees A.A., Oliva D., Abd Elaziz M., Lu S., Improved salp swarm algorithm based on particle swarm optimization for feature selection, Journal of Ambient Intelligence and Humanized Computing, vol. 10, no. 8, pp. 3155–3169 (2019).
[15] Abbassi R., Abbassi A., Heidari A.A., Mirjalili S., An efficient salp swarm-inspired algorithm for parameters identification of photovoltaic cell models, Energy Conversion and Management, vol. 179, pp. 362–372 (2019).
[16] Sayed G.I., Khoriba G., Haggag M.H., A novel chaotic salp swarm algorithm for global optimization and feature selection, Applied Intelligence, vol. 48, no. 10, pp. 3462–3481 (2018).
[17] Faris H., Mafarjab M.M., Heidaric A.A., Aljarah I., Mirjalilid S., Fujitae H., An efficient binary Salp Swarm Algorithm with crossover scheme for feature selection problems, Knowledge-Based Systems, vol. 154, pp. 43–67 (2018).
[18] Hussien A.G., Hassanien A.E., Houssein E.H., Swarming behaviour of salps algorithm for predicting chemical compound activities, Proceedings of International Conference on Intelligent Computing and Information (2017), DOI: 10.1109/INTELCIS.2017.8260072.
[19] Zhang J.,Wang J.S., Improved Salp Swarm Algorithm Based on Levy Flight and Sine Cosine Operator, IEEE Access, vol. 8, pp. 99740–99771 (2020).
[20] Patnana N., Pattnaik S., Varshney T., Singh V., Self-Learning Salp Swarm Optimization Based PID Design of Doha RO Plant, Algorithms, vol. 13, no. 287, pp. 1–14 (2020).
[21] Hussien A.G., Hassanien A.E., Houssein E.H., Swarming behaviour of salps algorithm for predicting chemical compound activities, Proceedings of International Conference on Intelligent Computing and Information Systems (ICICIS), Cairo, pp. 315–320 (2017).
[22] Khan I.A., Alghamdi A., Touqeer Ahmed Jumani T.A., Alamgir A., Ahmed Bilal Awan A., Attaullah Khidrani A., Salp SwarmOptimization Algorithm-Based Fractional Order PID Controller for Dynamic Response and Stability Enhancement of an Automatic Voltage Regulator System, Electronics, vol. 8, no. 12, pp. 1–17 (2019).
[23] Mutluer M., Sahman A., Cunkas M., Heuristic optimization based on penalty approach for surface permanent magnet synchronous machines, Arabian Journal for Science and Engineering, vol. 45, pp. 6751–6767 (2020).
[24] Knypinski Ł., Pawełoszek K., Le Manech Y., Optimization of low-power line-start PM motor using gray wolf metaheuristic algorithm, Energies, vol. 13, no. 5 (2020).
[25] Knypinski Ł., J˛edryczka C., Demenko A., Influence of the shape of squirrel cage bars on the dimensions of permanent magnets in an optimized line-start permanent magnet synchronous motor, COMPEL, vol. 36, no. 1, pp. 298–308 (2017).
[26] Kennedy J., Eberhart R., Particle Swarm Optimization, Proceedings of the International Conference on Neutral Networks, Perth, Australia, pp. 1942–1948 (1995).
[27] Freitas D., Guerreiro Lopes L., Morgado-Dias F., Particle Swarm Optimization : A historical review up to the current developments, Entropy, vol. 22, no. 362, pp. 1–36 (2020).
Go to article

Authors and Affiliations

Ramesh Devarapalli
1
ORCID: ORCID
Nikhil Kumar Sinha
1
ORCID: ORCID
Bathina Venkateswara Rao
2
ORCID: ORCID
Łukasz Knypinski
3
ORCID: ORCID
Naraharisetti Jaya Naga Lakshmi
4
ORCID: ORCID
Fausto Pedro García Márquez
5
ORCID: ORCID

  1. Department of EE, B. I. T. Sindri, Dhanbad, Jharkhand – 828123, India
  2. Department of EEE, V R Siddhartha Engineering College (Autonomous), Vijayawada-520007, A.P., India
  3. Poznan University of Technology, Poland
  4. SR Engineering College: Warangal, Telangana, India
  5. Ingenium Research Group, University of Castilla-La Mancha, Spain
Download PDF Download RIS Download Bibtex

Abstract

For successful active control with a vibrating plate it is essential to appropriately place actuators. One of the most important criteria is to make the system controllable, so any control objectives can be achieved. In this paper the controllability-oriented placement of actuators is undertaken. First, a theoretical model of a fully clamped rectangular plate is obtained. Optimization criterion based on maximization of controllability of the system is developed. The memetic algorithm is used to find the optimal solution. Obtained results are compared with those obtained by the evolutionary algorithm. The configuration is also validated experimentally.
Go to article

Authors and Affiliations

Stanisław Wrona
Marek Pawełczyk
Download PDF Download RIS Download Bibtex

Abstract

Nowadays, the development of smart grids has been the focus of attention due to its advantages for power systems. One of the aspects of smart grids defined by using distributed generation (DG) in a low voltage network is a microgrid (MG). Based on its operational states, MG can operate in different configurations such as grid-connected mode or off-grid mode. The switching between these states is one of the challenging issues in this technical area. The fault currents in different buses have higher value compared to islanded mode of MG when the MG is connected to the main grid, which influences the protection equipment. In this situation, some electrical devices may be damaged due to the fault currents. Application of a fault current limiter (FCL) is considered as an effective way to overcome this challenge. The optimal size of these FCLs can optimize the performance of an MG. In this paper, an index for FCL size optimization has been used. In addition, two optimization algorithms (Bat Algorithm and Cuckoo Search Algorithm) have been applied to the problem. The application of an FCL has been studied in grid-connected and islanded-mode. In addition, the application of the capacitor bank in both modes has been investigated. The results of simulations carried out by MATLAB have been presented and compared.
Go to article

Authors and Affiliations

Ali Asghar Khodadoost Arani
N. Bayati
Reza Mohammadi
G.B. Gharehpetian
S.H. Sadeghi
Download PDF Download RIS Download Bibtex

Abstract

The paper presents optimization of power line geometrical parameters aimed to reduce the intensity of the electric field and magnetic field intensity under an overhead power line with the use of a genetic algorithm (AG) and particle swarm optimization (PSO). The variation of charge distribution along the conductors as well as the sag of the overhead line and induced currents in earth wires were taken into account. The conductor sag was approximated by a chain curve. The charge simulation method (CSM) and the method of images were used in the simulations of an electric field, while a magnetic field were calculated using the Biot–Savart law. Sample calculations in a three-dimensional system were made for a 220 kV single – circuit power line. A comparison of the used optimization algorithms was made.

Go to article

Authors and Affiliations

Krzysztof Król
Wojciech Machczyński
Download PDF Download RIS Download Bibtex

Abstract

The goal of this paper is to explore and to provide tools for the investigation of the problems of unit-length scheduling of incompatible jobs on uniform machines. We present two new algorithms that are a significant improvement over the known algorithms. The first one is Algorithm 2 which is 2-approximate for the problem Qm|pj  = 1, G = bisubquartic|Cmax. The second one is Algorithm 3 which is 4-approximate for the problem Qm|pj  = 1, G = bisubquarticCj, where m ∈ {2, 3, 4}. The theory behind the proposed algorithms is based on the properties of 2-coloring with maximal coloring width, and on the properties of ideal machine, an abstract machine that we introduce in this paper.

Go to article

Authors and Affiliations

T. Pikies
M. Kubale
Download PDF Download RIS Download Bibtex

Abstract

Resonance assignment remains one of the hardest stages in RNA tertiary structure determination with the use of Nuclear Magnetic Resonance spectroscopy. We propose an evolutionary algorithm being a tool for an automatization of the procedure. NOE pathway, which determines the assignments, is constructed during an analysis of possible connections between resonances within aromatic and anomeric region of 2D-NOESY spectra resulting from appropriate NMR experiments. Computational tests demonstrate the performance of the evolutionary algorithm as compared with the exact branch-and-cut procedure applied for the experimental and simulated spectral data for RNA molecules.

Go to article

Authors and Affiliations

J. Błażewicz
M. Szachniuk
A. Wojtowicz
Download PDF Download RIS Download Bibtex

Abstract

Hybridization of meta-heuristic algorithms plays a major role in the optimization problem. In this paper, a new hybrid meta-heuristic algorithm called hybrid pathfinder algorithm (HPFA) is proposed to solve the optimal reactive power dispatch (ORPD) problem. The superiority of the Differential Evolution (DE) algorithm is the fast convergence speed, a mutation operator in the DE algorithm incorporates into the pathfinder algorithm (PFA). The main objective of this research is to minimize the real power losses and subject to equality and inequality constraints. The HPFA is used to find optimal control variables such as generator voltage magnitude, transformer tap settings and capacitor banks. The proposed HPFA is implemented through several simulation cases on the IEEE 118-bus system and IEEE 300-bus power system. Results show the superiority of the proposed algorithm with good quality of optimal solutions over existing optimization techniques, and hence confirm its potential to solve the ORPD problem.
Go to article

Bibliography

  1.  M. Gwozd and L. Ciepliński, “Power supply with parallel reactive and distortion power compensation and tunable inductive filter-part 1”, Bull. Pol. Acad. Sci. Tech. Sci., vol. 68, pp. 401–408, 2020, doi: 10.24425/BPASTS.2020.133383.
  2.  M.N. Acosta, D. Topic, and M.A. Andrade, “Optimal Microgrid–Interactive Reactive Power Management for Day–Ahead Operation”, Energies, vol. 14, no. 5, p. 1275, 2021, doi: 10.3390/en14051275.
  3.  A.M. Tudose, I.I. Picioroaga, D.O. Sidea, and Co. Bulac, “Solving Single- and Multi-Objective Optimal Reactive Power Dispatch Problems Using an Improved Salp Swarm Algorithm”, Energies, vol. 14, no. 5, p. 1222, 2021, doi: 10.3390/en14051222.
  4.  E. Canelas, T. Pinto-Varela, and B. Sawik, “Electricity Portfolio Optimization for Large Consumers: Iberian Electricity Market Case Study”, Energies, vol. 13, no. 9, p. 2249, 2020, doi: 10.3390/en13092249.
  5.  V. Suresh and S.S. Kumar, “Optimal reactive power dispatch for minimization of real power loss using SBDE and DE-strategy algorithm”, J. Ambient Intell. Hum. Comput., 2020, doi: 10.1007/s12652-020-02673-w.
  6.  H. Yapici and N. Cetinkaya, “A new meta-heuristic optimizer: pathfinder algorithm”, Appl. Soft Comput., vol. 78, pp. 545–568, 2019, doi: 10.1016/j.asoc.2019.03.012.
  7.  R. Storn and K. Price, “Differential evolution – A simple and efficient adaptive scheme for global optimization over continuous spaces,” J. Global Optim., vol. 11, pp. 341– 359, 1997, doi: 10.1023/A:1008202821328.
  8.  R.P. Singha and S.P. Ghoshal, “Optimal reactive power dispatch by particle swarm optimization with an aging leader and challengers”, Appl. Soft Comput., vol. 29, pp. 298–309, 2015, doi: 10.1016/j.asoc.2015.01.006.
  9.  M. Ghasemi et. al, “A new hybrid algorithm for optimal reactive power dispatch problem with discrete and continuous control variables,” Appl. Soft Comput., vol. 22, pp. 126–140, 2014, doi: 10.1016/j.asoc.2014.05.006.
  10.  M. Ghasemi and M. Ghanbarian, “Modified teaching learning algorithm and double differential evolution algorithm for optimal reactive power dispatch problem: A comparative study”, Inf. Sci., vol. 278, pp. 231–249, 2014, doi: 10.1016/j.ins.2014.03.050.
  11.  B. Mandal and P.K. Roy, “Optimal reactive power dispatch using quasi-oppositional teaching learning based optimization”, Electr. Power Energy Syst., vol. 53, pp. 123–134, 2013, doi: 10.1016/j.ijepes.2013.04.011.
  12.  S Mouassa and A. Salhi, “Ant lion optimizer for solving optimal reactive power dispatch problem in power systems”, Eng. Sci. Technol., vol. 20, pp 885–895, 2017, doi: 10.1016/j.jestch.2017.03.006.
  13.  S. Mugemanyi et. al., “Optimal Reactive Power Dispatch Using Chaotic Bat Algorithm”, IEEE Access, vol. 8, pp. 65830–65867, 2020, doi: 10.1109/ACCESS.2020.2982988.
  14.  W.M. Villa-Acevedo and J.M. Lopez-Lezama, “A novel constraint handling approach for the optimal reactive power dispatch problem”, Energies, vol. 11, p. 2352, 2018, doi: 10.3390/en11092352.
  15.  R. Zimmerman, C.E. Murillo-Sanchez, and D. Gan, “MATPOWER 6.0, power systems engineering research center (PSERC)”, 2005, [Online]. Available: https://matpower.org/docs/MATPOWER-manual-6.0.pdf.
Go to article

Authors and Affiliations

V. Suresh
1
S. Senthil Kumar
1

  1. Department of Electrical and Electronics Engineering, Government College of Engineering, Salem-11, India
Download PDF Download RIS Download Bibtex

Abstract

This paper presents the current stage of the development of EA-MOSGWA – a tool for identifying causal genes in Genome Wide Association Studies (GWAS). The main goal of GWAS is to identify chromosomal regions which are associated with a particular disease (e.g. diabetes, cancer) or with some quantitative trait (e.g height or blood pressure). To this end hundreds of thousands of Single Nucleotide Polymorphisms (SNP) are genotyped. One is then interested to identify as many SNPs as possible which are associated with the trait in question, while at the same time minimizing the number of false detections.

The software package MOSGWA allows to detect SNPs via variable selection using the criterion mBIC2, a modified version of the Schwarz Bayesian Information Criterion. MOSGWA tries to minimize mBIC2 using some stepwise selection methods, whereas EA-MOSGWA applies some advanced evolutionary algorithms to achieve the same goal. We present results from an extensive simulation study where we compare the performance of EA-MOSGWA when using different parameter settings. We also consider using a clustering procedure to relax the multiple testing correction in mBIC2. Finally we compare results from EA-MOSGWA with the original stepwise search from MOSGWA, and show that the newly proposed algorithm has good properties in terms of minimizing the mBIC2 criterion, as well as in minimizing the misclassification rate of detected SNPs.

Go to article

Authors and Affiliations

Artur Gola
Małgorzata Bogdan
Florian Frommlet
Download PDF Download RIS Download Bibtex

Abstract

The problem of reconstructing an unknown disturbance under measuring a part of phase coordinates of a system of linear differential equations is considered. Solving algorithm is designed. The algorithm is based on the combination of ideas from the theory of dynamical inversion and the theory of guaranteed control. The algorithm consists of two blocks: the block of dynamical reconstruction of unmeasured coordinates and the block of dynamical reconstruction of an input.

Go to article

Authors and Affiliations

Marina Blizorukova
Vycheslav Maksimov
Download PDF Download RIS Download Bibtex

Abstract

The frictional resistance coefficient of ventilation of a roadway in a coal mine is a very important technical parameter in the design and renovation of mine ventilation. Calculations based on empirical formulae and field tests to calculate the resistance coefficient have limitations. An inversion method to calculate the mine ventilation resistance coefficient by using a few representative data of air flows and node pressures is proposed in this study. The mathematical model of the inversion method is developed based on the principle of least squares. The measured pressure and the calculated pressure deviation along with the measured flow and the calculated flow deviation are considered while defining the objective function, which also includes the node pressure, the air flow, and the ventilation resistance coefficient range constraints. The ventilation resistance coefficient inversion problem was converted to a nonlinear optimisation problem through the development of the model. A genetic algorithm (GA) was adopted to solve the ventilation resistance coefficient inversion problem. The GA was improved to enhance the global and the local search abilities of the algorithm for the ventilation resistance coefficient inversion problem.

Go to article

Authors and Affiliations

Ke Gao
Lijun Deng
Jian Liu
Liangxiu Wen
Dong Wong
Zeyi Liu
Download PDF Download RIS Download Bibtex

Abstract

Today’s human-computer interaction systems have a broad variety of applications in which automatic human emotion recognition is of great interest. Literature contains many different, more or less successful forms of these systems. This work emerged as an attempt to clarify which speech features are the most informative, which classification structure is the most convenient for this type of tasks, and the degree to which the results are influenced by database size, quality and cultural characteristic of a language. The research is presented as the case study on Slavic languages.

Go to article

Authors and Affiliations

Željko Nedeljković
Milana Milošević
Željko Đurović
Download PDF Download RIS Download Bibtex

Abstract

The formation of optimal crop rotations is virtually unsolvable from the standpoint of the classical methodology of experimental research. Here, we deal with a mathematical model based on expert estimates of “predecessor-crop” pairs’ efficiency created for the conditions of irrigation in the forest-steppe of Ukraine. Solving the problem of incorporating uncertainty assessments into this model, we present new models of crop rotations’ economic efficiency taking into account irrigation, application of fertilisers, and the negative environmental effect of nitrogen fertilisers’ introduction into the soil. For the considered models we pose an optimisation problem and present an algorithm for its solution that combines a gradient method and a genetic algorithm. Using the proposed mathematical tools, for several possible scenarios of water, fertilisers, and purchase price variability, the efficiency of growing corn as a monoculture in Ukraine is simulated. The proposed models show a reduction of the profitability of such a practice when the purchase price of corn decreases below 0.81 EUR∙kg –1 and the price of irrigation water increases above 0.32 EUR∙m –3 and propose more flexible crop rotations. Mathematical tools developed in the paper can form a basis for the creation of decision support systems that recommend optimal crop rotation variations to farmers and help to achieve sustainable, profitable, and ecologically safe agricultural production. However, future works on the actualisation of the values of its parameters need to be performed to increase the accuracy.
Go to article

Authors and Affiliations

Mykhailo Romashchenko
1
ORCID: ORCID
Vsevolod Bohaienko
2
ORCID: ORCID
Andrij Shatkovskyi
1
ORCID: ORCID
Roman Saidak
3
ORCID: ORCID
Tetiana Matiash
4
ORCID: ORCID
Volodymyr Kovalchuk
4
ORCID: ORCID

  1. Institute of Water Problems and Land Reclamation of NAAS, Kyiv, Ukraine
  2. V.M. Glushkov Institute of Cybernetics of the NAS of Ukraine, Laboratory of Methods of Mathematical Modeling of Ecology and Energy Processes, Glushkov Ave, 40, 03187, Kyiv, Ukraine
  3. Institute of Water Problems and Land Reclamation of NAAS, Department of Using of Agroresource Potential, Kyiv, Ukraine
  4. Institute of Water Problems and Land Reclamation of NAAS, Department of Information Technology and Marketing Innovation, Kyiv, Ukraine
Download PDF Download RIS Download Bibtex

Abstract

The concept of a hybrid scheme with connection of SIDH and ECDH is nowadays very popular. In hardware implementations it is convenient to use a classical key exchange algorithm, which is based on the same finite field as SIDH. Most frequently used hybrid scheme is SIDH-ECDH. On the other hand, using the same field as in SIDH, one can construct schemes over Fpn, like Diffie-Hellman or XTR scheme, whose security is based on the discrete logarithm problem. In this paper, idea of such schemes will be presented. The security of schemes, which are based on the discrete logarithm problem over fields Fp; Fp2 ; Fp4 ; Fp6 and Fp8 , for primes p used in SIDH, will be analyzed. At the end, the propositions of practical applications of these schemes will be presented.

Go to article

Authors and Affiliations

Michał Wroński
Elżbieta Burek
Łukasz Dzierzkowski

This page uses 'cookies'. Learn more