TITLE

Discrete Particle Swarm Optimization in the numerical solution of a system of linear Diophantine equations

AUTHOR(S)
Amaya, Iván; Gómez, Luis; Correa, Rodrigo
PUB. DATE
June 2014
SOURCE
Dyna;Jun2014, Vol. 81 Issue 185, p139
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
This article proposes the use of a discrete version of the well known Particle Swarm Optimization, DPSO, a metaheuristic optimization algorithm for numerically solving a system of linear Diophantine equations. Likewise, the transformation of this type of problem (i.e. solving a system of equations) into an optimization one is also shown. The current algorithm is able to find all the integer roots in a given search domain, at least for the examples shown. Simple problems are used to show its efficacy. Moreover, aspects related to the processing time, as well as to the effect of increasing the population and the search space, are discussed. It was found that the strategy shown herein represents a good approach when dealing with systems that have more unknowns than equations, or when it becomes of considerable size, since a big search domain is required.
ACCESSION #
97250695

 

Related Articles

  • Research of IGPC Control Strategy Based-on Hybrid Optimization for Power Station Boiler Superheated Steam Temperature. Benxian Xiao; Rongbao Chen; Xiao, Jun // International Journal of Information Technology & Computer Scien;Jan2014, Vol. 6 Issue 2, p36 

    Implicit Generalized Predictive Control (IGPC) algorithm can directly identify controller parameters without the need of solving Diophantine equation, thus can reduce the on-line algorithm computation time. In order to improve IGPC performance and extend its application, modified Particle Swarm...

  • Recursively enumerable sets of polynomials over a finite field are Diophantine. Demeyer, Jeroen // Inventiones Mathematicae;Dec2007, Vol. 170 Issue 3, p655 

    We construct a Diophantine interpretation of $\mathbb{F}_q[W,Z]$ over $\mathbb{F}_q[Z]$ . Using this together with a previous result that every recursively enumerable (r.e.) relation over $\mathbb{F}_q[Z]$ is Diophantine over $\mathbb{F}_q[W,Z]$ , we will prove that every r.e. relation over...

  • Identification of Deceptive Reviews by Sentimental Analysis and Characteristics of Reviewers. Xinyu Gao; Shi Li; Yiyin Zhu; Yiting Nan; Zihan Jian; Hongyu Tang // Journal of Engineering Science & Technology Review;2019, Vol. 12 Issue 1, p196 

    The purchase decisions of customers are influenced by the relevant reviews made by customers. Deceptive reviews are confusing and hard to detect. The existing identification method of deceptive reviews is based on the traditional algorithm of machine learning. However, the methods used to...

  • Editorial: Time-Frequency Approach to Radar Detection, Imaging, and Classification. THAYAPARAN, THAYANANTHAN; STANKOVIC, LJUBISA; AMIN, MOENESS; CHEN, VICTOR; COHEN, LEON; BOASHASH, BOUALEM // IET Signal Processing;Aug2010, Vol. 4 Issue 4, p325 

    The article discusses various reports published within the issue, including one on a two-dimensional multiwindow S-method for radar imaging applications, and another on the genetic algorithm (GA) and the particle swarm optimization (PSO) algorithm.

  • Guest Editorial. Qiu, Robin G.; He, Matthew // Journal of Networks;Apr2010, Vol. 5 Issue 4, p391 

    The article discusses various reports published within the issue, including one by Hua Jiang and Junhu Ruan on the risk assessment model developed for high-technology projects, one by Jun Tang and Xiaojuan Zhao on the hybrid particle swarm optimization (PSO), and one by Yongquan Zhou and...

  • Recent Trends of Computational Methods in Vibration Problems. Chakraverty, Snehashish; Sahu, Atma; Keong, Choong Kok; Hassan, Saleh M. // Advances in Acoustics & Vibration;2012, Vol. 2012, p1 

    An introduction is presented in which the editor discusses various research papers within the issue on topics including vibration analysis, use of particle swarm optimization and homotopy analysis method.

  • Corrigendum: Collective Motion of Swarming Agents Evolving on a Sphere Manifold: A Fundamental Framework and Characterization. Li, Wei // Scientific Reports;10/30/2015, p15596 

    A correction to the article "Collective Motion of Swarming Agents Evolving on a Sphere Manifold: A Fundamental Framework and Characterization ," by Wei Li, that was published in the October 28,2015 issue is presented.

  • Management Resources Allocation and Scheduling based on Particle Swarm Optimization (PSO). Yangmin BAI // International Journal of Simulation -- Systems, Science & Techno;2016, Vol. 17 Issue 2, p18.1 

    Resources allocation and scheduling can be accomplished in various ways, and there are different criteria for resources allocation and scheduling. In this regard it is generally subject to the values of a particular time and space, but also subject to accounting under certain conditions of time...

  • An Improved Particle Swarm Optimization (IPSO) Approach for Identification and Control of Stable and Unstable Systems. El Gmili, Nada; Mjahed, Mostafa; El Kari, Abdeljalil; Ayad, Hassan // International Review of Automatic Control;May2017, Vol. 10 Issue 3, p229 

    In this paper, an Improved Particle Swarm Optimization (IPSO) technique is generalized to identify and control four systems of different types of behaviors. This was possible thanks to the use of a new initialization strategy of partitioning of particles, which helps PSO to converge faster to...

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics