{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T01:20:18Z","timestamp":1773883218344,"version":"3.50.1"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,10,12]],"date-time":"2020-10-12T00:00:00Z","timestamp":1602460800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,10,12]],"date-time":"2020-10-12T00:00:00Z","timestamp":1602460800000},"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":["Optim Lett"],"published-print":{"date-parts":[[2022,1]]},"DOI":"10.1007\/s11590-020-01649-1","type":"journal-article","created":{"date-parts":[[2020,10,12]],"date-time":"2020-10-12T09:02:58Z","timestamp":1602493378000},"page":"191-210","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Variable neighborhood programming for symbolic regression"],"prefix":"10.1007","volume":"16","author":[{"given":"Souhir","family":"Elleuch","sequence":"first","affiliation":[]},{"given":"Bassem","family":"Jarboui","sequence":"additional","affiliation":[]},{"given":"Nenad","family":"Mladenovic","sequence":"additional","affiliation":[]},{"given":"Jun","family":"Pei","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,10,12]]},"reference":[{"key":"1649_CR1","volume-title":"Genetic Programming: On the Programming of Computers by Means of Natural Selection","author":"JR Koza","year":"1992","unstructured":"Koza, J.R.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge (1992)"},{"key":"1649_CR2","volume-title":"Genetic Programming II: Automatic Discovery of Reusable Programs","author":"JR Koza","year":"1994","unstructured":"Koza, J.R.: Genetic Programming II: Automatic Discovery of Reusable Programs. MIT Press, Cambridge (1994)"},{"issue":"23\u201324","key":"1649_CR3","doi-asserted-by":"publisher","first-page":"4352","DOI":"10.1016\/j.ijheatmasstransfer.2006.04.029","volume":"49","author":"W Cai","year":"2006","unstructured":"Cai, W., Pacheco-Vega, A., Sen, M., Yang, K.: Heat transfer correlations by symbolic regression. Int. J. Heat Mass Transf. 49(23\u201324), 4352 (2006)","journal-title":"Int. J. Heat Mass Transf."},{"issue":"8","key":"1649_CR4","doi-asserted-by":"publisher","first-page":"1761","DOI":"10.1016\/j.patcog.2011.01.017","volume":"44","author":"M Galar","year":"2011","unstructured":"Galar, M., Fern\u00e1ndez, A., Barrenechea, E., Bustince, H., Herrera, F.: An overview of ensemble methods for binary classifiers in multi-class problems: experimental study on one-vs-one and one-vs-all schemes. Pattern Recognit. 44(8), 1761 (2011)","journal-title":"Pattern Recognit."},{"key":"1649_CR5","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/j.neucom.2013.01.024","volume":"117","author":"S Bouaziz","year":"2013","unstructured":"Bouaziz, S., Dhahri, H., Alimi, A.M., Abraham, A.: A hybrid learning algorithm for evolving flexible beta basis function neural tree model. Neurocomputing 117, 107 (2013)","journal-title":"Neurocomputing"},{"key":"1649_CR6","doi-asserted-by":"publisher","first-page":"971908","DOI":"10.1155\/2015\/971908","volume":"2015","author":"M Castelli","year":"2015","unstructured":"Castelli, M., Trujillo, L., Vanneschi, L.: Energy consumption forecasting using semantic-based genetic programming with local search optimizer. Comput. Intell. Neurosci. 2015, 971908 (2015)","journal-title":"Comput. Intell. Neurosci."},{"key":"1649_CR7","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1016\/j.neucom.2013.12.048","volume":"133","author":"M De Arruda Pereira","year":"2014","unstructured":"De Arruda Pereira, M., Davis J\u00fanior, C.A., Gontijo Carrano, E., De Vasconcelos, J.A.A.: A niching genetic programming-based multi-objective algorithm for hybrid data classification. Neurocomputing 133, 342 (2014)","journal-title":"Neurocomputing"},{"key":"1649_CR8","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.ins.2012.05.008","volume":"212","author":"WJ Choi","year":"2012","unstructured":"Choi, W.J., Choi, T.S.: Genetic programming-based feature transform and classification for the automatic detection of pulmonary nodules on computed tomography images. Inf. Sci. 212, 57 (2012)","journal-title":"Inf. Sci."},{"key":"1649_CR9","doi-asserted-by":"crossref","unstructured":"Lane, F., Azad, R., Ryan, C.: On effective and inexpensive local search techniques in genetic programming regression. In: Parallel Problem Solving from Nature: PPSN XIII. Lecture Notes in Computer Science, vol. 8672. Springer (2014)","DOI":"10.1007\/978-3-319-10762-2_44"},{"issue":"1","key":"1649_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TCYB.2014.2317488","volume":"45","author":"S Nguyen","year":"2015","unstructured":"Nguyen, S., Zhang, M., Johnston, M., Tan, K.C.: Automatic programming via iterated local search for dynamic job shop scheduling. IEEE Trans. Cybern. 45(1), 1 (2015)","journal-title":"IEEE Trans. Cybern."},{"issue":"11","key":"1649_CR11","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24(11), 1097 (1997)","journal-title":"Comput. Oper. Res."},{"key":"1649_CR12","unstructured":"Elleuch, S., Jarboui, B., Mladenovic, N.: Variable neighborhood programming: a new automatic programming method in artificial intelligence. Technical report, G-2016-92, GERAD, Montreal (2016)"},{"key":"1649_CR13","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.endm.2017.03.025","volume":"58","author":"S Elleuch","year":"2017","unstructured":"Elleuch, S., Hansen, P., Jarboui, B., Mladenovi\u0107, N.: New VNP for automatic programming. Electron. Notes Discrete Math. 58, 191\u2013198 (2017)","journal-title":"Electron. Notes Discrete Math."},{"issue":"1","key":"1649_CR14","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1016\/j.ejor.2015.12.041","volume":"252","author":"B Ghaddar","year":"2016","unstructured":"Ghaddar, B., Sakr, N., Asiedu, Y.: Spare parts stocking analysis using genetic programming. Eur. J. Oper. Res. 252(1), 136 (2016)","journal-title":"Eur. J. Oper. Res."},{"key":"1649_CR15","first-page":"3585","volume":"13","author":"DL Ly","year":"2012","unstructured":"Ly, D.L., Lipson, H.: Learning symbolic representations of hybrid dynamical systems. J. Mach. Learn. Res. 13, 3585 (2012)","journal-title":"J. Mach. Learn. Res."},{"key":"1649_CR16","doi-asserted-by":"crossref","unstructured":"Deklel, A.K., Saleh, M.A., Hamdy, A.M., Saad, E.M.: Transfer learning with long term artificial neural network memory (LTANN-MEM) and neural symbolization algorithm (NSA) for solving high dimensional multi-objective symbolic regression problems. In: 2017 34th National Radio Science Conference (NRSC), pp. 343\u2013352. IEEE (2017)","DOI":"10.1109\/NRSC.2017.7893495"},{"key":"1649_CR17","doi-asserted-by":"crossref","unstructured":"Arnaldo, I., Krawiec, K., O\u2019Reilly, U.M.: Multiple regression genetic programming. In: Proceedings of the 2014 Conference on Genetic and Evolutionary Computation: GECCO \u201914, pp. 879\u2013886. ACM Press, New York (2014)","DOI":"10.1145\/2576768.2598291"},{"key":"1649_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ins.2012.05.002","volume":"209","author":"D Karaboga","year":"2012","unstructured":"Karaboga, D., Ozturk, C., Karaboga, N., Gorkemli, B.: Artificial bee colony programming for symbolic regression. Inf. Sci. 209, 1 (2012)","journal-title":"Inf. Sci."},{"issue":"2","key":"1649_CR19","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10710-010-9121-2","volume":"12","author":"NQ Uy","year":"2011","unstructured":"Uy, N.Q., Hoai, N.X., O\u2019Neill, M., McKay, R.I., Galv\u00e1n-L\u00f3pez, E.: Semantically-based crossover in genetic programming: application to real-valued symbolic regression. Genet. Program. Evol. Mach. 12(2), 91 (2011)","journal-title":"Genet. Program. Evol. Mach."},{"key":"1649_CR20","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/j.neucom.2013.05.062","volume":"137","author":"Y Peng","year":"2014","unstructured":"Peng, Y., Yuan, C., Qin, X., Huang, J., Shi, Y.: An improved gene expression programming approach for symbolic regression problems. Neurocomputing 137, 293 (2014)","journal-title":"Neurocomputing"},{"key":"1649_CR21","doi-asserted-by":"crossref","unstructured":"Icke, I., Bongard, J.C.: Improving genetic programming based symbolic regression using deterministic machine learning. In: 2013 IEEE Congress on Evolutionary Computation, pp. 1763\u20131770. IEEE (2013)","DOI":"10.1109\/CEC.2013.6557774"},{"key":"1649_CR22","unstructured":"Rad, H.I., Feng, J., Iba, H.: GP-RVM: genetic programming-based symbolic regression using relevance vector machine. arXiv:1806.02502v (2018)"},{"key":"1649_CR23","doi-asserted-by":"crossref","unstructured":"Mladenovi\u0107, N., Uro\u0161evi\u0107, D.: Variable neighborhood search for the K-cardinality tree. In: Metaheuristics: Computer Decision-Making, Applied Optimization. Springer, Boston (2003)","DOI":"10.1007\/978-1-4757-4137-7_23"},{"issue":"3","key":"1649_CR24","doi-asserted-by":"publisher","first-page":"1140","DOI":"10.1109\/TVLSI.2016.2607758","volume":"25","author":"C Hao","year":"2017","unstructured":"Hao, C., Ni, J., Wang, N., Yoshimura, T.: Interconnection allocation between functional units and registers in high-level synthesis. IEEE Trans. Very Large Scale Integr. (VLSI) Syst. 25(3), 1140 (2017)","journal-title":"IEEE Trans. Very Large Scale Integr. (VLSI) Syst."},{"key":"1649_CR25","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/j.ins.2016.12.021","volume":"382\u2013383","author":"J Brimberg","year":"2017","unstructured":"Brimberg, J., Mladenovi\u0107, N., Todosijevi\u0107, R., Uro\u0161evi\u0107, D.: Less is more: solving the max-mean diversity problem with variable neighborhood search. Inf. Sci. 382\u2013383, 179 (2017)","journal-title":"Inf. Sci."},{"key":"1649_CR26","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/j.ins.2017.06.019","volume":"415\u2013416","author":"LR Costa","year":"2017","unstructured":"Costa, L.R., Aloise, D., Mladenovi\u0107, N.: Less is more: basic variable neighborhood search heuristic for balanced minimum sum-of-squares clustering. Inf. Sci. 415\u2013416, 247 (2017)","journal-title":"Inf. Sci."},{"key":"1649_CR27","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1016\/j.ins.2015.07.044","volume":"326","author":"N Mladenovi\u0107","year":"2016","unstructured":"Mladenovi\u0107, N., Todosijevi\u0107, R., Uro\u0161evi\u0107, D.: Less is more: basic variable neighborhood search for minimum differential dispersion problem. Inf. Sci. 326, 160 (2016)","journal-title":"Inf. Sci."},{"key":"1649_CR28","doi-asserted-by":"crossref","unstructured":"Concalves-de Silva, K., Aloise, D., Xavier-de Souza, S., Mladenovic, N.: Less is more: Simplified Nelder-Mead method for large unconstrained optimization, Yugoslav J. Oper. Res. 28 (2), 153\u2013169 (2018)","DOI":"10.2298\/YJOR180120014G"},{"key":"1649_CR29","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1111\/itor.12646","volume":"27","author":"N Mladenovi\u0107","year":"2019","unstructured":"Mladenovi\u0107, N., Alkandari, A., Pei, J., Todosijevi\u0107, R., Pardalos, P.M.: Less is more approach: basic variable neighborhood search for the obnoxious p-median problem. Int. Trans. Oper. Res. 27, 480\u2013493 (2019)","journal-title":"Int. Trans. Oper. Res."},{"issue":"2","key":"1649_CR30","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/BF01849318","volume":"17","author":"U Stadtm\u00fcller","year":"1986","unstructured":"Stadtm\u00fcller, U.: Asymptotic properties of nonparametric curve estimates. Period. Math. Hung. 17(2), 83 (1986)","journal-title":"Period. Math. Hung."},{"issue":"1","key":"1649_CR31","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1111\/1467-9469.00136","volume":"26","author":"BM Brown","year":"1999","unstructured":"Brown, B.M., Chen, S.X.: Beta-Bernstein smoothing for regression curves with compact support. Scand. J. Stat. 26(1), 47 (1999)","journal-title":"Scand. J. Stat."},{"issue":"1","key":"1649_CR32","first-page":"1","volume":"19","author":"JH Friedman","year":"1991","unstructured":"Friedman, J.H.: Multivariate adaptive regression splines. Ann. Stat. 19(1), 1 (1991)","journal-title":"Ann. Stat."},{"key":"1649_CR33","volume-title":"A Practical Guide to Splines: With 32 Figures","author":"C De Boor","year":"2001","unstructured":"De Boor, C.: A Practical Guide to Splines: With 32 Figures. Springer, Berlin (2001)"},{"key":"1649_CR34","doi-asserted-by":"crossref","unstructured":"Hoai, N., McKay, R., Essam, D., Chau, R.: Solving the symbolic regression problem with tree-adjunct grammar guided genetic programming: the comparative results. In: Proceedings of the 2002 Congress on Evolutionary Computation. CEC\u201902 (Cat. No.02TH8600), vol.\u00a02, pp. 1326\u20131331. IEEE (2002)","DOI":"10.1109\/CEC.2002.1004435"},{"key":"1649_CR35","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-642-01181-8_9","volume-title":"Genetic Programming Crossover: Does It Cross over?","author":"CG Johnson","year":"2009","unstructured":"Johnson, C.G.: Genetic Programming Crossover: Does It Cross over?, pp. 97\u2013108. Springer, Berlin (2009)"},{"key":"1649_CR36","first-page":"70","volume-title":"Improving Symbolic Regression with Interval Arithmetic and Linear Scaling","author":"M Keijzer","year":"2003","unstructured":"Keijzer, M.: Improving Symbolic Regression with Interval Arithmetic and Linear Scaling, pp. 70\u201382. Springer, Berlin (2003)"},{"key":"1649_CR37","doi-asserted-by":"crossref","unstructured":"Hoang, T.H., Essam, D., McKay, B., Hoai, N.X.: Building on success in genetic programming: adaptive variation and developmental evaluation. In: Advances in Computation and Intelligence, pp. 137\u2013146. Springer, Berlin (2007)","DOI":"10.1007\/978-3-540-74581-5_15"},{"key":"1649_CR38","doi-asserted-by":"crossref","unstructured":"Wong, P., Zhang, M.: SCHEME: Caching subtrees in genetic programming. In: 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence), pp. 2678\u20132685. IEEE (2008)","DOI":"10.1109\/CEC.2008.4631158"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-020-01649-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-020-01649-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-020-01649-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,15]],"date-time":"2024-08-15T20:21:51Z","timestamp":1723753311000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-020-01649-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,12]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,1]]}},"alternative-id":["1649"],"URL":"https:\/\/doi.org\/10.1007\/s11590-020-01649-1","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,10,12]]},"assertion":[{"value":"31 March 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 September 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 October 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}