Incremental Particle Swarm-Guided Local Search for Continuous Optimization

2008 ◽  
pp. 72-86 ◽  
Author(s):  
Marco A. Montes de Oca ◽  
Ken Van den Enden ◽  
Thomas Stützle
Keyword(s):  
Local Search ◽  
Particle Swarm ◽  
Continuous Optimization ◽  
Guided Local Search

scholarly journals Improved Particle Swarm Optimization with a Collective Local Unimodal Search for Continuous Optimization Problems

2014 ◽  
Vol 2014 ◽  
pp. 1-23 ◽  
Author(s):  
Martins Akugbe Arasomwan ◽  
Aderemi Oluyinka Adewumi
Keyword(s):  
Particle Swarm Optimization ◽  
Local Search ◽  
Optimization Problems ◽  
Particle Swarm ◽  
Continuous Optimization ◽  
Search Space ◽  
Benchmark Problems ◽  
Search Technique ◽  
Swarm Optimization ◽  
Particle Position

A new local search technique is proposed and used to improve the performance of particle swarm optimization algorithms by addressing the problem of premature convergence. In the proposed local search technique, a potential particle position in the solution search space is collectively constructed by a number of randomly selected particles in the swarm. The number of times the selection is made varies with the dimension of the optimization problem and each selected particle donates the value in the location of its randomly selected dimension from its personal best. After constructing the potential particle position, some local search is done around its neighbourhood in comparison with the current swarm global best position. It is then used to replace the global best particle position if it is found to be better; otherwise no replacement is made. Using some well-studied benchmark problems with low and high dimensions, numerical simulations were used to validate the performance of the improved algorithms. Comparisons were made with four different PSO variants, two of the variants implement different local search technique while the other two do not. Results show that the improved algorithms could obtain better quality solution while demonstrating better convergence velocity and precision, stability, robustness, and global-local search ability than the competing variants.

scholarly journals An Enhanced Multi-Objective Particle Swarm Optimization in Water Distribution Systems Design

Water ◽  
2021 ◽  
Vol 13 (10) ◽  
pp. 1334
Author(s):  
Mohamed R. Torkomany ◽  
Hassan Shokry Hassan ◽  
Amin Shoukry ◽  
Ahmed M. Abdelrazek ◽  
Mohamed Elkholy
Keyword(s):  
Particle Swarm Optimization ◽  
Local Search ◽  
Distribution Systems ◽  
Water Distribution ◽  
Water Distribution Systems ◽  
Particle Swarm ◽  
Large Network ◽  
Swarm Optimization ◽  
Original Algorithm ◽  
Multi Objective

The scarcity of water resources nowadays lays stress on researchers to develop strategies aiming at making the best benefit of the currently available resources. One of these strategies is ensuring that reliable and near-optimum designs of water distribution systems (WDSs) are achieved. Designing WDSs is a discrete combinatorial NP-hard optimization problem, and its complexity increases when more objectives are added. Among the many existing evolutionary algorithms, a new hybrid fast-convergent multi-objective particle swarm optimization (MOPSO) algorithm is developed to increase the convergence and diversity rates of the resulted non-dominated solutions in terms of network capital cost and reliability using a minimized computational budget. Several strategies are introduced to the developed algorithm, which are self-adaptive PSO parameters, regeneration-on-collision, adaptive population size, and using hypervolume quality for selecting repository members. A local search method is also coupled to both the original MOPSO algorithm and the newly developed one. Both algorithms are applied to medium and large benchmark problems. The results of the new algorithm coupled with the local search are superior to that of the original algorithm in terms of different performance metrics in the medium-sized network. In contrast, the new algorithm without the local search performed better in the large network.

scholarly journals A Novel Multimean Particle Swarm Optimization Algorithm for Nonlinear Continuous Optimization: Application to Feed-Forward Neural Network Training

