Tag: Soft Computing – A Fusion of Foundations, Methodologies and Applications

Theoretical basis of parameter tuning for finding optima near the boundaries of search spaces in real-coded genetic algorithms

Abstract  Studies on parameter tuning in evolutionary algorithms are essential for achieving efficient adaptive searches. This paper
discusses parameter tuning in real-valued crossover operators theoretically. The theoretical analysis is dev…

Abstract  

Studies on parameter tuning in evolutionary algorithms are essential for achieving efficient adaptive searches. This paper
discusses parameter tuning in real-valued crossover operators theoretically. The theoretical analysis is devoted to improving
robustness of real-coded genetic algorithms (RCGAs) for finding optima near the boundaries of bounded search spaces, which
can be found in most real-world applications. The proposed technique for crossover-parameter tuning is expressed mathematically,
and thus enables us to control the dispersion of child distribution quantitatively. The universal applicability and effect
have been confirmed theoretically and verified empirically with five crossover operators. Statistical properties of several
practical RCGAs are also investigated numerically. Performance comparison with various parameter values has been conducted
on test functions with the optima placed not only at the center but also in a corner of the search space. Although the parameter-tuning
technique is fairly simple, the experimental results have shown the great effectiveness.

  • Content Type Journal Article
  • Category Original Paper
  • Pages 1-23
  • DOI 10.1007/s00500-011-0732-1
  • Authors
    • Hiroshi Someya, The Institute of Statistical Mathematics, 10-3 Midori-cho, Tachikawa, Tokyo, 190-8562 Japan

Modeling dynamics of a real-coded CHC algorithm in terms of dynamical probability distributions

Abstract  Some theoretical models have been proposed in the literature to predict dynamics of real-coded evolutionary algorithms. These
models are often applied to study very simplified algorithms, simple real-coded functions or sometimes th…

Abstract  

Some theoretical models have been proposed in the literature to predict dynamics of real-coded evolutionary algorithms. These
models are often applied to study very simplified algorithms, simple real-coded functions or sometimes these make difficult
to obtain quantitative measures related to algorithm performance. This paper, trying to reduce these simplifications to obtain
a more useful model, proposes a model that describes the behavior of a slightly simplified version of the popular real-coded
CHC in multi-peaked landscape functions. Our approach is based on predicting the shape of the search pattern by modeling the
dynamics of clusters, which are formed by individuals of the population. This is performed in terms of dynamical probability
distributions as a basis to estimate its averaged behavior. Within reasonable time, numerical experiments show that is possible
to achieve accurate quantitative predictions in functions of up to 5D about performance measures such as average fitness,
the best fitness reached or number of fitness function evaluations.

  • Content Type Journal Article
  • Category Original Paper
  • Pages 1-21
  • DOI 10.1007/s00500-011-0745-9
  • Authors
    • Jesús Marín, Department of Automatic Control (ESAII), Universitat Politècnica de Catalunya, EUETIB, Urgell 187, 08036 Barcelona, Spain
    • Daniel Molina, Department of Computer Science and Engineering, University of Cádiz, 1103 Cádiz, Spain
    • Francisco Herrera, Department of Computer Science and Artificial Intelligence, University of Granada, 18071 Granada, Spain

Erratum to: Bayesian estimation based on vague lifetime data

Erratum to: Bayesian estimation based on vague lifetime data
Content Type Journal ArticleCategory ErratumPages 1-1DOI 10.1007/s00500-011-0747-7Authors
R. Zarei, Department of Statistics, School of Mathematical Sciences, Ferdowsi University of Mashha…

Erratum to: Bayesian estimation based on vague lifetime data

  • Content Type Journal Article
  • Category Erratum
  • Pages 1-1
  • DOI 10.1007/s00500-011-0747-7
  • Authors
    • R. Zarei, Department of Statistics, School of Mathematical Sciences, Ferdowsi University of Mashhad, 91775-1159 Mashhad, Iran
    • M. Amini, Department of Statistics, School of Mathematical Sciences, Ferdowsi University of Mashhad, 91775-1159 Mashhad, Iran
    • S. M. Taheri, Department of Mathematical Sciences, Isfahan University of Technology, 84156-83111 Isfahan, Iran
    • A. H. Rezaei, Department of Statistics, School of Mathematical Sciences, Ferdowsi University of Mashhad, 91775-1159 Mashhad, Iran

Explicit solutions of fractional differential equations with uncertainty

Abstract  We give the explicit solutions of uncertain fractional differential equations (UFDEs) under Riemann–Liouville H-differentiability using Mittag-Leffler functions. To this end, Riemann–Liouville H-differentiability is introduced w…

Abstract  

