Swarm intelligence algorithms are metaheuristics inspired by the collective behavior of species such as birds, fish, bees, and ants. They are used in many optimization problems due to their simplicity, flexibility, and scalability.
Alam Zeb +4 more
doaj +1 more source
An Adaptive Multi-Population Optimization Algorithm for Global Continuous Optimization
Nowadays, there are various optimization problems that exact mathematical methods are not applicable. Metaheuristics are considered as efficient approaches for finding the solutions.
Zhixi Li, Vincent Tam, Lawrence K. Yeung
doaj +1 more source
This research aimed to solve the economic crop planning problem, considering transportation logistics to maximize the profit from cultivated activities.
Udompong Ketsripongsa +3 more
doaj +1 more source
Efficiency Analysis of Swarm Intelligence and Randomization Techniques [PDF]
Swarm intelligence has becoming a powerful technique in solving design and scheduling tasks. Metaheuristic algorithms are an integrated part of this paradigm, and particle swarm optimization is often viewed as an important landmark.
Yang, Xin-She
core +1 more source
CUSTOMHyS: Customising Optimisation Metaheuristics via Hyper-heuristic Search
There is a colourful palette of metaheuristics for solving continuous optimisation problems in the literature. Unfortunately, it is not easy to pick a suitable one for a specific practical scenario. Moreover, oftentimes the selected metaheuristic must be
Jorge M. Cruz-Duarte +4 more
doaj +1 more source
A hyper-matheuristic approach for solving mixed integer linear optimization models in the context of data envelopment analysis [PDF]
Mixed Integer Linear Programs (MILPs) are usually NP-hard mathematical programming problems, which present difficulties to obtain optimal solutions in a reasonable time for large scale models.
Martin Gonzalez +3 more
doaj +2 more sources
Taxonomy of Memory Usage in Swarm Intelligence-Based Metaheuristics
Metaheuristics under the swarm intelligence (SI) class have proven to be efficient and have become popular methods for solving different optimization problems. Based on the usage of memory, metaheuristics can be classified into algorithms with memory and
Yasear et al.
doaj +1 more source
On deciding when to stop metaheuristics: Properties, rules and termination conditions
Most metaheuristics lack a termination condition based on reasonable premises and guaranteeing the quality of the solution provided by the algorithm. We propose a methodological frame that distinguishes the concepts of properties of the final incumbent ...
Albert Corominas
doaj +1 more source
Analyzing the Effect of Objective Correlation on the Efficient Set of MNK-Landscapes [PDF]
In multiobjective combinatorial optimization, there exists two main classes of metaheuristics, based either on multiple aggregations, or on a dominance relation.
Dhaenens, Clarisse +3 more
core +6 more sources
Iterated-greedy-based algorithms with beam search initialization for the permutation flowshop to minimize total tardiness [PDF]
The permutation flow shop scheduling problem is one of the most studied operations research related problems. Literally, hundreds of exact and approximate algorithms have been proposed to optimise several objective functions. In this paper we address the
Fernández-Viagas Escudero, Víctor +2 more
core +1 more source

