IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v318y2018icp245-259.html
   My bibliography  Save this article

Metaheuristic vs. deterministic global optimization algorithms: The univariate case

Author

Listed:
  • Kvasov, Dmitri E.
  • Mukhametzhanov, Marat S.

Abstract

Many practical problems involve the search for the global extremum in the space of the system parameters. The functions to be optimized are often highly multiextremal, black-box with unknown analytical representations, and hard to evaluate even in the case of one parameter to be adjusted in the presence of non-linear constraints. The interest of both the stochastic (in particular, metaheuristic) and mathematical programming (in particular, deterministic) communities to the comparison of metaheuristic and deterministic classes of methods is well recognized. Although both the communities have a huge number of journal and proceedings papers, a few of them are really dedicated to a systematic comparison of the methods belonging to these two classes. This paper meets the requirement of such a comparison between nature-inspired metaheuristic and deterministic algorithms (more than 125,000 launches of the methods have been performed) and presents an attempt (beneficial to practical fields including engineering design) to bring together two rather disjoint communities of metaheuristic and mathematical programming researchers and applied users.

Suggested Citation

  • Kvasov, Dmitri E. & Mukhametzhanov, Marat S., 2018. "Metaheuristic vs. deterministic global optimization algorithms: The univariate case," Applied Mathematics and Computation, Elsevier, vol. 318(C), pages 245-259.
    • Handle: RePEc:eee:apmaco:v:318:y:2018:i:c:p:245-259
    DOI: 10.1016/j.amc.2017.05.014
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300317303028
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2017.05.014?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. Konstantin Barkalov & Victor Gergel, 2016. "Parallel global optimization on GPU," Journal of Global Optimization, Springer, vol. 66(1), pages 3-20, September.
    2. Giampaolo Liuzzi & Stefano Lucidi & Veronica Piccialli, 2010. "A partition-based global optimization algorithm," Journal of Global Optimization, Springer, vol. 48(1), pages 113-128, September.
    3. Antanas Žilinskas, 2010. "On similarities between two models of global optimization: statistical models and radial basis functions," Journal of Global Optimization, Springer, vol. 48(1), pages 173-182, September.
    4. Luis Rios & Nikolaos Sahinidis, 2013. "Derivative-free optimization: a review of algorithms and comparison of software implementations," Journal of Global Optimization, Springer, vol. 56(3), pages 1247-1293, July.
    5. Remigijus Paulavičius & Yaroslav Sergeyev & Dmitri Kvasov & Julius Žilinskas, 2014. "Globally-biased Disimpl algorithm for expensive global optimization," Journal of Global Optimization, Springer, vol. 59(2), pages 545-567, July.
    6. Yaroslav D. Sergeyev & Marat S. Mukhametzhanov & Dmitri E. Kvasov & Daniela Lera, 2016. "Derivative-Free Local Tuning and Local Improvement Techniques Embedded in the Univariate Global Optimization," Journal of Optimization Theory and Applications, Springer, vol. 171(1), pages 186-208, October.
    7. Garg, Harish, 2016. "A hybrid PSO-GA algorithm for constrained optimization problems," Applied Mathematics and Computation, Elsevier, vol. 274(C), pages 292-305.
    8. Sergeyev, Yaroslav D. & Kvasov, Dmitri E. & Mukhametzhanov, Marat S., 2017. "Operational zones for comparing metaheuristic and deterministic one-dimensional global optimization algorithms," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 141(C), pages 96-109.
    9. Anatoly Zhigljavsky & Antanas Žilinskas, 2008. "Stochastic Global Optimization," Springer Optimization and Its Applications, Springer, number 978-0-387-74740-8, June.
    10. Yaroslav D. Sergeyev & Dmitri E. Kvasov & Marat S. Mukhametzhanov, 2016. "On the Least-Squares Fitting of Data by Sinusoids," Springer Optimization and Its Applications, in: Panos M. Pardalos & Anatoly Zhigljavsky & Julius Žilinskas (ed.), Advances in Stochastic and Deterministic Global Optimization, pages 209-226, Springer.
    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. Hassan M. Hussein Farh, 2024. "Neural Network Algorithm with Reinforcement Learning for Microgrid Techno-Economic Optimization," Mathematics, MDPI, vol. 12(2), pages 1-24, January.
    2. Yong Wang & Kunzhao Wang & Gaige Wang, 2022. "Neural Network Algorithm with Dropout Using Elite Selection," Mathematics, MDPI, vol. 10(11), pages 1-17, May.
    3. Konstantin Barkalov & Irek Gubaydullin & Evgeny Kozinov & Ilya Lebedev & Roza Faskhutdinova & Azamat Faskhutdinov & Leniza Enikeeva, 2022. "On Solving the Problem of Finding Kinetic Parameters of Catalytic Isomerization of the Pentane-Hexane Fraction Using a Parallel Global Search Algorithm," Mathematics, MDPI, vol. 10(19), pages 1-13, October.
    4. Umesh Balande & Deepti Shrimankar, 2019. "SRIFA: Stochastic Ranking with Improved-Firefly-Algorithm for Constrained Optimization Engineering Design Problems," Mathematics, MDPI, vol. 7(3), pages 1-26, March.
    5. Konstantin Barkalov & Ilya Lebedev & Marina Usova & Daria Romanova & Daniil Ryazanov & Sergei Strijhak, 2022. "Optimization of Turbulence Model Parameters Using the Global Search Method Combined with Machine Learning," Mathematics, MDPI, vol. 10(15), pages 1-20, July.
    6. R. Cavoretto & A. Rossi & M. S. Mukhametzhanov & Ya. D. Sergeyev, 2021. "On the search of the shape parameter in radial basis functions using univariate global optimization methods," Journal of Global Optimization, Springer, vol. 79(2), pages 305-327, February.
    7. Linas Stripinis & Remigijus Paulavičius, 2023. "Novel Algorithm for Linearly Constrained Derivative Free Global Optimization of Lipschitz Functions," Mathematics, MDPI, vol. 11(13), pages 1-19, June.
    8. Juan Li & Dan-dan Xiao & Hong Lei & Ting Zhang & Tian Tian, 2020. "Using Cuckoo Search Algorithm with Q -Learning and Genetic Operation to Solve the Problem of Logistics Distribution Center Location," Mathematics, MDPI, vol. 8(2), pages 1-32, January.
    9. Yan Liang & Xianzhi Hu & Gang Hu & Wanting Dou, 2022. "An Enhanced Northern Goshawk Optimization Algorithm and Its Application in Practical Optimization Problems," Mathematics, MDPI, vol. 10(22), pages 1-33, November.
    10. Ziadi, Raouf & Bencherif-Madani, Abdelatif & Ellaia, Rachid, 2020. "A deterministic method for continuous global optimization using a dense curve," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 178(C), pages 62-91.
    11. Jannatul Ferdous & Farid Bensebaa & Abbas S. Milani & Kasun Hewage & Pankaj Bhowmik & Nathan Pelletier, 2024. "Development of a Generic Decision Tree for the Integration of Multi-Criteria Decision-Making (MCDM) and Multi-Objective Optimization (MOO) Methods under Uncertainty to Facilitate Sustainability Assess," Sustainability, MDPI, vol. 16(7), pages 1-21, March.
    12. Sergey S. Ketkov & Oleg A. Prokopyev & Lisa M. Maillart, 2023. "Planning of life-depleting preventive maintenance activities with replacements," Annals of Operations Research, Springer, vol. 324(1), pages 1461-1483, May.

    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. Daniela Lera & Yaroslav D. Sergeyev, 2018. "GOSH: derivative-free global optimization using multi-dimensional space-filling curves," Journal of Global Optimization, Springer, vol. 71(1), pages 193-211, May.
    2. R. Cavoretto & A. Rossi & M. S. Mukhametzhanov & Ya. D. Sergeyev, 2021. "On the search of the shape parameter in radial basis functions using univariate global optimization methods," Journal of Global Optimization, Springer, vol. 79(2), pages 305-327, February.
    3. Grishagin, Vladimir & Israfilov, Ruslan & Sergeyev, Yaroslav, 2018. "Convergence conditions and numerical comparison of global optimization methods based on dimensionality reduction schemes," Applied Mathematics and Computation, Elsevier, vol. 318(C), pages 270-280.
    4. Sergeyev, Yaroslav D. & Kvasov, Dmitri E. & Mukhametzhanov, Marat S., 2017. "Operational zones for comparing metaheuristic and deterministic one-dimensional global optimization algorithms," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 141(C), pages 96-109.
    5. Yaroslav D. Sergeyev & Marat S. Mukhametzhanov & Dmitri E. Kvasov & Daniela Lera, 2016. "Derivative-Free Local Tuning and Local Improvement Techniques Embedded in the Univariate Global Optimization," Journal of Optimization Theory and Applications, Springer, vol. 171(1), pages 186-208, October.
    6. Albertas Gimbutas & Antanas Žilinskas, 2018. "An algorithm of simplicial Lipschitz optimization with the bi-criteria selection of simplices for the bi-section," Journal of Global Optimization, Springer, vol. 71(1), pages 115-127, May.
    7. Remigijus Paulavičius & Lakhdar Chiter & Julius Žilinskas, 2018. "Global optimization based on bisection of rectangles, function values at diagonals, and a set of Lipschitz constants," Journal of Global Optimization, Springer, vol. 71(1), pages 5-20, May.
    8. G. Liuzzi & S. Lucidi & V. Piccialli, 2016. "Exploiting derivative-free local searches in DIRECT-type algorithms for global optimization," Computational Optimization and Applications, Springer, vol. 65(2), pages 449-475, November.
    9. Konstantin Barkalov & Roman Strongin, 2018. "Solving a set of global optimization problems by the parallel technique with uniform convergence," Journal of Global Optimization, Springer, vol. 71(1), pages 21-36, May.
    10. E. F. Campana & M. Diez & G. Liuzzi & S. Lucidi & R. Pellegrini & V. Piccialli & F. Rinaldi & A. Serani, 2018. "A multi-objective DIRECT algorithm for ship hull optimization," Computational Optimization and Applications, Springer, vol. 71(1), pages 53-72, September.
    11. Jonas Mockus & Remigijus Paulavičius & Dainius Rusakevičius & Dmitrij Šešok & Julius Žilinskas, 2017. "Application of Reduced-set Pareto-Lipschitzian Optimization to truss optimization," Journal of Global Optimization, Springer, vol. 67(1), pages 425-450, January.
    12. Ferreiro-Ferreiro, Ana M. & García-Rodríguez, José A. & Souto, Luis & Vázquez, Carlos, 2019. "Basin Hopping with synched multi L-BFGS local searches. Parallel implementation in multi-CPU and GPUs," Applied Mathematics and Computation, Elsevier, vol. 356(C), pages 282-298.
    13. Qunfeng Liu & Guang Yang & Zhongzhi Zhang & Jinping Zeng, 2017. "Improving the convergence rate of the DIRECT global optimization algorithm," Journal of Global Optimization, Springer, vol. 67(4), pages 851-872, April.
    14. Remigijus Paulavičius & Julius Žilinskas, 2014. "Simplicial Lipschitz optimization without the Lipschitz constant," Journal of Global Optimization, Springer, vol. 59(1), pages 23-40, May.
    15. Kristian Sabo & Rudolf Scitovski & Šime Ungar & Zoran Tomljanović, 2024. "A method for searching for a globally optimal k-partition of higher-dimensional datasets," Journal of Global Optimization, Springer, vol. 89(3), pages 633-653, July.
    16. Dawid Tarłowski, 2017. "On the convergence rate issues of general Markov search for global minimum," Journal of Global Optimization, Springer, vol. 69(4), pages 869-888, December.
    17. Lera, Daniela & Posypkin, Mikhail & Sergeyev, Yaroslav D., 2021. "Space-filling curves for numerical approximation and visualization of solutions to systems of nonlinear inequalities with applications in robotics," Applied Mathematics and Computation, Elsevier, vol. 390(C).
    18. Qunfeng Liu & Jinping Zeng & Gang Yang, 2015. "MrDIRECT: a multilevel robust DIRECT algorithm for global optimization problems," Journal of Global Optimization, Springer, vol. 62(2), pages 205-227, June.
    19. Stripinis, Linas & Žilinskas, Julius & Casado, Leocadio G. & Paulavičius, Remigijus, 2021. "On MATLAB experience in accelerating DIRECT-GLce algorithm for constrained global optimization through dynamic data structures and parallelization," Applied Mathematics and Computation, Elsevier, vol. 390(C).
    20. Linas Stripinis & Remigijus Paulavičius, 2023. "Novel Algorithm for Linearly Constrained Derivative Free Global Optimization of Lipschitz Functions," Mathematics, MDPI, vol. 11(13), pages 1-19, June.

    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:eee:apmaco:v:318:y:2018:i:c:p:245-259. 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: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    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.