IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v54y2006i1p99-114.html
   My bibliography  Save this article

Fine-Tuning of Algorithms Using Fractional Experimental Designs and Local Search

Author

Listed:
  • Belarmino Adenso-Díaz

    (Escuela Superior de Ingenieros Industriales, Campus de Viesques, Universidad de Oviedo, 33204-Gijón, Spain)

  • Manuel Laguna

    (Leeds School of Business, University of Colorado, Boulder, Colorado 80309-0419)

Abstract

Researchers and practitioners frequently spend more time fine-tuning algorithms than designing and implementing them. This is particularly true when developing heuristics and metaheuristics, where the “right” choice of values for search parameters has a considerable effect on the performance of the procedure. When testing metaheuristics, performance typically is measured considering both the quality of the solutions obtained and the time needed to find them. In this paper, we describe the development of CALIBRA, a procedure that attempts to find the best values for up to five search parameters associated with a procedure under study. Because CALIBRA uses Taguchi’s fractional factorial experimental designs coupled with a local search procedure, the best values found are not guaranteed to be optimal. We test CALIBRA on six existing heuristic-based procedures. These experiments show that CALIBRA is able to find parameter values that either match or improve the performance of the procedures resulting from using the parameter values suggested by their developers. The latest version of CALIBRA can be downloaded for free from the website that appears in the online supplement of this paper at http://or.pubs.informs.org/Pages.collect.html.

