IDEAS home Printed from https://ideas.repec.org/a/spr/orspec/v44y2022i1d10.1007_s00291-021-00650-z.html
   My bibliography  Save this article

Optimizing termination decision for meta-heuristic search techniques that converge to a static objective-value distribution

Author

Listed:
  • Ran Etgar

    (Faculty of Engineering)

  • Yuval Cohen

    (Afeka College for Engineering)

Abstract

This paper proposes a new technique for assisting search technique optimizers (most evolutionary, swarm, and bio-mimicry algorithms) to get an informed decision about terminating the heuristic search process. Current termination/stopping criteria are based on pre-determined thresholds that cannot guarantee the quality of the achieved solution or its proximity to the optimum. So, deciding when to stop is more an art than a science. This paper provides a statistical-based methodology to balance the risk of omitting a better solution and the expected computing effort. This methodology not only provides the strong science-based decision making but could also serve as a general tool to be embedded in various single-solution and population-based meta-heuristic studies and provide a cornerstone for further research aiming to provide better search terminating point criteria.

Suggested Citation

  • Ran Etgar & Yuval Cohen, 2022. "Optimizing termination decision for meta-heuristic search techniques that converge to a static objective-value distribution," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 44(1), pages 249-271, March.
  • Handle: RePEc:spr:orspec:v:44:y:2022:i:1:d:10.1007_s00291-021-00650-z
    DOI: 10.1007/s00291-021-00650-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00291-021-00650-z
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s00291-021-00650-z?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Tuyl, Frank & Gerlach, Richard & Mengersen, Kerrie, 2008. "A Comparison of BayesLaplace, Jeffreys, and Other Priors: The Case of Zero Events," The American Statistician, American Statistical Association, vol. 62, pages 40-44, February.
    2. Jianzhong Du & Joseph Y.-T. Leung, 1990. "Minimizing Total Tardiness on One Machine is NP-Hard," Mathematics of Operations Research, INFORMS, vol. 15(3), pages 483-495, August.
    3. Andreas C. Nearchou, 2018. "Multicriteria scheduling optimization using an elitist multiobjective population heuristic: the h-NSDE algorithm," Journal of Heuristics, Springer, vol. 24(6), pages 817-851, December.
    4. Francisco J. Solis & Roger J.-B. Wets, 1981. "Minimization by Random Search Techniques," Mathematics of Operations Research, INFORMS, vol. 6(1), pages 19-30, 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. Corominas, Albert, 2023. "On deciding when to stop metaheuristics: Properties, rules and termination conditions," Operations Research Perspectives, Elsevier, vol. 10(C).

    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. Enrique Gerstl & Gur Mosheiov, 2020. "Single machine scheduling to maximize the number of on-time jobs with generalized due-dates," Journal of Scheduling, Springer, vol. 23(3), pages 289-299, June.
    2. Shelley D. Dionne & Hiroki Sayama & Francis J. Yammarino, 2019. "Diversity and Social Network Structure in Collective Decision Making: Evolutionary Perspectives with Agent-Based Simulations," Complexity, Hindawi, vol. 2019, pages 1-16, March.
    3. Ricardo Navarro & Chyon Hae Kim, 2020. "Niching Multimodal Landscapes Faster Yet Effectively: VMO and HillVallEA Benefit Together," Mathematics, MDPI, vol. 8(5), pages 1-37, April.
    4. C. P. Stephens & W. Baritompa, 1998. "Global Optimization Requires Global Information," Journal of Optimization Theory and Applications, Springer, vol. 96(3), pages 575-588, March.
    5. Sesh Murthy & Rama Akkiraju & Richard Goodwin & Pinar Keskinocak & John Rachlin & Frederick Wu & James Yeh & Robert Fuhrer & Santhosh Kumaran & Alok Aggarwal & Martin Sturzenbecker & Ranga Jayaraman &, 1999. "Cooperative Multiobjective Decision Support for the Paper Industry," Interfaces, INFORMS, vol. 29(5), pages 5-30, October.
    6. Derya Deliktaş, 2022. "Self-adaptive memetic algorithms for multi-objective single machine learning-effect scheduling problems with release times," Flexible Services and Manufacturing Journal, Springer, vol. 34(3), pages 748-784, September.
    7. Baruch Mor & Gur Mosheiov & Dvir Shabtay, 2021. "Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates," Journal of Scheduling, Springer, vol. 24(6), pages 553-567, December.
    8. Camila Ramos & Alejandro Cataldo & Juan–Carlos Ferrer, 2020. "Appointment and patient scheduling in chemotherapy: a case study in Chilean hospitals," Annals of Operations Research, Springer, vol. 286(1), pages 411-439, March.
    9. J. Redondo & J. Fernández & I. García & P. Ortigosa, 2009. "A robust and efficient algorithm for planar competitive location problems," Annals of Operations Research, Springer, vol. 167(1), pages 87-105, March.
    10. Rubing Chen & Jinjiang Yuan, 2019. "Unary NP-hardness of single-machine scheduling to minimize the total tardiness with deadlines," Journal of Scheduling, Springer, vol. 22(5), pages 595-601, October.
    11. Quang Chieu Ta & Jean-Charles Billaut & Jean-Louis Bouquard, 2018. "Matheuristic algorithms for minimizing total tardiness in the m-machine flow-shop scheduling problem," Journal of Intelligent Manufacturing, Springer, vol. 29(3), pages 617-628, March.
    12. Regis, Rommel G., 2010. "Convergence guarantees for generalized adaptive stochastic search methods for continuous global optimization," European Journal of Operational Research, Elsevier, vol. 207(3), pages 1187-1202, December.
    13. E. A. Tsvetkov & R. A. Krymov, 2022. "Pure Random Search with Virtual Extension of Feasible Region," Journal of Optimization Theory and Applications, Springer, vol. 195(2), pages 575-595, November.
    14. Gerardo Minella & Rubén Ruiz & Michele Ciavotta, 2008. "A Review and Evaluation of Multiobjective Algorithms for the Flowshop Scheduling Problem," INFORMS Journal on Computing, INFORMS, vol. 20(3), pages 451-471, August.
    15. Evgeny Gafarov & Alexander Lazarev & Frank Werner, 2012. "Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one," Annals of Operations Research, Springer, vol. 196(1), pages 247-261, July.
    16. 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.
    17. Hvattum, Lars Magnus & Glover, Fred, 2009. "Finding local optima of high-dimensional functions using direct search methods," European Journal of Operational Research, Elsevier, vol. 195(1), pages 31-45, May.
    18. Maximilian Moser & Nysret Musliu & Andrea Schaerf & Felix Winter, 2022. "Exact and metaheuristic approaches for unrelated parallel machine scheduling," Journal of Scheduling, Springer, vol. 25(5), pages 507-534, October.
    19. Hongmin Li & Woonghee T. Huh & Matheus C. Sampaio & Naiping Keng, 2021. "Planning Production and Equipment Qualification under High Process Flexibility," Production and Operations Management, Production and Operations Management Society, vol. 30(10), pages 3369-3390, October.
    20. Rinnooy Kan, A. H. G. & Timmer, G. T., 1985. "Stochastic Global Optimization Methods Part I: Clustering Methods," Econometric Institute Archives 272329, Erasmus University Rotterdam.

    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:spr:orspec:v:44:y:2022:i:1:d:10.1007_s00291-021-00650-z. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.