Rider optimization algorithm

Rider Optimization Algorithm (ROA)Developed by| Binu D[1]

|

Category| Metaheuristics[2][circular reference]
Year of development| 2019[1]
Publisher| IEEE[1]
Language| Matlab[3]
Citation count| 49[4]

The rider optimization algorithm (ROA)[1][5][6] is devised based on a novel computing method, namely fictional computing that undergoes series of process to solve the issues of optimizations using imaginary facts and notions. ROA relies on the groups of rider that struggle to reach the target. ROA employs rider groups that take a trip to reach common target in order to become winner. In ROA, the count of groups is four wherein equal riders are placed.

The four groups adapted in ROA are attacker, overtaker, follower, and bypass rider. Each group undergoes series of strategy to attain the target. The goal of bypass rider is to attain target by bypassing leader's path. The follower tries to follow the position of leader in axis. Furthermore, the follower employs multidirectional search space considering leading rider, which is useful for algorithm as it improves convergence rate. The overtaker undergoes its own position to attain target considering nearby locations of leader. The benefit of overtaker is that it facilitates faster convergence with huge global neighbourhood. As per ROA, the global optimal convergence is function of overtaker, whose position relies on the position of the leader, success rate, and directional indicator. The attacker adapts position of leader to accomplish destination by using its utmost speed. Moreover, it is responsible for initializing the multidirectional search using fast search for accelerating search speed.

Despite the riders undergoes a specific method, the major factors employed for reaching the target are correct riding of vehicles and proper management of accelerator, steering, brake and gear. At each time instance, the riders alter its position towards target by regulating these factors and follow the prescribed method using current success rate. The leader is defined using the success rate at current instance. The process is repeated till the riders go into off time that is maximal instant provided to riders to attain intended location. After reaching off time, the rider at leading position is termed winner.

## Algorithm[edit]

The ROA[1][5][6] is motivated from riders, who contend to reach anticipated location. The steps employed in ROA algorithm are defined below:

### Initialization of Rider and other algorithmic parameters[edit]

The foremost step is the initialization of algorithm which is done using four groups of riders represented as  V {\displaystyle V} , and initializations of its positions are performed in arbitrary manner. The initialization of group is given by,

S l = { S l ( v , k ) } ; 1 ≤ v ≤ P , 1 ≤ k ≤ W {\displaystyle S_{l}=\\{S_{l}(v,k)\\};1\leq v\leq P,1\leq k\leq W}

|
|

(1)

where,  P {\displaystyle P} signifies count of riders, and  S l ( v , k ) {\displaystyle S_{l}(v,k)} signifies position of  v t h {\displaystyle v^{th}} rider in  k t h {\displaystyle k^{th}} size at  l t h {\displaystyle l^{th}} time instant.

The count of riders is evaluated with count of riders of each group and is expressed as,

P = B + J + O + A + K {\textstyle P=B+J+O+A+K}

|
|

(2)

where,  B {\displaystyle B} signifies bypass rider,  J {\displaystyle J} represent follower,  O {\displaystyle O} signifies overtaker,  A {\displaystyle A} represent attacker, and  K {\displaystyle K} signifies rag bull rider. Hence, the relation amongst the aforementioned attributes is represented as,

B + J + O + A + K = P 5 {\textstyle B+J+O+A+K={\frac {P}{5}}}

|
|

(3)

### Finding rate of success[edit]

After rider group parameters initialization, the rate of success considering each rider is evaluated. The rate of success is computed with distance and is measured between rider location and target and is formulated as,

S u c c e s s r a t e = 1 ‖ S v − l t ‖ {\textstyle Successrate={\frac {1}{\|S_{v}-l_{t}\|}}}

|
|

(4)

where, S v {\displaystyle S_{v}} symbolize position of  v t h {\displaystyle v^{th}} rider and  l t {\displaystyle l_{t}} indicate target position. To elevate rate of success, distance must be minimized and hence, distance reciprocal offers the success rate of rider.

### Determination of leading rider[edit]

The rate of success is employed as significant part in discovering leader. The rider that reside in near target location is supposed to contain highest rate of success.

### Evaluate the rider’s update position[edit]

The position of rider in each group is updated to discover rider at leading position and hence is winner. Thus, the rider update the position using the features of each rider defined on the definition. The update position of each rider is explained below:

The follower has an inclination to update position based on location of leading rider to attain target in quick manner and is expressed as,

S l + 1 f ( v , o ) = S G ( G , o ) + [ c o s ( φ v , o l ∗ S G ( G , o ) ∗ ∂ v l ) ] {\displaystyle S_{l+1}^{f}(v,o)=S^{G}(G,o)+[cos(\varphi _{v,o}^{l}*S^{G}(G,o)*\partial _{v}^{l})]}

|
|

(5)

where,  o {\displaystyle o} signifies coordinate selector,  S G {\displaystyle S^{G}} represent leading rider position,  G {\displaystyle G} indicate leader's index,  φ v , o l {\displaystyle \varphi _{v,o}^{l}} signifies angle of steering considering  v t h {\displaystyle v^{th}} rider in  o t h {\displaystyle o^{th}} coordinate, and  ∂ v l {\displaystyle \partial _{v}^{l}} represent distance.

