Single-solution simulated Kalman filter algorithm for global optimisation problems

DOI10.1007/S12046-018-0888-9zbMath1397.90304OpenAlexW2785456392WikidataQ129683071 ScholiaQ129683071MaRDI QIDQ1789165

Zuwairie Ibrahim, Mohd Saberi Mohamad, Nor Hidayati Abdul Aziz, Nor Azlina Ab Aziz, Junzo Watada

Publication date: 10 October 2018

Published in: Sādhanā (Search for Journal in Brave)

Full work available at URL: https://www.ias.ac.in/describe/article/sadh/043/07/0103

zbMATH Keywords

metaheuristicsoptimisationKalmanadaptive neighbourhoodsingle-solutionSKF

Mathematics Subject Classification ID

Filtering in stochastic control theory (93E11) Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59)

Uses Software

• KEEL
• CEC 13

Cites Work

• Unnamed Item
• Optimization by Simulated Annealing
• A survey on optimization metaheuristics
• Variable neighborhood search
• Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
• Future paths for integer programming and links to artificial intelligence
• Upper and lower bounds for randomized search heuristics in black-box optimization
• Practical Genetic Algorithms

This page was built for publication: Single-solution simulated Kalman filter algorithm for global optimisation problems