IDEAS home Printed from https://ideas.repec.org/a/wly/jnljam/v2012y2012i1n238563.html

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

Author

Listed:
  • Nuapett Sarasiri
  • Kittiwong Suthamno
  • Sarawut Sujitjorn

Abstract

This paper proposes new metaheuristic algorithms for an identification problem of nonlinear friction model. The proposed cooperative algorithms are formed from the bacterial foraging optimization (BFO) algorithm and the tabu search (TS). The paper reports the search comparison studies of the BFO, the TS, the genetic algorithm (GA), and the proposed metaheuristics. Search performances are assessed by using surface optimization problems. The proposed algorithms show superiority among them. A real‐world identification problem of the Stribeck friction model parameters is presented. Experimental setup and results are elaborated.

Suggested Citation

  • Nuapett Sarasiri & Kittiwong Suthamno & Sarawut Sujitjorn, 2012. "Bacterial Foraging‐Tabu Search Metaheuristics for Identification of Nonlinear Friction Model," Journal of Applied Mathematics, John Wiley & Sons, vol. 2012(1).
    • Handle: RePEc:wly:jnljam:v:2012:y:2012:i:1:n:238563
    DOI: 10.1155/2012/238563
    as

    Download full text from publisher

    File URL: https://doi.org/10.1155/2012/238563
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2012/238563?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Roberto Battiti & Giampietro Tecchiolli, 1994. "The Reactive Tabu Search," INFORMS Journal on Computing, INFORMS, vol. 6(2), pages 126-140, May.
    2. Nowicki, Eugeniusz & Smutnicki, Czeslaw, 1996. "A fast tabu search algorithm for the permutation flow-shop problem," European Journal of Operational Research, Elsevier, vol. 91(1), pages 160-175, May.
    3. Fred Glover, 1990. "Tabu Search—Part II," INFORMS Journal on Computing, INFORMS, vol. 2(1), pages 4-32, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Gintaras Palubeckis, 2013. "An Improved Exact Algorithm for Least‐Squares Unidimensional Scaling," Journal of Applied Mathematics, John Wiley & Sons, vol. 2013(1).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Ying, Kuo-Ching & Pourhejazy, Pourya & Chen, Ming-Yen, 2026. "Evolutionary trajectories of Tabu Search in scheduling: A main path analysis–based retrospective over four decades," Operations Research Perspectives, Elsevier, vol. 16(C).
    2. Michel Gendreau & Jean-Yves Potvin, 2005. "Metaheuristics in Combinatorial Optimization," Annals of Operations Research, Springer, vol. 140(1), pages 189-213, November.
    3. Masahiko Sugimura & Keiichiro Yamamura & Hiroki Ishikura & Akihiro Yoshida & Ken Kawano & Matthieu Parizy & Katsuki Fujisawa, 2026. "Automated Tabu Tenure Tuning by Trajectory Metrics for Quadratic Unconstrained Binary Optimization," Journal of Heuristics, Springer, vol. 32(1), pages 1-52, March.
    4. C N Potts & V A Strusevich, 2009. "Fifty years of scheduling: a survey of milestones," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 41-68, May.
    5. Anuj Mehrotra & Joseph Shantz & Michael A. Trick, 2005. "Determining newspaper marketing zones using contiguous clustering," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(1), pages 82-92, February.
    6. Shen, Liji & Buscher, Udo, 2012. "Solving the serial batching problem in job shop manufacturing systems," European Journal of Operational Research, Elsevier, vol. 221(1), pages 14-26.
    7. Mohammad Javad Feizollahi & Igor Averbakh, 2014. "The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows," INFORMS Journal on Computing, INFORMS, vol. 26(2), pages 321-335, May.
    8. Nha Vo‐Thanh & Hans‐Peter Piepho, 2023. "Generating designs for comparative experiments with two blocking factors," Biometrics, The International Biometric Society, vol. 79(4), pages 3574-3585, December.
    9. Yang, Zhaoqi & Tanaka, Shunji & Lin, Bertrand M.T., 2026. "Talent scheduling with daily working capacity and scene changeover times," Omega, Elsevier, vol. 138(C).
    10. Buscher, Udo & Shen, Liji, 2009. "An integrated tabu search algorithm for the lot streaming problem in job shops," European Journal of Operational Research, Elsevier, vol. 199(2), pages 385-399, December.
    11. Luca Maria Gambardella & Marco Dorigo, 2000. "An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem," INFORMS Journal on Computing, INFORMS, vol. 12(3), pages 237-255, August.
    12. Cazzaro, Davide & Fischetti, Martina & Fischetti, Matteo, 2020. "Heuristic algorithms for the Wind Farm Cable Routing problem," Applied Energy, Elsevier, vol. 278(C).
    13. Huang, Yeran & Yang, Lixing & Tang, Tao & Gao, Ziyou & Cao, Fang, 2017. "Joint train scheduling optimization with service quality and energy efficiency in urban rail transit networks," Energy, Elsevier, vol. 138(C), pages 1124-1147.
    14. B Dengiz & C Alabas-Uslu & O Dengiz, 2009. "Optimization of manufacturing systems using a neural network metamodel with a new training approach," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(9), pages 1191-1197, September.
    15. Mohammad Hassan Salmani & Kourosh Eshghi, 2017. "A Metaheuristic Algorithm Based on Chemotherapy Science: CSA," Journal of Optimization, Hindawi, vol. 2017, pages 1-13, February.
    16. S-W Lin & K-C Ying, 2008. "A hybrid approach for single-machine tardiness problems with sequence-dependent setup times," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(8), pages 1109-1119, August.
    17. Joseph B. Mazzola & Robert H. Schantz, 1997. "Multiple‐facility loading under capacity‐based economies of scope," Naval Research Logistics (NRL), John Wiley & Sons, vol. 44(3), pages 229-256, April.
    18. Abdmouleh, Zeineb & Gastli, Adel & Ben-Brahim, Lazhar & Haouari, Mohamed & Al-Emadi, Nasser Ahmed, 2017. "Review of optimization techniques applied for the integration of distributed generation from renewable energy sources," Renewable Energy, Elsevier, vol. 113(C), pages 266-280.
    19. Oleksandra Yezerska & Sergiy Butenko & Vladimir L. Boginski, 2018. "Detecting robust cliques in graphs subject to uncertain edge failures," Annals of Operations Research, Springer, vol. 262(1), pages 109-132, March.
    20. Masoud Yaghini & Mohammad Karimi & Mohadeseh Rahbar, 2015. "A set covering approach for multi-depot train driver scheduling," Journal of Combinatorial Optimization, Springer, vol. 29(3), pages 636-654, April.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wly:jnljam:v:2012:y:2012:i:1:n:238563. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: https://onlinelibrary.wiley.com/journal/4185 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.