Binary bat algorithm (BBA) is a binary version of the bat algorithm (BA). It has been proven that BBA is competitive compared to other binary heuristic algorithms. Since the update processes of velocity in the algorithm are consistent with BA, in some cases, this algorithm also faces the premature convergence problem. This paper proposes an improved binary bat algorithm (IBBA) to solve this pro...

psort is a fast, stable external sorting software available as a binary executable that can sort a disk file interpreted as a sequence of r byte records according to a key of k bytes starting from the i byte of each record. psort is also available under GPL as a C library, allowing one to define one’s own key comparison functions, as well as key preprocessing and postprocessing functions to inc...

Gravitational search algorithm (GSA) is a type of optimization algorithm based on the law of gravity and mass interactions, which is lacking of memory ability. To enhance particle memory ability and search accuracy of GSA, a modified GSA (MGSA) is developed. MGSA adopts the idea of local optimum solution and global optimum solution from particle swarm optimization (PSO) algorithm into GSA. Furt...

Purpose Following earlier claims that Quantum-inspired Evolutionary Algorithm (QIEA) may offer advantages in high dimensional environments, this paper tests a real-valued QIEA on a series of benchmark functions of varying dimensionality in order to examine its scalability within both static and dynamic environments. Design/Methodology/Approach – This study compares the performance of both the Q...

This paper proposes a new real-value mutation operator and a hybrid real-coded genetic algorithm with quasi-simplex technique using this new mutation operator (RCGAQS). Compared with the classical GA (CGA), RCGAQS has the following distinguish features: (1) A new real-value mutation mechanism was used to increase the capability of global search (exploration); (2) The modified simplex technique,...

This paper compares the complexity of three different fixed polarity generalizations of Reed-Muller canonical form to multiple-valued logic: the Galois Field-based expansion introduced by Green and Taylor, the Reed-MullerFourier form of Stanković and Moraga, and the expansion over addition modulo , minimum and the set of all literal operators introduced by the author and Muzio. An algorithm for...

Abstract: The following work outlines a robust method for accounting the fuzziness of the objective space while dealing with the real world optimization problems. Use of mean/approximated value of input parameters doesn't account for the variability in the optimized solution inherited due to variability in the input parameters which is very crucial, especially in real world problems. The follow...

Artificial Bee Colony (ABC) algorithm is a Nature Inspired Algorithm (NIA) which based in intelligent food foraging behaviour of honey bee swarm. ABC outperformed over other NIAs and other local search heuristics when tested for benchmark functions as well as factual world problems but occasionally it shows premature convergence and stagnation due to lack of balance between exploration and expl...