Royal Crown Optimization (RCO) Algorithm

sphere function is tested

Explanation of the Code

1. Initialization: Agents are randomly distributed within the search space, and their initial fitness values are computed.
2. Roles and Hierarchy:

• King: Represents the best solution found so far.
• Nobles: Make small adjustments around the King's position to refine the search.
• Knights: Explore new regions to ensure diversity and avoid getting trapped in local optima.

1. Iteration: The algorithm iteratively updates the Nobles and Knights and checks if a better King (solution) has been found.
2. Termination: The loop runs until the maximum number of iterations is reached, or if no significant improvement is observed.