The overtaker's update position is utilized to elevate rate of success by discovering overtaker position and is represented as,

S l + 1 o ( v , o ) = S l ( v , o ) + [ D l ∗ ( v ) ∗ S G ( G , o ) ] {\displaystyle S_{l+1}^{o}(v,o)=S_{l}(v,o)+[D_{l}^{*}{\bigl (}v{\bigr )}*S^{G}(G,o)]}

|
|

(6)

where,  D l ∗ ( v ) {\displaystyle D_{l}^{*}{\bigl (}v{\bigr )}} signifies direction indicator.

The attacker contains an inclination to confiscate the leaders position by following the leader's update process and is expressed as,

S l + 1 a ( v , ρ ) = S G ( G , ρ ) + [ c o s φ v , ρ l ∗ S G ( G , ρ ) ] + ∂ v l {\displaystyle S_{l+1}^{a}(v,\rho )=S^{G}(G,\rho )+[cos\varphi _{v,\rho }^{l}*S^{G}(G,\rho )]+\partial _{v}^{l}}

|
|

(7)

Here, the update rule of bypass riders is exhibited wherein standard bypass rider is expressed as,

S l + 1 b ( v , ρ ) = λ [ S l ( χ , ρ ) ∗ δ ( ρ ) + S l ( ξ , ρ ) ∗ [ 1 − δ ( ρ ) ] ] {\displaystyle S_{l+1}^{b}(v,\rho )=\lambda [S_{l}(\chi ,\rho )*\delta (\rho )+S_{l}(\xi ,\rho )*[1-\delta (\rho )]]}

|
|

(8)

where,  λ {\displaystyle \lambda } signifies random number,  χ {\displaystyle \chi } symbolize random number between 1 and  P {\displaystyle P} ,  ξ {\displaystyle \xi } indicate a random number ranging between 1 and  P {\displaystyle P} and  δ {\displaystyle \delta } represent random number between 0 and 1.

### Finding success rate[edit]

After executing process of update, the rate of success considering each rider is computed.

### Update of Rider parameter[edit]

The parameter of rider's update is important to discover an effective solution. Moreover, the steering angle, gears are updated with activity counter, and are updated with success rate.

### Off time of rider[edit]

The procedure is iterated repeatedly till  L O F F {\displaystyle L_{OFF}} wherein, leader is discovered. After race completion, the leading rider is considered as winner.

algorithm rider-optimization is
input: Arbitrary rider position

{\displaystyle S_{l}}

iteration

{\displaystyle l}

maximum iteration

{\displaystyle L}

output: Leading rider

{\displaystyle S^{G}}

Initialize solution set
Initialize other parameter of rider.
Find rate of success using equation (4)

while

{\displaystyle l<L_{OFF}}

for

{\displaystyle v=1toP}

Update position of follower using equation (5)
Update position of overtaker with equation (6)
Update position of attacker with equation (7)
Update position of bypass rider with equation (8)
Rank the riders based on success rate using equation (4)
Select the rider with  high success rate
Update rider parameters
Return

{\displaystyle S^{G}}

{\displaystyle l=l+1}

## Applications[edit]

The applications of ROA are noticed in several domains that involve: Engineering Design Optimization Problems,[7] Diabetic retinopathy detection,[8] Document clustering,[9] Plant disease detection,[10] Attack Detection,[11] Enhanced Video Super Resolution,[12] Clustering,[13] Webpages Re-ranking,[14] Task scheduling,[15] Medical Image Compression,[16] Resource allocation,[17] and multihop routing[18]

## References[edit]

