NESTING DISCRETE PARTICLE SWARM OPTIMIZERS FOR MULTI-SOLUTION PROBLEMS

Masafumi Kubota, Toshimichi Saito

2011

Abstract

This paper studies a discrete particle swarm optimizer for multi-solution problems. The algorithm consists of two stages. The first stage is global search: the whole search space is discretized into the local sub-regions each of which has one approximate solution. The sub-region consists of subsets of lattice points in relatively rough resolution. The second stage is local search. Each subregion is re-discretized into finer lattice points and the algorithm operates in all the subregions in parallel to find all approximate solutions. Performing basic numerical experiment, the algorithm efficiency is investigated.

Paper Citation

in Harvard Style

Kubota M. and Saito T. (2011). NESTING DISCRETE PARTICLE SWARM OPTIMIZERS FOR MULTI-SOLUTION PROBLEMS . In Proceedings of the International Conference on Evolutionary Computation Theory and Applications - Volume 1: ECTA, (IJCCI 2011) ISBN 978-989-8425-83-6, pages 263-266. DOI: 10.5220/0003623102630266

in Bibtex Style

@conference{ecta11,
author={Masafumi Kubota and Toshimichi Saito},
title={NESTING DISCRETE PARTICLE SWARM OPTIMIZERS FOR MULTI-SOLUTION PROBLEMS},
booktitle={Proceedings of the International Conference on Evolutionary Computation Theory and Applications - Volume 1: ECTA, (IJCCI 2011)},
year={2011},
pages={263-266},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003623102630266},
isbn={978-989-8425-83-6},
}

in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Evolutionary Computation Theory and Applications - Volume 1: ECTA, (IJCCI 2011)
TI - NESTING DISCRETE PARTICLE SWARM OPTIMIZERS FOR MULTI-SOLUTION PROBLEMS
SN - 978-989-8425-83-6
AU - Kubota M.
AU - Saito T.
PY - 2011
SP - 263
EP - 266
DO - 10.5220/0003623102630266