We give the explicit solutions of uncertain fractional differential equations (UFDEs) under Riemann–Liouville H-differentiability using Mittag-Leffler functions. To this end, Riemann–Liouville H-differentiability is introduced which is a direct generalization of the concept of Riemann–Liouville differentiability in
deterministic sense to the fuzzy context. Moreover, equivalent integral forms of UFDEs are determined which are applied to
derive the explicit solutions. Finally, some illustrative examples are given.

  • Content Type Journal Article
  • Category Original Paper
  • Pages 1-6
  • DOI 10.1007/s00500-011-0743-y
  • Authors
    • T. Allahviranloo, Department of Mathematics, Science and Research Branch, Islamic Azad University, Tehran, Iran
    • S. Salahshour, Department of Mathematics, Science and Research Branch, Islamic Azad University, Tehran, Iran
    • S. Abbasbandy, Department of Mathematics, Science and Research Branch, Islamic Azad University, Tehran, Iran

More about sharp and meager elements in Archimedean atomic lattice effect algebras

Abstract  The aim of our paper is twofold. First, we thoroughly study the set of meager elements

M(E),
the center

C(E)
and the compatibility center

B(E)
in the setting of atomic Archimedean lattice effect algebras

E.
The main resu…

Abstract  

The aim of our paper is twofold. First, we thoroughly study the set of meager elements

M(E),

the center

C(E)

and the compatibility center

B(E)

in the setting of atomic Archimedean lattice effect algebras

E.

The main result is that in this case the center

C(E)

is bifull (atomic) iff the compatibility center

B(E)

is bifull (atomic) whenever

E

is sharply dominating. As a by-product, we give a new description of the smallest sharp element over

x Î E

via the basic decomposition of

x.

Second, we prove the Triple Representation Theorem for sharply dominating atomic Archimedean lattice effect algebras.

  • Content Type Journal Article
  • Category Original Paper
  • Pages 1-11
  • DOI 10.1007/s00500-011-0738-8
  • Authors
    • Josef Niederle, Department of Mathematics and Statistics, Faculty of Science, Masaryk University, Kotlářská 2, 611 37 Brno, Czech Republic
    • Jan Paseka, Department of Mathematics and Statistics, Faculty of Science, Masaryk University, Kotlářská 2, 611 37 Brno, Czech Republic

Autonomous mobile robot dynamic motion planning using hybrid fuzzy potential field

Abstract  A new fuzzy-based potential field method is presented in this paper for autonomous mobile robot motion planning with dynamic
environments including static or moving target and obstacles. Two fuzzy Mamdani and TSK models have been u…

Abstract  

A new fuzzy-based potential field method is presented in this paper for autonomous mobile robot motion planning with dynamic
environments including static or moving target and obstacles. Two fuzzy Mamdani and TSK models have been used to develop the
total attractive and repulsive forces acting on the mobile robot. The attractive and repulsive forces were estimated using
four inputs representing the relative position and velocity between the target and the robot in the x and y directions, in one hand, and between the obstacle and the robot, on the other hand. The proposed fuzzy potential field motion
planning was investigated based on several conducted MATLAB simulation scenarios for robot motion planning within realistic
dynamic environments. As it was noticed from these simulations that the proposed approach was able to provide the robot with
collision-free path to softly land on the moving target and solve the local minimum problem within any stationary or dynamic
environment compared to other potential field-based approaches.

  • Content Type Journal Article
  • Category Original Paper
  • Pages 1-12
  • DOI 10.1007/s00500-011-0742-z
  • Authors
    • Mohammad Abdel Kareem Jaradat, Department of Mechanical Engineering, Faculty of Engineering, Jordan University of Science and Technology, Irbid, Jordan
    • Mohammad H. Garibeh, Department of Electrical Power Engineering, Hijjawi Faculty of Engineering Technology, Yarmouk University, Irbid, Jordan
    • Eyad A. Feilat, Department of Electrical Power Engineering, Hijjawi Faculty of Engineering Technology, Yarmouk University, Irbid, Jordan

A new model for linguistic summarization of heterogeneous data: an application to tourism web data sources

Abstract  In this paper we present the problem of aggregating heterogeneous data from various websites with opinions about high end
hotels into a database. We present the fuzzy model based on the semantic translation as a tool to obtain a li…

Abstract  

In this paper we present the problem of aggregating heterogeneous data from various websites with opinions about high end
hotels into a database. We present the fuzzy model based on the semantic translation as a tool to obtain a linguistic summarization. The characteristics of this model (necessary to solve the problem) are not
together on any of the existing linguistic models: the management of the input heterogeneous data (natural language included);
the procurement of linguistic results with high precision and good interpretability; and the use of unbalanced linguistic
term sets described by trapezoidal membership functions for defining the initial linguistic terms. We applied it to aggregate
data from certain high end hotels websites and we show a case study using the high end hotels located in Granada (Spain) from
such websites during a year. With this aggregated information, a data analyst can make several analyses with the benefit of
easy linguistic interpretability and a high precision. The solution proposed here can be used to similar aggregation problems.

  • Content Type Journal Article
  • Category Original Paper
  • Pages 1-17
  • DOI 10.1007/s00500-011-0740-1
  • Authors
    • Ramón A. Carrasco, Department of Software Engineering, University of Granada, 18071 Granada, Spain
    • Pedro Villar, Department of Software Engineering, University of Granada, 18071 Granada, Spain