2018 ◽  
Vol 2018 ◽  
pp. 1-9 ◽  
Author(s):  
Mehmet Hacibeyoglu ◽  
Mohammed H. Ibrahim
Keyword(s):  
Neural Networks ◽  
Particle Swarm Optimization ◽  
Artificial Neural Networks ◽  
Optimization Algorithm ◽  
Particle Swarm Optimization Algorithm ◽  
Particle Swarm ◽  
Continuous Optimization ◽  
Swarm Optimization ◽  
Feed Forward ◽  
Artificial Neural

Multilayer feed-forward artificial neural networks are one of the most frequently used data mining methods for classification, recognition, and prediction problems. The classification accuracy of a multilayer feed-forward artificial neural networks is proportional to training. A well-trained multilayer feed-forward artificial neural networks can predict the class value of an unseen sample correctly if provided with the optimum weights. Determining the optimum weights is a nonlinear continuous optimization problem that can be solved with metaheuristic algorithms. In this paper, we propose a novel multimean particle swarm optimization algorithm for multilayer feed-forward artificial neural networks training. The proposed multimean particle swarm optimization algorithm searches the solution space more efficiently with multiple swarms and finds better solutions than particle swarm optimization. To evaluate the performance of the proposed multimean particle swarm optimization algorithm, experiments are conducted on ten benchmark datasets from the UCI repository and the obtained results are compared to the results of particle swarm optimization and other previous research in the literature. The analysis of the results demonstrated that the proposed multimean particle swarm optimization algorithm performed well and it can be adopted as a novel algorithm for multilayer feed-forward artificial neural networks training.

Guided Local Search for the Three-Dimensional Bin-Packing Problem

2003 ◽  
Vol 15 (3) ◽  
pp. 267-283 ◽  
Author(s):  
Oluf Faroe ◽  
David Pisinger ◽  
Martin Zachariasen
Keyword(s):  
Local Search ◽  
Bin Packing ◽  
Three Dimensional ◽  
Packing Problem ◽  
Guided Local Search ◽  
Bin Packing Problem

scholarly journals A Particle Swarm Based Algorithm for Functional Distributed Constraint Optimization Problems

2020 ◽  
Vol 34 (05) ◽  
pp. 7111-7118
Author(s):  
Moumita Choudhury ◽  
Saaduddin Mahmud ◽  
Md. Mosaddek Khan
Keyword(s):  
Optimization Problems ◽  
State Of The Art ◽  
Particle Swarm ◽  
Continuous Optimization ◽  
Continuous Variables ◽  
Constraint Optimization ◽  
Solution Quality ◽  
Distributed Constraint Optimization ◽  
Continuous Optimization Problems ◽  
Constraint Optimization Problems

Distributed Constraint Optimization Problems (DCOPs) are a widely studied constraint handling framework. The objective of a DCOP algorithm is to optimize a global objective function that can be described as the aggregation of several distributed constraint cost functions. In a DCOP, each of these functions is defined by a set of discrete variables. However, in many applications, such as target tracking or sleep scheduling in sensor networks, continuous valued variables are more suited than the discrete ones. Considering this, Functional DCOPs (F-DCOPs) have been proposed that can explicitly model a problem containing continuous variables. Nevertheless, state-of-the-art F-DCOPs approaches experience onerous memory or computation overhead. To address this issue, we propose a new F-DCOP algorithm, namely Particle Swarm based F-DCOP (PFD), which is inspired by a meta-heuristic, Particle Swarm Optimization (PSO). Although it has been successfully applied to many continuous optimization problems, the potential of PSO has not been utilized in F-DCOPs. To be exact, PFD devises a distributed method of solution construction while significantly reducing the computation and memory requirements. Moreover, we theoretically prove that PFD is an anytime algorithm. Finally, our empirical results indicate that PFD outperforms the state-of-the-art approaches in terms of solution quality and computation overhead.

Sign in / Sign up

Export Citation Format

Share Document