{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T18:03:24Z","timestamp":1778177004011,"version":"3.51.4"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T00:00:00Z","timestamp":1601510400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T00:00:00Z","timestamp":1601510400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2021,2]]},"DOI":"10.1007\/s00500-020-05303-x","type":"journal-article","created":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T06:04:03Z","timestamp":1601532243000},"page":"2325-2350","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Hybrid gradient simulated annealing algorithm for finding the global optimal of a nonlinear unconstrained optimization problem"],"prefix":"10.1007","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9634-6046","authenticated-orcid":false,"given":"M.","family":"EL-Alem","sequence":"first","affiliation":[]},{"given":"A.","family":"Aboutahoun","sequence":"additional","affiliation":[]},{"given":"S.","family":"Mahdi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,10,1]]},"reference":[{"issue":"10","key":"5303_CR1","doi-asserted-by":"publisher","first-page":"2661","DOI":"10.1016\/j.cam.2009.11.013","volume":"233","author":"MM Ali","year":"2010","unstructured":"Ali MM, Gabere M (2010) A simulated annealing driven multi-start algorithm for bound constrained global optimization. J Comput Appl Math 233(10):2661\u20132674","journal-title":"J Comput Appl Math"},{"key":"5303_CR2","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1007\/s10898-004-9972-2","volume":"31","author":"MM Ali","year":"2005","unstructured":"Ali MM, Khompatraporn C, Zabinsky ZB (2005) A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems. J Glob Optim 31:635\u2013672","journal-title":"J Glob Optim"},{"issue":"1","key":"5303_CR3","doi-asserted-by":"publisher","first-page":"187","DOI":"10.2140\/pjm.1966.16.1","volume":"16","author":"L Armijo","year":"1966","unstructured":"Armijo L (1966) Minimization of functions having Lipschitz continuous first-partial derivatives. Pac J Math 16(1):187\u2013192","journal-title":"Pac J Math"},{"key":"5303_CR4","doi-asserted-by":"crossref","unstructured":"Ayumi V, Rere L, Fanany MI, Arymurthy AM (2016) Optimization of convolutional neural network using microcanonical annealing algorithm. arXiv preprint arXiv:1610.02306","DOI":"10.1109\/ICACSIS.2016.7872787"},{"key":"5303_CR5","volume-title":"Nonlinear programming","author":"DP Bertsekas","year":"1999","unstructured":"Bertsekas DP (1999) Nonlinear programming. Athena Scientific, Belmont"},{"key":"5303_CR6","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/s00158-001-0166-y","volume":"23","author":"M Bessaou","year":"2001","unstructured":"Bessaou M, Siarry P (2001) A genetic algorithm with real-value coding to optimize multimodal continuous functions. Struct Multidisc Optim 23:63\u201374","journal-title":"Struct Multidisc Optim"},{"key":"5303_CR7","volume-title":"Numerical optimization: theoretical and practical aspects","author":"J-F Bonnans","year":"2006","unstructured":"Bonnans J-F, Gilbert JC, Lemar\u00e9chal C, Sagastiz\u00e1bal CA (2006) Numerical optimization: theoretical and practical aspects. Springer, Berlin"},{"key":"5303_CR8","doi-asserted-by":"publisher","first-page":"1065","DOI":"10.1016\/0098-1354(95)00221-9","volume":"20","author":"MF Cardoso","year":"1996","unstructured":"Cardoso MF, Salcedo RL, Azevedo SFD (1996) The simplex-simulated-annealing algorithm approach to continuous non-linear optimization. Comput Chem Eng 20:1065\u20131080","journal-title":"Comput Chem Eng"},{"issue":"6","key":"5303_CR9","doi-asserted-by":"publisher","first-page":"370","DOI":"10.3844\/ajassp.2015.370.381","volume":"12","author":"A Certa","year":"2015","unstructured":"Certa A, Lupo T, Passannanti G (2015) A new innovative cooling law for simulated annealing algorithms. Am J Appl Sci 12(6):370","journal-title":"Am J Appl Sci"},{"issue":"3","key":"5303_CR10","first-page":"2784","volume":"7","author":"S Chakraborti","year":"2015","unstructured":"Chakraborti S, Sanyal S (2015) An elitist simulated annealing algorithm for solving multi objective optimization problems in internet of things design. Int J Adv Netw Appl 7(3):2784","journal-title":"Int J Adv Netw Appl"},{"key":"5303_CR11","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/S0377-2217(99)00255-6","volume":"123","author":"R Chelouah","year":"2000","unstructured":"Chelouah R, Siarry P (2000) Tabu search applied to global optimization. Eur J Oper Res 123:256\u2013270","journal-title":"Eur J Oper Res"},{"key":"5303_CR12","doi-asserted-by":"crossref","unstructured":"Corana A, Marchesi M, Martini C, Ridella S (1987) Minimizing multimodal functions of continuous variables with the simulated annealing algorithm. ACM Trans Math Softw 13(3):262\u2013280","DOI":"10.1145\/29380.29864"},{"issue":"1","key":"5303_CR13","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/BF01594945","volume":"50","author":"A Dekkers","year":"1991","unstructured":"Dekkers A, Aarts E (1991) Global optimization and simulated annealing. Math Program 50(1):367\u2013393","journal-title":"Math Program"},{"key":"5303_CR14","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971200","volume-title":"Numerical methods for unconstrained optimization and nonlinear equations","author":"JE Dennis Jr","year":"1996","unstructured":"Dennis JE Jr, Schnabel RB (1996) Numerical methods for unconstrained optimization and nonlinear equations, vol 16. SIAM, Philadelphia"},{"issue":"3","key":"5303_CR15","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/BF02193057","volume":"85","author":"M El-Alem","year":"1995","unstructured":"El-Alem M, Tapia R (1995) Numerical experience with a polyhedral-norm cdt trust-region algorithm. J Optim Theory Appl 85(3):575\u2013591","journal-title":"J Optim Theory Appl"},{"key":"5303_CR16","unstructured":"EL-Alem M, Aboutahoun A, Mahdi S, (2019) Efficient modified simulated-annealing algorithm for finding the global minimizer of a nonlinear unconstrained optimization problem. Appl Math Inf Sci Int J 13:1\u201313"},{"issue":"2","key":"5303_CR17","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1016\/j.ejor.2006.06.034","volume":"181","author":"S-KS Fan","year":"2007","unstructured":"Fan S-KS, Zahara E (2007) A hybrid simplex search and particle swarm optimization for unconstrained optimization. Eur J Oper Res 181(2):527\u2013548","journal-title":"Eur J Oper Res"},{"issue":"10","key":"5303_CR18","doi-asserted-by":"publisher","first-page":"3301","DOI":"10.1016\/j.camwa.2010.03.014","volume":"59","author":"M Farid","year":"2010","unstructured":"Farid M, Leong WJ, Hassan MA (2010) A new two-step gradient-type method for large-scale unconstrained optimization. Comput Math Appl 59(10):3301\u20133307","journal-title":"Comput Math Appl"},{"key":"5303_CR19","volume-title":"Practical methods of optimization","author":"R Fletcher","year":"2013","unstructured":"Fletcher R (2013) Practical methods of optimization. Wiley, New York"},{"issue":"8","key":"5303_CR20","doi-asserted-by":"publisher","first-page":"11","DOI":"10.14808\/10.14808\/sci.plena.2015.081304","volume":"11","author":"GV Gonzales","year":"2015","unstructured":"Gonzales GV, dos Santos ED, Emmendorfer LR, Isoldi LA, Rocha LAO, Estrada EdSD (2015) A comparative study of simulated annealing with different cooling schedules for geometric optimization of a heat transfer problem according to constructal design. Sci Plena 11(8):11","journal-title":"Sci Plena"},{"issue":"2","key":"5303_CR21","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1016\/j.eswa.2014.07.034","volume":"42","author":"I Gosciniak","year":"2015","unstructured":"Gosciniak I (2015) A new approach to particle swarm optimization algorithm. Exp Syst Appl 42(2):844\u2013854","journal-title":"Exp Syst Appl"},{"issue":"12","key":"5303_CR22","first-page":"47","volume":"8","author":"Z Guodong","year":"2015","unstructured":"Guodong Z, Ying Z, Liya S (2015) Simulated annealing optimization bat algorithm in service migration joining the Gauss perturbation. Int J Hybrid Inf Technol 8(12):47\u201362","journal-title":"Int J Hybrid Inf Technol"},{"issue":"3","key":"5303_CR23","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/BF00932858","volume":"22","author":"S Han","year":"1977","unstructured":"Han S (1977) A globally convergent method for nonlinear programming. J Optim Theory Appl 22(3):297\u2013309","journal-title":"J Optim Theory Appl"},{"issue":"5","key":"5303_CR24","doi-asserted-by":"publisher","first-page":"891","DOI":"10.1080\/1055678021000030084","volume":"17","author":"A-R Hedar","year":"2002","unstructured":"Hedar A-R, Fukushima M (2002) Hybrid simulated annealing and direct search method for nonlinear unconstrained global optimization. Optim Methods Softw 17(5):891\u2013912","journal-title":"Optim Methods Softw"},{"key":"5303_CR25","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970920","volume-title":"Iterative methods for optimization","author":"CT Kelley","year":"1999","unstructured":"Kelley CT (1999) Iterative methods for optimization, vol 18. SIAM, Philadelphia"},{"issue":"2","key":"5303_CR26","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s10898-004-1936-z","volume":"33","author":"M Laguna","year":"2005","unstructured":"Laguna M, Mart\u00ed R (2005) Experimental testing of advanced scatter search designs for global optimization of multimodal functions. J Glob Optim 33(2):235\u2013255","journal-title":"J Glob Optim"},{"issue":"10","key":"5303_CR27","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1063\/1.1699114","volume":"21","author":"N Metropolis","year":"1953","unstructured":"Metropolis N, Rosenbluth AW, Rosenbluth MN, Teller AH, Teller E (1953) Equation of state calculations by fast computer machines. J Chem Phys 21(10):1087\u20131092","journal-title":"J Chem Phys"},{"issue":"3","key":"5303_CR28","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/s10589-006-8719-z","volume":"35","author":"Y Narushima","year":"2006","unstructured":"Narushima Y, Yabe H (2006) Global convergence of a memory gradient method for unconstrained optimization. Comput Optim Appl 35(3):325\u2013346","journal-title":"Comput Optim Appl"},{"key":"5303_CR29","volume-title":"Numerical optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal J, Wright S (2006) Numerical optimization. Springer, Berlin"},{"issue":"1","key":"5303_CR30","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10898-016-0485-6","volume":"71","author":"R Paulavi\u010dius","year":"2018","unstructured":"Paulavi\u010dius R, Chiter L, \u017dilinskas J (2018) Global optimization based on bisection of rectangles, function values at diagonals, and a set of Lipschitz constants. J Glob Optim 71(1):5\u201320","journal-title":"J Glob Optim"},{"issue":"3","key":"5303_CR31","doi-asserted-by":"publisher","first-page":"216","DOI":"10.7763\/IJET.2016.V6.888","volume":"8","author":"V Poorjafari","year":"2016","unstructured":"Poorjafari V, Yue WL, Holyoak N (2016) A comparison between genetic algorithms and simulated annealing for minimizing transfer waiting time in transit systems. Int J Eng Technol 8(3):216","journal-title":"Int J Eng Technol"},{"key":"5303_CR32","doi-asserted-by":"crossref","unstructured":"Rere LR, Fanany MI, Murni A (2014) Application of metaheuristic algorithms for optimal smartphone-photo enhancement. In: 2014 IEEE 3rd global conference on consumer electronics (GCCE). IEEE, pp 542\u2013546","DOI":"10.1109\/GCCE.2014.7031307"},{"key":"5303_CR33","first-page":"2016","volume":"13","author":"L Rere","year":"2016","unstructured":"Rere L, Fanany MI, Arymurthy AM (2016) Metaheuristic algorithms for convolution neural network. Comput Intell Neurosci 13:2016","journal-title":"Comput Intell Neurosci"},{"issue":"4","key":"5303_CR34","doi-asserted-by":"publisher","first-page":"1533","DOI":"10.1007\/s11269-016-1238-5","volume":"30","author":"I Samora","year":"2016","unstructured":"Samora I, Franca MJ, Schleiss AJ, Ramos HM (2016) Simulated annealing in optimization of energy production in a water supply network. Water Resour Manag 30(4):1533\u20131547","journal-title":"Water Resour Manag"},{"issue":"2","key":"5303_CR35","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1016\/j.cam.2003.10.025","volume":"170","author":"Z-J Shi","year":"2004","unstructured":"Shi Z-J, Shen J (2004) A gradient-related algorithm with inexact line searches. J Comput Appl Math 170(2):349\u2013370","journal-title":"J Comput Appl Math"},{"issue":"2","key":"5303_CR36","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1145\/264029.264043","volume":"23","author":"P Siarry","year":"1997","unstructured":"Siarry P, Berthiau G, Durbin F, Haussy J (1997) Enhanced simulated-annealing algorithm for globally minimizing functions of many continuous variables. ACM Trans Math Softw 23(2):209\u2013228","journal-title":"ACM Trans Math Softw"},{"key":"5303_CR37","doi-asserted-by":"publisher","first-page":"2988","DOI":"10.1016\/j.amc.2010.04.011","volume":"216","author":"IG Tsoulos","year":"2010","unstructured":"Tsoulos IG, Stavrakoudis A (2010) Enhancing PSO methods for global optimization. Appl Math Comput 216:2988\u20133001","journal-title":"Appl Math Comput"},{"issue":"2","key":"5303_CR38","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1016\/S0377-0427(99)00276-9","volume":"114","author":"MN Vrahatis","year":"2000","unstructured":"Vrahatis MN, Androulakis GS, Lambrinos J, Magoulas GD (2000) A class of gradient unconstrained minimization algorithms with adaptive stepsize. J Comput Appl Math 114(2):367\u2013386","journal-title":"J Comput Appl Math"},{"key":"5303_CR39","doi-asserted-by":"crossref","unstructured":"Wang G-G, Guo L, Gandomi AH, Alavi AH, Duan H (2013) Simulated annealing-based krill herd algorithm for global optimization. In: Abstract and applied analysis, volume 2013. Hindawi Publishing Corporation","DOI":"10.1155\/2013\/213853"},{"key":"5303_CR40","doi-asserted-by":"publisher","unstructured":"Wu J-Y (2013) Solving unconstrained global optimization problems via hybrid swarm intelligence approaches. Math Probl Eng. https:\/\/doi.org\/10.1155\/2013\/256180","DOI":"10.1155\/2013\/256180"},{"issue":"11","key":"5303_CR41","first-page":"677","volume":"9","author":"P Xu","year":"2015","unstructured":"Xu P, Sui S, Du Z (2015) Application of hybrid genetic algorithm based on simulated annealing in function optimization. World Acad Sci Eng Technol Int J Math Comput Phys Electr Comput Eng 9(11):677\u2013680","journal-title":"World Acad Sci Eng Technol Int J Math Comput Phys Electr Comput Eng"},{"issue":"2","key":"5303_CR42","doi-asserted-by":"publisher","first-page":"16","DOI":"10.22436\/jmcs.014.01.02","volume":"14","author":"H Yarmohamadi","year":"2015","unstructured":"Yarmohamadi H, Mirhosseini SH (2015) A new dynamic simulated annealing algorithm for global optimization. J Math Comput Sci 14(2):16\u201323","journal-title":"J Math Comput Sci"},{"issue":"2","key":"5303_CR43","first-page":"275","volume":"20","author":"S Zhenjun","year":"2003","unstructured":"Zhenjun S (2003) A new memory gradient method under exact line search. Asia-Pac J Oper Res 20(2):275\u2013284","journal-title":"Asia-Pac J Oper Res"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-020-05303-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-020-05303-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-020-05303-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,1]],"date-time":"2021-10-01T02:50:22Z","timestamp":1633056622000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-020-05303-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,1]]},"references-count":43,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,2]]}},"alternative-id":["5303"],"URL":"https:\/\/doi.org\/10.1007\/s00500-020-05303-x","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,10,1]]},"assertion":[{"value":"1 October 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}}]}}