Bacterial Foraging-Tabu Search Metaheuristics for Identification of Nonlinear Friction Model

<div class="floats-full-page floats-full-page-other"><h2>Algorithm 1</h2><div class="floats-full-page-caption"></div><div class="floats-full-page-content"><table><tr><td><table class="algorithm" id="alg1"><tr><td colspan="2"><b>BT:</b>  <b>if  </b><svg height="12.3" id="M68" style="vertical-align:-0.546pt" version="1.1" viewbox="0 0 49.887501 12.3" width="49.887501" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,11.55)"><use xlink:href="#x1D45B"></use></g><g transform="matrix(.017,-0,0,-.017,13.305,11.55)"><path d="M531 285l-474 -214v56l416 183l-416 184v56l474 -215v-50zM531 -40h-474v50h474v-50z" id="x2265"></path></g><g transform="matrix(.017,-0,0,-.017,28.008,11.55)"><path d="M594 511q0 -122 -171 -157l1 -2q158 -33 158 -159q0 -52 -34.5 -95t-90.5 -65q-76 -33 -217 -33h-223l8 28q63 5 79.5 19t26.5 72l83 426q9 48 -2.5 60t-77.5 17l6 28h259q195 0 195 -139zM499 509q0 59 -37 83t-91 24q-36 0 -51 -9q-17 -9 -22 -44l-35 -195h62&#10;q82 0 128 37t46 104zM481 199q0 71 -48 102.5t-121 31.5h-56l-37 -201q-11 -58 7.5 -77t80.5 -19q76 0 125 44.5t49 118.5z" id="x1D435"></path></g><g transform="matrix(.017,-0,0,-.017,38.497,11.55)"><path d="M649 676l-22 -187l-33 -2q3 56 -12 94q-8 20 -31.5 26.5t-86.5 6.5h-74l-90 -491q-4 -23 -6 -36.5t1 -25t7 -16.5t18 -9t27 -5t41 -3l-6 -28h-286l4 28q68 5 84 18.5t28 76.5l94 491h-55q-74 0 -100.5 -6t-41.5 -23q-24 -29 -54 -98l-32 1q32 98 53 188h22q7 -18 15 -22&#10;t37 -4h417q23 0 33.5 5t25.5 21h23z" id="x1D447"></path></g>
</svg></td></tr><tr><td colspan="2"> <i>  </i><svg height="11.125" id="M69" style="vertical-align:-0.1638pt" version="1.1" viewbox="0 0 62.299999 11.125" width="62.299999" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,10.862)"><use xlink:href="#x1D45B"></use></g><g transform="matrix(.017,-0,0,-.017,13.305,10.862)"><use xlink:href="#x3D"></use></g><g transform="matrix(.017,-0,0,-.017,28.008,10.862)"><use xlink:href="#x1D45B"></use></g><g transform="matrix(.017,-0,0,-.017,40.316,10.862)"><use xlink:href="#x2B"></use></g><g transform="matrix(.017,-0,0,-.017,54.068,10.862)"><use xlink:href="#x31"></use></g>
</svg></td></tr><tr><td colspan="2"> <i> best_error = RANK(TL) </i></td></tr><tr><td colspan="2">look back in the <i>TL,</i> then retrieve the <i>n_re_ </i><svg height="16.9625" id="M70" style="vertical-align:-0.16379pt" version="1.1" viewbox="0 0 42.5 16.9625" width="42.5" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,16.7)"><path d="M152 404l81 35q23 10 41 10q81 0 139 -61.5t58 -149.5q0 -107 -74.5 -178.5t-176.5 -71.5q-71 0 -147 36v555q0 48 -9.5 59.5t-56.5 15.5v23q79 10 145 35v-308zM152 374v-258q0 -20 6 -35q7 -19 30 -37t58 -18q63 0 99.5 50t36.5 137q0 82 -43.5 131t-108.5 49&#10;q-44 0 -78 -19z" id="x62"></path></g><g transform="matrix(.017,-0,0,-.017,8.766,16.7)"><use xlink:href="#x61"></use></g><g transform="matrix(.017,-0,0,-.017,16.228,16.7)"><use xlink:href="#x63"></use></g><g transform="matrix(.017,-0,0,-.017,23.334,16.7)"><path d="M513 0l-137 -2q-16 18 -164 198q-19 22 -31 22q-7 0 -16 -3v-111q0 -49 11.5 -61t60.5 -17v-26h-223v26q50 4 61.5 17t11.5 61v472q0 50 -10 61.5t-56 15.5v24q57 6 144 35v-471q37 7 63 35q31 31 71 88q16 23 10.5 31.5t-40.5 12.5v26l204 9v-25q-51 -8 -75 -19.5&#10;t-54 -39.5q-31 -31 -86 -95q13 -21 70 -87.5t85 -95.5q48 -52 100 -55v-26z" id="x6B"></path></g>
<g transform="matrix(.012,-0,0,-.012,31.762,8.537)"><use xlink:href="#x74"></use></g><g transform="matrix(.012,-0,0,-.012,35.463,8.537)"><path d="M513 0h-211v26q44 5 55 17t11 60v166q0 123 -98 123q-59 0 -104 -51v-238q0 -48 10 -60.5t55 -16.5v-26h-213l1 26q46 4 57 16t11 61v477q0 48 -9.5 58.5t-58.5 14.5v24q63 9 147 35v-336q73 73 143 73q64 0 101 -42t37 -129v-175q0 -49 11 -61t55 -16v-26z" id="x68"></path></g>
</svg> solution from the TL<i>. </i></td></tr><tr><td colspan="2"><b>else</b></td></tr><tr><td colspan="2"> <i>  </i><svg height="11.125" id="M71" style="vertical-align:-0.1638pt" version="1.1" viewbox="0 0 36.237499 11.125" width="36.237499" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,10.862)"><use xlink:href="#x1D45B"></use></g><g transform="matrix(.017,-0,0,-.017,13.305,10.862)"><use xlink:href="#x3D"></use></g><g transform="matrix(.017,-0,0,-.017,28.008,10.862)"><use xlink:href="#x30"></use></g>
</svg></td></tr><tr><td colspan="2">define <i>S<sub>0</sub> = best_neighbor </i></td></tr><tr><td colspan="2"> <i> best_error = best_error </i></td></tr><tr><td colspan="2"><b>end</b>  <b>if</b></td></tr></table></td></tr></table></div></div>

Algorithm 1 | Bacterial Foraging-Tabu Search Metaheuristics for Identification of Nonlinear Friction Model

title

Algorithm 1: Bacterial Foraging-Tabu Search Metaheuristics for Identification of Nonlinear Friction Model

description

Algorithm 1

About this journal

<p><em>Journal of Applied Mathematics</em> publishes original research papers and review articles in all areas of applied, computational, and industrial mathematics.</p>


Journal profile

Meet the editorial board

<p><em>Journal of Applied Mathematics</em> maintains an Editorial Board of practicing researchers from around the world, to ensure manuscripts are handled by editors who are experts in the field of study.</p>


Editor spotlight

Submit your proposal

Do you think there is an emerging area of research that really needs to be highlighted? Or an existing research area that has been overlooked or would benefit from deeper investigation? Raise the profile of a research area by leading a Special Issue.