1. ^ a b c d e Binu D and Kariyappa BS (2019). "RideNN: A new rider optimization algorithm based neural network for fault diagnosis of analog circuits". IEEE Transactions on Instrumentation & Measurement. 68 (1): 2–26. Bibcode:2019ITIM...68....2B. doi:10.1109/TIM.2018.2836058. S2CID 54459927.
2. ^ "Metaheuristic". Wikipedia.
3. ^ Binu, D. "Rider Optimization Algorithm". MathWorks.
4. ^ Binu, D. "GoogleScholar".
5. ^ a b Binu D and Kariyappa BS (2020). "Multi-Rider Optimization-based Neural Network for Fault Isolation in Analog Circuits". Journal of Circuits, Systems and Computers. 30 (3). doi:10.1142/S0218126621500481. S2CID 219914332.
6. ^ a b Binu D and Kariyappa BS (2020). "Rider Deep LSTM Network for Hybrid Distance Score-based Fault Prediction in Analog Circuits". IEEE Transactions on Industrial Electronics. 68 (10): 1. doi:10.1109/TIE.2020.3028796. S2CID 226439786.
7. ^ Wang G., Yuan Y. and Guo W (2019). "An Improved Rider Optimization Algorithm for solving Engineering Optimization Problems". IEEE Access. 7: 80570–80576. doi:10.1109/ACCESS.2019.2923468. S2CID 195775696.
8. ^ Jadhav AS., Patil PB. and Biradar S (2020). "Optimal feature selection-based diabetic retinopathy detection using improved rider optimization algorithm enabled with deep learning". Evolutionary Intelligence: 1–18.
9. ^ Yarlagadda M., Rao KG. and Srikrishna A (2019). "Frequent itemset-based feature selection and Rider Moth Search Algorithm for document clustering". Journal of King Saud University-Computer and Information Sciences. 34 (4): 1098–1109. doi:10.1016/j.jksuci.2019.09.002.
10. ^ Cristin R., Kumar BS., Priya C and Karthick K (2020). "Deep neural network based Rider-Cuckoo Search Algorithm for plant disease detection". Artificial Intelligence Review: 1–26.`{{cite journal}}`: CS1 maint: multiple names: authors list (link)
11. ^ Sarma, S.K (2020). "Rider Optimization based Optimized Deep-CNN towards Attack Detection in IoT". In Proceedings of 4th International Conference on Intelligent Computing and Control Systems (ICICCS): 163–169.
12. ^ Jagdale RH and Shah SK (2020). "Modified Rider Optimization-based V Channel Magnification for Enhanced Video Super Resolution". International Journal of Image and Graphics. 21. doi:10.1142/S0219467821500030. S2CID 225249612.
13. ^ Poluru RK and Ramasamy LK (2020). "Optimal cluster head selection using modified rider assisted clustering for IoT". IET Communications. 14 (13): 2189–2201. doi:10.1049/iet-com.2020.0236. S2CID 219455360.
14. ^ Sankpal LJ and Patil SH (2020). "Rider-Rank Algorithm-Based Feature Extraction for Re-ranking the Webpages in the Search Engine". The Computer Journal. 63 (10): 1479–1489. doi:10.1093/comjnl/bxaa032.
15. ^ Alameen A and Gupta A (2020). "Fitness rate-based rider optimization enabled for optimal task scheduling in cloud". Information Security Journal: A Global Perspective. 29 (6): 1–17. doi:10.1080/19393555.2020.1769780. S2CID 220846722.
16. ^ Sreenivasulu P and Varadharajan S (2020). "Algorithmic Analysis on Medical Image Compression Using Improved Rider Optimization Algorithm". Innovations in Computer Science and Engineering. Lecture Notes in Networks and Systems. Vol. 103\. Springer. pp. 267–274. doi:10.1007/978-981-15-2043-3_32. ISBN 978-981-15-2042-6. S2CID 215911629.
17. ^ Vhatkar KN and Bhole GP (2020). "Improved rider optimization for optimal container resource allocation in cloud with security assurance". International Journal of Pervasive Computing and Communications. 16 (3): 235–258. doi:10.1108/IJPCC-12-2019-0094. S2CID 220687409.
18. ^ Augustine S and Ananth JP (2020). "A modified rider optimization algorithm for multihop routing in WSN". International Journal of Numerical Modelling: Electronic Networks, Devices and Fields: 2764.

* v
* t
* e

Optimization: Algorithms, methods, and heuristics

Unconstrained nonlinear

| Functions|

* Golden-section search
* Interpolation methods
* Line search
* Nelder–Mead method
* Successive parabolic interpolation

|

Gradients|

| Convergence|

* Trust region
* Wolfe conditions

|

Quasi–Newton|

* Berndt–Hall–Hall–Hausman
* Broyden–Fletcher–Goldfarb–Shanno and L-BFGS
* Davidon–Fletcher–Powell
* Symmetric rank-one (SR1)

Other methods|

* Conjugate gradient
* Gauss–Newton
* Gradient
* Mirror
* Levenberg–Marquardt
* Powell's dog leg method
* Truncated Newton

Hessians|

* Newton's method

Optimization computes maxima and minima.

Constrained nonlinear

| General|

* Barrier methods
* Penalty methods

|

Differentiable|

* Augmented Lagrangian methods
* Sequential quadratic programming
* Successive linear programming

Convex optimization

| Convex
minimization|

* Cutting-plane method
* Reduced gradient (Frank–Wolfe)
* Subgradient method

|

Linear and
quadratic|

| Interior point|

* Affine scaling
* Ellipsoid algorithm of Khachiyan
* Projective algorithm of Karmarkar

|

Basis-exchange|

* Simplex algorithm of Dantzig
* Revised simplex algorithm
* Criss-cross algorithm
* Principal pivoting algorithm of Lemke

Combinatorial

| Paradigms|

* Approximation algorithm
* Dynamic programming
* Greedy algorithm
* Integer programming
* Branch and bound/cut

|

Graph
algorithms|

| Minimum
spanning tree|

* Borůvka
* Prim
* Kruskal

|

Shortest path|

* Bellman–Ford
* SPFA
* Dijkstra
* Floyd–Warshall

|

Network flows|

* Dinic
* Edmonds–Karp
* Ford–Fulkerson
* Push–relabel maximum flow

Metaheuristics

* Evolutionary algorithm
* Hill climbing
* Local search
* Parallel metaheuristics
* Simulated annealing
* Spiral optimization algorithm
* Tabu search

* Software

*[v]: View this template
*[t]: Discuss this template
*[e]: Edit this template