Particle swarm optimization for integer programming

By E. Laskari, Konstantinos E. Parsopoulos, Michael N. Vrahatis. Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600), 2002

325 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computational Theory and Mathematics

View Paper: https://www.semanticscholar.org/paper/65278d7d2558aff34241c070bab4057a416d48b2

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

In Computational Theory and Mathematics

Citations in the corpus

On the computation of all global minimizers through particle swarm optimization (2004, background): “Among other applications, it has been applied to tackle multiobjective problems [14]–[19], minimax problems [20], [21], integer programming problems [22], noisy and continuously changing environments [23]–[26], errors-in-variables problems [27], existence of function zeros [28], and numerous enginee”
Global-best harmony search (2008, methodology): “methods developed for real search spaces can be used to solve Integer Programming problems by rounding off the real optimum values to the nearest integers [14].”
Recent approaches to global optimization problems through Particle Swarm Optimization (2002, unknown): “In this section, the performance of the PSO with regard to minimax problems is reported (Laskari et al., 2002a), and for some cases its performance is compared with the performance of the Smoothing algorithm proposed in (Xu, 2001).”
Particle Swarm Methods (2018, methodology): “This potential deficiency can be tackled either by restarting the current positions of the particles (and possibly also the best positions except the overall best one) as soon as stagnation is identified or by applying gradual truncation of the decimal digits of the position vectors of the particles”
Using Augmented Lagrangian Particle Swarm Optimization for Constrained Problems in Engineering (2009, background): “Venter and Sobieszczanski-Sobieski (2003) as well as Laskari et al. (2002) presented some modifications towards integer programming.”
Particle swarm optimization versus genetic algorithms for phased array synthesis (2004, background): “Particle swarm optimizers have also been proposed for integer programming [50], multiobjective optimization [51], [52], and binary optimization [53], [54].”
A review of particle swarm optimization. Part I: background and development (2007, methodology): “Laskari et al. (2002) presented an implementation of PSO that initially operated in continuous space but truncated the real number values to integers.”
Particle Swarm Optimization: A survey of historical and recent developments with hybridization perspectives (2018, methodology): “Laskari et al [193] tested three variants of PSO against the popular Branch and Bound method on seven different integer programming problems.”