924 research outputs found
A hybrid genetic pattern search augmented Lagrangian method for constrained global optimization
Hybridization of genetic algorithms with local search approaches can enhance their performance in global optimization. Genetic algorithms, as most population based algorithms, require a considerable number of function evaluations. This may be an important drawback when the functions involved in the problem are computationally expensive as it occurs in most real world problems. Thus, in order to reduce the total number of function evaluations, local and global techniques may be combined. Moreover, the hybridization may provide a more effective trade-off between exploitation and exploration of the search space. In this study, we propose a new hybrid genetic algorithm based on a local pattern search that relies on an augmented Lagrangian function for constraint-handling. The local search strategy is used to improve the best approximation found by the genetic algorithm. Convergence to an -global minimizer is proved. Numerical results and comparisons with other stochastic algorithms using a set of benchmark constrained problems are provided.FEDER COMPETEFundação para a Ciência e a Tecnologia (FCT
Opportunistic Self Organizing Migrating Algorithm for Real-Time Dynamic Traveling Salesman Problem
Self Organizing Migrating Algorithm (SOMA) is a meta-heuristic algorithm
based on the self-organizing behavior of individuals in a simulated social
environment. SOMA performs iterative computations on a population of potential
solutions in the given search space to obtain an optimal solution. In this
paper, an Opportunistic Self Organizing Migrating Algorithm (OSOMA) has been
proposed that introduces a novel strategy to generate perturbations
effectively. This strategy allows the individual to span across more possible
solutions and thus, is able to produce better solutions. A comprehensive
analysis of OSOMA on multi-dimensional unconstrained benchmark test functions
is performed. OSOMA is then applied to solve real-time Dynamic Traveling
Salesman Problem (DTSP). The problem of real-time DTSP has been stipulated and
simulated using real-time data from Google Maps with a varying cost-metric
between any two cities. Although DTSP is a very common and intuitive model in
the real world, its presence in literature is still very limited. OSOMA
performs exceptionally well on the problems mentioned above. To substantiate
this claim, the performance of OSOMA is compared with SOMA, Differential
Evolution and Particle Swarm Optimization.Comment: 6 pages, published in CISS 201
Metaheuristic design of feedforward neural networks: a review of two decades of research
Over the past two decades, the feedforward neural network (FNN) optimization has been a key interest among the researchers and practitioners of multiple disciplines. The FNN optimization is often viewed from the various perspectives: the optimization of weights, network architecture, activation nodes, learning parameters, learning environment, etc. Researchers adopted such different viewpoints mainly to improve the FNN's generalization ability. The gradient-descent algorithm such as backpropagation has been widely applied to optimize the FNNs. Its success is evident from the FNN's application to numerous real-world problems. However, due to the limitations of the gradient-based optimization methods, the metaheuristic algorithms including the evolutionary algorithms, swarm intelligence, etc., are still being widely explored by the researchers aiming to obtain generalized FNN for a given problem. This article attempts to summarize a broad spectrum of FNN optimization methodologies including conventional and metaheuristic approaches. This article also tries to connect various research directions emerged out of the FNN optimization practices, such as evolving neural network (NN), cooperative coevolution NN, complex-valued NN, deep learning, extreme learning machine, quantum NN, etc. Additionally, it provides interesting research challenges for future research to cope-up with the present information processing era
04461 Abstracts Collection -- Practical Approaches to Multi-Objective Optimization
From 07.11.04 to 12.11.04, the Dagstuhl Seminar 04461
``Practical Approaches to Multi-Objective Optimization\u27\u27 was held
in the International Conference and Research Center (IBFI),
Schloss Dagstuhl.
During the seminar, several participants presented their current
research, and ongoing work and open problems were discussed. Abstracts of
the presentations given during the seminar as well as abstracts of
seminar results and ideas are put together in this paper. The first section
describes the seminar topics and goals in general.
Links to extended abstracts or full papers are provided, if available
- …