Abstract

This article shows a novel approach for optimization and inverse problems based on evolutionary computation with the aim to satisfy two opposite requirements: exploration and convergence. The proposed approach is particularly suitable for parallel computing and it gives its best both for multimodal problems and for problems in which bad initializations can occur. The proposed algorithm has been called MeTEO to point out its metric-topological and evolutionary inspiration. In fact, it is based on a hybridization of two heuristics coming from swarm intelligence: the flock-of-starlings optimization (FSO; which shows high exploration capability but a lack of convergence), the standard particle swarm optimization (which is less explorative than FSO but with a good convergence capability) and a third evolutionary heuristic: the bacterial chemotaxis algorithm (that has no collective behaviour, no exploration skill but high convergence capability). Finally, with the aim of speeding up the algorithm, a technique that we call fitness modification is proposed and implemented. Suitable tests regarding optimization benchmarks and inverse problems will be presented with the aim of pointing out the MeTEO performances compared with those of each single heuristic used for hybridization.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.