Source code for NiaPy.algorithms.modified.hba

# encoding=utf8
import logging

from NiaPy.algorithms.basic import BatAlgorithm
from NiaPy.algorithms.basic.de import CrossBest1

logging.basicConfig()
logger = logging.getLogger('NiaPy.algorithms.modified')
logger.setLevel('INFO')

__all__ = ['HybridBatAlgorithm']

[docs]class HybridBatAlgorithm(BatAlgorithm): r"""Implementation of Hybrid bat algorithm. Algorithm: Hybrid bat algorithm Date: 2018 Author: Grega Vrbancic and Klemen Berkovič License: MIT Reference paper: Fister Jr., Iztok and Fister, Dusan and Yang, Xin-She. "A Hybrid Bat Algorithm". Elektrotehniski vestnik, 2013. 1-7. Attributes: Name (List[str]): List of strings representing algorithm name. F (float): Scaling factor. CR (float): Crossover. See Also: * :class:`NiaPy.algorithms.basic.BatAlgorithm` """ Name = ['HybridBatAlgorithm', 'HBA']
[docs] @staticmethod def algorithmInfo(): r"""Get basic information about the algorithm. Returns: str: Basic information. See Also: * :func:`NiaPy.algorithms.Algorithm.algorithmInfo` """ return r"""Fister Jr., Iztok and Fister, Dusan and Yang, Xin-She. "A Hybrid Bat Algorithm". Elektrotehniski vestnik, 2013. 1-7."""
[docs] @staticmethod def typeParameters(): r"""Get dictionary with functions for checking values of parameters. Returns: Dict[str, Callable]: * F (Callable[[Union[int, float]], bool]): Scaling factor. * CR (Callable[[float], bool]): Crossover probability. See Also: * :func:`NiaPy.algorithms.basic.BatAlgorithm.typeParameters` """ d = BatAlgorithm.typeParameters() d.update({ 'F': lambda x: isinstance(x, (int, float)) and x > 0, 'CR': lambda x: isinstance(x, float) and 0 <= x <= 1 }) return d
[docs] def setParameters(self, F=0.50, CR=0.90, CrossMutt=CrossBest1, **ukwargs): r"""Set core parameters of HybridBatAlgorithm algorithm. Arguments: F (Optional[float]): Scaling factor. CR (Optional[float]): Crossover. See Also: * :func:`NiaPy.algorithms.basic.BatAlgorithm.setParameters` """ BatAlgorithm.setParameters(self, **ukwargs) self.F, self.CR, self.CrossMutt = F, CR, CrossMutt
[docs] def localSearch(self, best, task, i, Sol, **kwargs): r"""Improve the best solution. Args: best (numpy.ndarray): Global best individual. task (Task): Optimization task. i (int): Index of current individual. Sol (numpy.ndarray): Current best population. **kwargs (Dict[str, Any]): Returns: numpy.ndarray: New solution based on global best individual. """ return task.repair(self.CrossMutt(Sol, i, best, self.F, self.CR, rnd=self.Rand), rnd=self.Rand)
# vim: tabstop=3 noexpandtab shiftwidth=3 softtabstop=3