Bio-inspired computing for hybrid information technology

Bio-inspired computing for hybrid information technology
Content Type Journal ArticleCategory EditorialPages 1-2DOI 10.1007/s00500-011-0720-5Authors
Binod Vaidya, Institute of Telecommunications, Covilha, PortugalJong Hyuk Park, Seoul National Unive…

Bio-inspired computing for hybrid information technology

  • Content Type Journal Article
  • Category Editorial
  • Pages 1-2
  • DOI 10.1007/s00500-011-0720-5
  • Authors
    • Binod Vaidya, Institute of Telecommunications, Covilha, Portugal
    • Jong Hyuk Park, Seoul National University of Science and Technology, Seoul, Korea
    • Hamid R. Arabnia, The University of Georgia, Athens, USA
    • Witold Pedrycz, University of Alberta, Edmonton, Canada
    • Sheng-Lung Peng, National Dong Hwa University, Hualien, Taiwan

A new approach to obtain algebraic solution of interval linear systems

Abstract  In this paper, an algebraic solution of interval linear system involving a real square matrix and an interval right-hand side
vector is obtained. A new approach to solve such systems based on the new concept “inclusion linear sys…

Abstract  

In this paper, an algebraic solution of interval linear system involving a real square matrix and an interval right-hand side
vector is obtained. A new approach to solve such systems based on the new concept “inclusion linear system” is proposed. Moreover,
new necessary and sufficient conditions are derived for obtaining the unique algebraic solution. Furthermore, based on our
method, an algorithm is proposed and numerically demonstrated. Finally, we compare the result obtained by our method with
that obtained by interval Gauss elimination procedure.

  • Content Type Journal Article
  • Category Original Paper
  • Pages 1-13
  • DOI 10.1007/s00500-011-0739-7
  • Authors
    • T. Allahviranloo, Department of Mathematics, Science and Research Branch, Islamic Azad University, Tehran, Iran
    • M. Ghanbari, Department of Mathematics, Science and Research Branch, Islamic Azad University, Tehran, Iran

Multi-circle detection on images using artificial bee colony (ABC) optimization

Abstract  Hough transform has been the most common method for circle detection, exhibiting robustness, but adversely demanding considerable
computational effort and large memory requirements. Alternative approaches include heuristic methods …

Abstract  

Hough transform has been the most common method for circle detection, exhibiting robustness, but adversely demanding considerable
computational effort and large memory requirements. Alternative approaches include heuristic methods that employ iterative
optimization procedures for detecting multiple circles. Since only one circle can be marked at each optimization cycle, multiple
executions ought to be enforced in order to achieve multi-detection. This paper presents an algorithm for automatic detection
of multiple circular shapes that considers the overall process as a multi-modal optimization problem. The approach is based
on the artificial bee colony (ABC) algorithm, a swarm optimization algorithm inspired by the intelligent foraging behavior
of honeybees. Unlike the original ABC algorithm, the proposed approach presents the addition of a memory for discarded solutions.
Such memory allows holding important information regarding other local optima, which might have emerged during the optimization
process. The detector uses a combination of three non-collinear edge points as parameters to determine circle candidates.
A matching function (nectar-amount) determines if such circle candidates (bee-food sources) are actually present in the image.
Guided by the values of such matching functions, the set of encoded candidate circles are evolved through the ABC algorithm
so that the best candidate (global optimum) can be fitted into an actual circle within the edge-only image. Then, an analysis
of the incorporated memory is executed in order to identify potential local optima, i.e., other circles. The proposed method
is able to detect single or multiple circles from a digital image through only one optimization pass. Simulation results over
several synthetic and natural images, with a varying range of complexity, validate the efficiency of the proposed technique
regarding its accuracy, speed, and robustness.

  • Content Type Journal Article
  • Category Original Paper
  • Pages 1-16
  • DOI 10.1007/s00500-011-0741-0
  • Authors
    • Erik Cuevas, Departamento de Ciencias Computacionales, Universidad de Guadalajara, CUCEI, Av. Revolución 1500, Guadalajara, Jal, Mexico
    • Felipe Sención-Echauri, Departamento de Ciencias Computacionales, Universidad de Guadalajara, CUCEI, Av. Revolución 1500, Guadalajara, Jal, Mexico
    • Daniel Zaldivar, Departamento de Ciencias Computacionales, Universidad de Guadalajara, CUCEI, Av. Revolución 1500, Guadalajara, Jal, Mexico
    • Marco Pérez-Cisneros, Departamento de Ciencias Computacionales, Universidad de Guadalajara, CUCEI, Av. Revolución 1500, Guadalajara, Jal, Mexico