Suggested Citation

  • Belarmino Adenso-Díaz & Manuel Laguna, 2006. "Fine-Tuning of Algorithms Using Fractional Experimental Designs and Local Search," Operations Research, INFORMS, vol. 54(1), pages 99-114, February.
    • Handle: RePEc:inm:oropre:v:54:y:2006:i:1:p:99-114
    DOI: 10.1287/opre.1050.0243
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.1050.0243
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.1050.0243?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. Beasley, J. E., 1992. "A heuristic for Euclidean and rectilinear Steiner problems," European Journal of Operational Research, Elsevier, vol. 58(2), pages 284-292, April.
    2. S Lozano & B Adenso-Díaz & I Eguia & L Onieva, 1999. "A one-step tabu search algorithm for manufacturing cell design," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 50(5), pages 509-516, May.
    3. Harvey J. Greenberg, 1990. "Computational Testing: Why, How and How Much," INFORMS Journal on Computing, INFORMS, vol. 2(1), pages 94-97, February.
    4. Mohammad M. Amini & Richard S. Barr, 1993. "Network Reoptimization Algorithms: A Statistically Designed Comparison," INFORMS Journal on Computing, INFORMS, vol. 5(4), pages 395-409, November.
    5. Manuel Laguna & Fred Glover, 1993. "Bandwidth Packing: A Tabu Search Approach," Management Science, INFORMS, vol. 39(4), pages 492-500, April.
    6. Mohammad M. Amini & Michael Racer, 1994. "A Rigorous Computational Comparison of Alternative Solution Methods for the Generalized Assignment Problem," Management Science, INFORMS, vol. 40(7), pages 868-890, July.
    7. Van Breedam, Alex, 1995. "Improvement heuristics for the Vehicle Routing Problem based on simulated annealing," European Journal of Operational Research, Elsevier, vol. 86(3), pages 480-490, November.
    8. Singh, N., 1993. "Design of cellular manufacturing systems: An invited review," European Journal of Operational Research, Elsevier, vol. 69(3), pages 284-291, September.
    Full references (including those not matched with items on IDEAS)

    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. Marie Coffin & Matthew J. Saltzman, 2000. "Statistical Analysis of Computational Tests of Algorithms and Heuristics," INFORMS Journal on Computing, INFORMS, vol. 12(1), pages 24-44, February.
    2. Marins, Fernando A. S. & Senne, Edson L. F. & Darby-Dowman, Ken & Machado, Arlene F. & Perin, Clovis, 1997. "Algorithms for network piecewise-linear programs: A comparative study," European Journal of Operational Research, Elsevier, vol. 97(1), pages 183-199, February.
    3. Nicholas G. Hall & Marc E. Posner, 2001. "Generating Experimental Data for Computational Testing with Machine Scheduling Applications," Operations Research, INFORMS, vol. 49(6), pages 854-865, December.
    4. Papaioannou, Grammatoula & Wilson, John M., 2010. "The evolution of cell formation problem methodologies based on recent studies (1997-2008): Review and directions for future research," European Journal of Operational Research, Elsevier, vol. 206(3), pages 509-521, November.
    5. Antonio Frangioni & Antonio Manca, 2006. "A Computational Study of Cost Reoptimization for Min-Cost Flow Problems," INFORMS Journal on Computing, INFORMS, vol. 18(1), pages 61-70, February.
    6. Schmitt, Lawrence J. & Amini, Mohammad M., 1998. "Performance characteristics of alternative genetic algorithmic approaches to the traveling salesman problem using path representation: An empirical study," European Journal of Operational Research, Elsevier, vol. 108(3), pages 551-570, August.
    7. Yin, Yong & Yasuda, Kazuhiko, 2006. "Similarity coefficient methods applied to the cell formation problem: A taxonomy and review," International Journal of Production Economics, Elsevier, vol. 101(2), pages 329-352, June.
    8. Benjamin G. Thengvall & Shane N. Hall & Michael P. Deskevich, 2025. "Measuring the effectiveness and efficiency of simulation optimization metaheuristic algorithms," Journal of Heuristics, Springer, vol. 31(1), pages 1-21, March.
    9. Gong, Manlin & Hu, Yucong & Chen, Zhiwei & Li, Xiaopeng, 2021. "Transfer-based customized modular bus system design with passenger-route assignment optimization," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 153(C).
    10. Vidyarthi, Navneet & Jayaswal, Sachin & Chetty, Vikranth Babu Tirumala, 2013. "Exact Solution to Bandwidth Packing Problem with Queuing Delays," IIMA Working Papers WP2013-11-04, Indian Institute of Management Ahmedabad, Research and Publication Department.
    11. Chen, Ja-Shen & Heragu, Sunderesh S., 1999. "Stepwise decomposition approaches for large scale cell formation problems," European Journal of Operational Research, Elsevier, vol. 113(1), pages 64-79, February.
    12. Kafle, Nabin & Zou, Bo & Lin, Jane, 2017. "Design and modeling of a crowdsource-enabled system for urban parcel relay and delivery," Transportation Research Part B: Methodological, Elsevier, vol. 99(C), pages 62-82.
    13. 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.
    14. Baldacci, R. & Dell'Amico, M., 2010. "Heuristic algorithms for the multi-depot ring-star problem," European Journal of Operational Research, Elsevier, vol. 203(1), pages 270-281, May.
    15. Du, Mingyang & Cheng, Lin & Li, Xuefeng & Tang, Fang, 2020. "Static rebalancing optimization with considering the collection of malfunctioning bikes in free-floating bike sharing system," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 141(C).
    16. Mastrolilli, Monaldo & Bianchi, Leonora, 2005. "Core instances for testing: A case study," European Journal of Operational Research, Elsevier, vol. 166(1), pages 51-62, October.
    17. Heragu, Sunderesh S. & Chen, Ja-Shen, 1998. "Optimal solution of cellular manufacturing system design: Benders' decomposition approach," European Journal of Operational Research, Elsevier, vol. 107(1), pages 175-192, May.
    18. Yang, Miin-Shen & Yang, Jenn-Hwai, 2008. "Machine-part cell formation in group technology using a modified ART1 method," European Journal of Operational Research, Elsevier, vol. 188(1), pages 140-152, July.
    19. Plaquin, Marie-France & Pierreval, Henri, 2000. "Cell formation using evolutionary algorithms with certain constraints," International Journal of Production Economics, Elsevier, vol. 64(1-3), pages 267-278, March.
    20. Ahuja, Ravindra K., 1956- & Orlin, James B., 1953-, 1992. "Use of representative operation counts in computational testings of algorithms," Working papers 3459-92., Massachusetts Institute of Technology (MIT), Sloan School of Management.

    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:inm:oropre:v:54:y:2006:i:1:p:99-114. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.