opytimizer.optimizers.social.qsa¶
Queuing Search Algorithm.
A QSA class, inherited from Optimizer.
This is the designed class to define QSA-related variables and methods.
References
J. Zhang et al. Queuing search algorithm: A novel metaheuristic algorithm for solving engineering optimization problems. Applied Mathematical Modelling (2018).
Initialization method.
Parameters: params – Contains key-value parameters to the meta-heuristics.
Calculates the number of agents that belongs to each queue.
Parameters: - n_agents – Number of agents.
- t_1 – Fitness value of first agent in the population.
- t_2 – Fitness value of second agent in the population.
- t_3 – Fitness value of third agent in the population.
Returns: The number of agents in first, second and third queues.
Return type: (Tuple[int, int, int])
Performs the first business phase.
Parameters: - agents – List of agents.
- function – A Function object that will be used as the objective function.
- beta – Range of fluctuation.
Performs the second business phase.
Parameters: - agents – List of agents.
- function – A Function object that will be used as the objective function.
Performs the third business phase.
Parameters: - agents – List of agents.
- function – A Function object that will be used as the objective function.
Wraps Queue Search Algorithm over all agents and variables.
Parameters: - space – Space containing agents and update-related information.
- function – A Function object that will be used as the objective function.
- iteration – Current iteration.
- n_iterations – Maximum number of iterations.