{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:27:13Z","timestamp":1742912833477,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031105616"},{"type":"electronic","value":"9783031105623"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,8,4]],"date-time":"2022-08-04T00:00:00Z","timestamp":1659571200000},"content-version":"vor","delay-in-days":215,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Optimization problems are frequent in several fields, such as the different branches of Engineering. In some cases, the objective function exposes mathematically exploitable properties to find exact solutions. However, when it is not the case, heuristics are appreciated. This situation occurs when the objective function involves numerical simulations and sophisticated models of reality. Then, population-based meta-heuristics, such as genetic algorithms, are widely used because of being independent of the objective function. Unfortunately, they have multiple parameters and generally require numerous function evaluations to find competitive solutions stably. An attractive alternative is DIRECT, which handles the objective function as a black box like the previous meta-heuristics but is almost parameter-free and deterministic. Unfortunately, its rectangle division behavior is rigid, and it may require many function evaluations for degenerate cases. This work presents an optimizer that combines the lack of parameters and stochasticity for high exploration capabilities. This method, called Tangram, defines a self-adapted set of division rules for the search space yet relies on a stochastic hill-climber to perform local searches. This optimizer is expected to be effective for low-dimensional problems (less than 20 variables) and few function evaluations. According to the results achieved, Tangram outperforms Teaching-Learning-Based Optimization (TLBO), a widespread population-based method, and a plain multi-start configuration of the stochastic hill-climber used.<\/jats:p>","DOI":"10.1007\/978-3-031-10562-3_14","type":"book-chapter","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T14:25:15Z","timestamp":1659536715000},"page":"188-200","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the\u00a0Design of\u00a0a\u00a0New Stochastic Meta-Heuristic for\u00a0Derivative-Free Optimization"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5839-9451","authenticated-orcid":false,"given":"N. C.","family":"Cruz","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2826-1635","authenticated-orcid":false,"given":"Juana L.","family":"Redondo","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3914-9158","authenticated-orcid":false,"given":"E. M.","family":"Ortigosa","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6514-6543","authenticated-orcid":false,"given":"P. M.","family":"Ortigosa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,8,4]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.ins.2013.02.041","volume":"237","author":"I Boussa\u00efd","year":"2013","unstructured":"Boussa\u00efd, I., Lepagnot, J., Siarry, P.: A survey on optimization metaheuristics. Inf. Sci. 237, 82\u2013117 (2013)","journal-title":"Inf. Sci."},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Boyd, S., Boyd, S.P., Vandenberghe, L.: Convex optimization. Cambridge University Press (2004)","DOI":"10.1017\/CBO9780511804441"},{"issue":"4","key":"14_CR3","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/s12532-018-0144-7","volume":"10","author":"A Costa","year":"2018","unstructured":"Costa, A., Nannicini, G.: RBFOpt: an open-source library for black-box optimization with costly function evaluations. Math. Program. Comput. 10(4), 597\u2013629 (2018). https:\/\/doi.org\/10.1007\/s12532-018-0144-7","journal-title":"Math. Program. Comput."},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"477","DOI":"10.15388\/21-INFOR450","volume":"32","author":"NC Cruz","year":"2021","unstructured":"Cruz, N.C., Mar\u00edn, M., Redondo, J.L., Ortigosa, E.M., Ortigosa, P.M.: A comparative study of stochastic optimizers for fitting neuron models. application to the cerebellar granule cell. Informatica 32, 477\u2013498 (2021)","journal-title":"Informatica"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Griva, I., Nash, S.G., Sofer, A.: Linear and nonlinear optimization, vol. 108. Siam (2009)","DOI":"10.1137\/1.9780898717730"},{"issue":"3","key":"14_CR6","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1023\/A:1011367930251","volume":"7","author":"M Jelasity","year":"2001","unstructured":"Jelasity, M., Ortigosa, P.M., Garc\u00eda, I.: Uego, an abstract clustering technique for multimodal global optimization. J. Heuristics 7(3), 215\u2013233 (2001)","journal-title":"J. Heuristics"},{"issue":"3","key":"14_CR7","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/s10898-020-00952-6","volume":"79","author":"DR Jones","year":"2021","unstructured":"Jones, D.R., Martins, J.R.R.A.: The DIRECT algorithm: 25 years later. J. Global Optim. 79(3), 521\u2013566 (2021)","journal-title":"J. Global Optim."},{"issue":"1","key":"14_CR8","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF00941892","volume":"79","author":"DR Jones","year":"1993","unstructured":"Jones, D.R., Perttunen, C.D., Stuckman, B.E.: Lipschitzian optimization without the lipschitz constant. J. Optim. Theory Appl. 79(1), 157\u2013181 (1993)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"14_CR9","doi-asserted-by":"publisher","first-page":"293","DOI":"10.15388\/NA.18.3.14011","volume":"18","author":"A Lan\u010dinskas","year":"2013","unstructured":"Lan\u010dinskas, A., Ortigosa, P.M., \u017dilinskas, J.: Multi-objective single agent stochastic search in non-dominated sorting genetic algorithm. Nonlinear Anal. Model. Control 18(3), 293\u2013313 (2013)","journal-title":"Nonlinear Anal. Model. Control"},{"key":"14_CR10","unstructured":"Lindfield, G., Penny, J.: Introduction to nature-inspired optimization. Academic Press (2017)"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Mar\u00edn, M., Cruz, N.C., Ortigosa, E.M., S\u00e1ez-Lara, M.J., Garrido, J.A., Carrillo, R.R.: On the use of a multimodal optimizer for fitting neuron models. application to the cerebellar granule cell. Frontiers Neuroinformatics 15, 663797 (2021)","DOI":"10.3389\/fninf.2021.663797"},{"key":"14_CR12","unstructured":"Monterreal, R., Cruz, N.C., Redondo, J.L., Fern\u00e1ndez-Reche, J., Enrique, R., Ortigosa, P.M.: On the optical characterization of heliostats through computational optimization. In: Proceedings of SolarPACES 2020, pp. 1\u20138 (2020)"},{"key":"14_CR13","unstructured":"Price, K., Storn, R.M., Lampinen, J.A.: Differential evolution: a practical approach to global optimization. Springer Science & Business Media (2006)"},{"issue":"1","key":"14_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ins.2011.08.006","volume":"183","author":"RV Rao","year":"2012","unstructured":"Rao, R.V., Savsani, V.J., Vakharia, D.P.: Teaching-learning-based optimization: an optimization method for continuous non-linear large scale problems. Inf. Sci. 183(1), 1\u201315 (2012)","journal-title":"Inf. Sci."},{"key":"14_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-49355-8","volume-title":"Heuristic Search","author":"S Salhi","year":"2017","unstructured":"Salhi, S.: Heuristic Search. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-49355-8"},{"key":"14_CR16","series-title":"Springer Optimization and Its Applications","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-77586-9","volume-title":"Practical Mathematical Optimization","author":"JA Snyman","year":"2018","unstructured":"Snyman, J.A., Wilke, D.N.: Practical Mathematical Optimization. SOIA, vol. 133. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-77586-9"},{"issue":"1","key":"14_CR17","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1287\/moor.6.1.19","volume":"6","author":"FJ Solis","year":"1981","unstructured":"Solis, F.J., Wets, R.J.B.: Minimization by random search techniques. Math. Oper. Res. 6(1), 19\u201330 (1981)","journal-title":"Math. Oper. Res."},{"issue":"9","key":"14_CR18","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1080\/00029890.1942.11991289","volume":"49","author":"FT Wang","year":"1942","unstructured":"Wang, F.T., Hsiung, C.C.: A theorem on the Tangram. Am. Math. Mon. 49(9), 596\u2013599 (1942)","journal-title":"Am. Math. Mon."},{"key":"14_CR19","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1016\/j.asoc.2015.08.047","volume":"37","author":"F Zou","year":"2015","unstructured":"Zou, F., Wang, L., Hei, X., Chen, D.: Teaching-learning-based optimization with learning experience of other learners and its application. Appl. Soft Comput. 37, 725\u2013736 (2015)","journal-title":"Appl. Soft Comput."}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2022 Workshops"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-10562-3_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T14:32:20Z","timestamp":1659537140000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-10562-3_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031105616","9783031105623"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-10562-3_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"4 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCSA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science and Its Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Malaga","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 July 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 July 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccsa2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iccsa.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"CyberChair 4","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"279","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"57","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"20% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.6","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8.7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"285 Workshop submission accepted out of 815 submissions","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}