A comprehensive survey: artificial bee colony (ABC) algorithm and applications

D Karaboga, B Gorkemli, C Ozturk… - Artificial intelligence …, 2014 - Springer
Swarm intelligence (SI) is briefly defined as the collective behaviour of decentralized and
self-organized swarms. The well known examples for these swarms are bird flocks, fish …

[PDF][PDF] Swarm intelligence optimization: editorial survey

EA Mishra, MN Das, TC Panda - International Journal of Emerging …, 2013 - Citeseer
This paper surveys the intersection of two fascinating and increasingly popular domains:
swarm intelligence and optimization. Whereas optimization has been popular academic …

Chemical reaction optimization for solving shortest common supersequence problem

CMK Saifullah, MR Islam - Computational biology and chemistry, 2016 - Elsevier
Shortest common supersequence (SCS) is a classical NP-hard problem, where a string to
be constructed that is the supersequence of a given string set. The SCS problem has an …

A state-of-the-art review of artificial bee colony in the optimization of single and multiple criteria

BSP Mishra, S Dehuri, GN Wang - International Journal of Applied …, 2013 - igi-global.com
Nowadays computers are used to solve a variety and multitude of complex problems facing
in every sphere of peoples' life. However, many of the problems are intractable in nature …

An opposition-based learning CRO algorithm for solving the shortest common supersequence problem

F Luo, C Chen, J Fuentes, Y Li, W Ding - Entropy, 2022 - mdpi.com
As a non-deterministic polynomial hard (NP-hard) problem, the shortest common
supersequence (SCS) problem is normally solved by heuristic or metaheuristic algorithms …

Solving shortest common supersequence problem using chemical reaction optimization

CMK Saifullah, MR Islam - 2016 5th International Conference …, 2016 - ieeexplore.ieee.org
The Shortest Common Supersequence problem is an NP-hard optimization problem that
has a vast use in real world problems. It is used in data compression and different bio …

A Deterministic Heuristic Algorithm to Minimize the Length of a Manufacturing Line in Transformation of Jobshops into Flowshops

J Krishnaraj - Emerging Frontiers in Operations and Supply Chain …, 2021 - Springer
This research paper focuses on the development of a deterministic heuristic algorithm for
solving the problem of transforming jobshops into flowshops with the aim of minimizing a …

A recursive algorithm for generalized constraint scs problem

K Mangal, R Kumar - National Academy Science Letters, 2016 - Springer
In this paper a constraint shortest common supersequence problem, ie the string including
constraint shortest common supersequence problem was considered. Shortest common …

An improved chemical reaction optimization algorithm for solving the shortest common supersequence problem

F Luo, C Chen, J Fuentes - Computational Biology and Chemistry, 2020 - Elsevier
The shortest common supersequence (SCS) problem is a classical NP-hard problem, which
is normally solved by heuristic algorithms. One important heuristic that is inspired by the …

[PDF][PDF] International Journal of Computer Engineering & Technology (ijcet)

S Kumaraswamy, SH Manjula, KR Venugopal… - Journal Impact …, 2013 - researchgate.net
Cryptographic approaches are traditional and preferred methodologies used to preserve the
privacy of data released for analysis. Privacy Preserving Data Mining (PPDM) is a new trend …