Towards a Generalised Metaheuristic Model for Continuous Optimisation Problems
نویسندگان
چکیده
منابع مشابه
Towards Relational Modelling of Combinatorial Optimisation Problems
A high-level abstract-datatype-based constraint modelling language opens the door to an automatable empirical determination — by a compiler — of how to ‘best’ represent the variables of a combinatorial optimisation problem, based on (reallife) training instances of the problem. In the extreme case where no such training instances are provided, such a compiler would simply be nondeterministic. A...
متن کاملAdaptive Zooming Genetic Algorithm for Continuous Optimisation Problems
This paper proposes an adaptive zooming genetic algorithm (AZGA) for continuous optimisation problems. Other than gradually reducing the search space with a fixed reduction rate during the evolution process, the upper and lower boundaries for variables in the objective function are dynamically adjusted based on the distribution information of variables in the whole population. This technique is...
متن کاملInvestigating Circles in a Square Packing Problems as a Realistic Benchmark for Continuous Metaheuristic Optimization Algorithms
In recent years, there has been a growing interest in the development of experimental methodology in metaheuristics. In the field, researchers continue to develop and propose new algorithms at a rapid rate. While theoretical analysis has made progress and continues to develop, it is often the case that algorithms are evaluated and analyzed via empirical techniques. A vital component of experime...
متن کاملTowards an Efficient API for Optimisation Problems Data
The literature presents many application programming interfaces (APIs) and frameworks that provide state of the art algorithms and techniques for solving optimisation problems. The same cannot be said about APIs and frameworks focused on the problem data itself because with the peculiarities and details of each variant of a problem, it is virtually impossible to provide general tools that are b...
متن کاملCentral force optimisation: a new gradient-like metaheuristic for multidimensional search and optimisation
This paper introduces central force optimisation, a novel, nature-inspired, deterministic search metaheuristic for constrained multidimensional optimisation in highly multimodal, smooth, or discontinuous decision spaces. CFO is based on the metaphor of gravitational kinematics. The algorithm searches a decision space by ‘flying’ its ‘probes’ through the space by analogy to masses moving through...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2020
ISSN: 2227-7390
DOI: 10.3390/math8112046