{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T00:27:27Z","timestamp":1743121647659,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031340192"},{"type":"electronic","value":"9783031340208"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-34020-8_1","type":"book-chapter","created":{"date-parts":[[2023,5,26]],"date-time":"2023-05-26T10:02:30Z","timestamp":1685095350000},"page":"3-20","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Comparative Study of\u00a0Fractal-Based Decomposition Optimization"],"prefix":"10.1007","author":[{"given":"T.","family":"Firmin","sequence":"first","affiliation":[]},{"given":"E-G.","family":"Talbi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,27]]},"reference":[{"doi-asserted-by":"publisher","unstructured":"Aslimani, N., El-ghazali, T., Ellaia, R.: A new chaotic-based approach for multi-objective optimization. Algorithms 13(9) (2020). https:\/\/doi.org\/10.3390\/a13090204. https:\/\/www.mdpi.com\/1999-4893\/13\/9\/204","key":"1_CR1","DOI":"10.3390\/a13090204"},{"key":"1_CR2","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-91341-4","volume-title":"Evolutionary and Swarm Intelligence Algorithms","year":"2019","unstructured":"Bansal, J.C., Singh, P.K., Pal, N.R. (eds.): Evolutionary and Swarm Intelligence Algorithms. SCI, vol. 779. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-319-91341-4"},{"issue":"3","key":"1_CR3","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1145\/3828.3830","volume":"32","author":"R Dechter","year":"1985","unstructured":"Dechter, R., Pearl, J.: Generalized best-first search strategies and the optimality of A*. J. ACM 32(3), 505\u2013536 (1985). https:\/\/doi.org\/10.1145\/3828.3830","journal-title":"J. ACM"},{"issue":"4","key":"1_CR4","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1023\/A:1008384329041","volume":"14","author":"M Demirhan","year":"1999","unstructured":"Demirhan, M., \u00d6zdamar, L., Helvac\u0131o\u011flu, L., Birbil, I.: FRACTOP: a geometric partitioning metaheuristic for global optimization. J. Glob. Optim. 14(4), 415\u2013436 (1999). https:\/\/doi.org\/10.1023\/A:1008384329041","journal-title":"J. Glob. Optim."},{"doi-asserted-by":"publisher","unstructured":"Frohner, N., Gmys, J., Melab, N., Raidl, G.R., Talbi, E.G.: Parallel beam search for combinatorial optimization (extended abstract). In: Proceedings of the International Symposium on Combinatorial Search, vol. 15, no. 1, pp. 273\u2013275 (2022). https:\/\/doi.org\/10.1609\/socs.v15i1.21783. https:\/\/ojs.aaai.org\/index.php\/SOCS\/article\/view\/21783","key":"1_CR5","DOI":"10.1609\/socs.v15i1.21783"},{"key":"1_CR6","doi-asserted-by":"publisher","DOI":"10.1017\/9781108348973","volume-title":"Bayesian Optimization","author":"R Garnett","year":"2023","unstructured":"Garnett, R.: Bayesian Optimization. Cambridge University Press, Cambridge (2023)"},{"doi-asserted-by":"crossref","unstructured":"Imai, T., Kishimoto, A.: A Novel Technique for Avoiding Plateaus of Greedy Best-First Search in Satisficing Planning, vol. 2 (2011)","key":"1_CR7","DOI":"10.1609\/socs.v2i1.18208"},{"key":"1_CR8","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF00941892","volume":"79","author":"D Jones","year":"1993","unstructured":"Jones, D., Perttunen, C., Stuckman, B.: Lipschitzian optimisation without the Lipschitz constant. J. Optim. Theory Appl. 79, 157\u2013181 (1993). https:\/\/doi.org\/10.1007\/BF00941892","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"1_CR9","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. Glob. Optim. 79(3), 521\u2013566 (2021). https:\/\/doi.org\/10.1007\/s10898-020-00952-6","journal-title":"J. Glob. Optim."},{"issue":"1\u20133","key":"1_CR10","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/s00454-008-9050-5","volume":"39","author":"L Khachiyan","year":"2008","unstructured":"Khachiyan, L., Boros, E., Borys, K., Elbassioni, K., Gurvich, V.: Generating all vertices of a polyhedron is hard. Discret. Comput. Geom. 39(1\u20133), 174\u2013190 (2008). https:\/\/doi.org\/10.1007\/s00454-008-9050-5","journal-title":"Discret. Comput. Geom."},{"doi-asserted-by":"publisher","unstructured":"Khodabandelou, G., Nakib, A.: H-polytope decomposition-based algorithm for continuous optimization. Inf. Sci. 558, 50\u201375 (2021). https:\/\/doi.org\/10.1016\/j.ins.2020.12.090. https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020025521000232","key":"1_CR11","DOI":"10.1016\/j.ins.2020.12.090"},{"doi-asserted-by":"publisher","unstructured":"Liang, J., Suganthan, P., Qu, B., Gong, D., Yue, C.: Problem definitions and evaluation criteria for the CEC 2020 special session on multimodal multiobjective optimization (2019). https:\/\/doi.org\/10.13140\/RG.2.2.31746.02247","key":"1_CR12","DOI":"10.13140\/RG.2.2.31746.02247"},{"doi-asserted-by":"publisher","unstructured":"Liu, H., Xu, S., Wang, X., Wu, J., Song, Y.: A global optimization algorithm for simulation-based problems via the extended direct scheme. Eng. Optim. 47 (2014). https:\/\/doi.org\/10.1080\/0305215X.2014.971777","key":"1_CR13","DOI":"10.1080\/0305215X.2014.971777"},{"doi-asserted-by":"publisher","unstructured":"Mitchell, S.A., et al.: Spoke-darts for high-dimensional blue-noise sampling. ACM Trans. Graph. 37(2) (2018). https:\/\/doi.org\/10.1145\/3194657","key":"1_CR14","DOI":"10.1145\/3194657"},{"key":"1_CR15","doi-asserted-by":"publisher","first-page":"521","DOI":"10.15388\/Informatica.2011.340","volume":"22","author":"J Mockus","year":"2011","unstructured":"Mockus, J.: On the pareto optimality in the context of Lipschitzian optimization. Informatica Lith. Acad. Sci. 22, 521\u2013536 (2011). https:\/\/doi.org\/10.15388\/Informatica.2011.340","journal-title":"Informatica Lith. Acad. Sci."},{"issue":"1","key":"1_CR16","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1002\/nav.21732","volume":"64","author":"D Morrison","year":"2017","unstructured":"Morrison, D., Sauppe, J., Zhang, W., Jacobson, S., Sewell, E.: Cyclic best first search: using contours to guide branch-and-bound algorithms. Nav. Res. Logist. Q. 64(1), 64\u201382 (2017). https:\/\/doi.org\/10.1002\/nav.21732","journal-title":"Nav. Res. Logist. Q."},{"issue":"4","key":"1_CR17","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1145\/377939.377946","volume":"2","author":"ME Muller","year":"1959","unstructured":"Muller, M.E.: A note on a method for generating points uniformly on N-dimensional spheres. Commun. ACM 2(4), 19\u201320 (1959). https:\/\/doi.org\/10.1145\/377939.377946","journal-title":"Commun. ACM"},{"unstructured":"Munos, R.: Optimistic optimization of a deterministic function without the knowledge of its smoothness. In: Shawe-Taylor, J., Zemel, R., Bartlett, P., Pereira, F., Weinberger, K. (eds.) Advances in Neural Information Processing Systems, vol. 24. Curran Associates, Inc. (2011)","key":"1_CR18"},{"doi-asserted-by":"publisher","unstructured":"Nakib, A., Ouchraa, S., Shvai, N., Souquet, L., Talbi, E.G.: Deterministic metaheuristic based on fractal decomposition for large-scale optimization. Appl. Soft Comput. 61, 468\u2013485 (2017). https:\/\/doi.org\/10.1016\/j.asoc.2017.07.042. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S1568494617304623","key":"1_CR19","DOI":"10.1016\/j.asoc.2017.07.042"},{"doi-asserted-by":"publisher","unstructured":"Nakib, A., Souquet, L., Talbi, E.G.: Parallel fractal decomposition based algorithm for big continuous optimization problems. J. Parallel Distrib. Comput. 133, 297\u2013306 (2019). https:\/\/doi.org\/10.1016\/j.jpdc.2018.06.002. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0743731518304003","key":"1_CR20","DOI":"10.1016\/j.jpdc.2018.06.002"},{"issue":"1","key":"1_CR21","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10898-013-0089-3","volume":"59","author":"R Paulavi\u010dius","year":"2013","unstructured":"Paulavi\u010dius, R., \u017dilinskas, J.: Simplicial Lipschitz optimization without the Lipschitz constant. J. Global Optim. 59(1), 23\u201340 (2013). https:\/\/doi.org\/10.1007\/s10898-013-0089-3","journal-title":"J. Global Optim."},{"doi-asserted-by":"crossref","unstructured":"Valenzano, R.A., Xie, F.: On the completeness of best-first search variants that use random exploration. In: AAAI Conference on Artificial Intelligence (2016)","key":"1_CR22","DOI":"10.1609\/aaai.v30i1.10081"},{"unstructured":"Valko, M., Carpentier, A., Munos, R.: Stochastic simultaneous optimistic optimization. In: 30th International Conference on Machine Learning, ICML 2013, vol. 28 (2013)","key":"1_CR23"}],"container-title":["Communications in Computer and Information Science","Optimization and Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-34020-8_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,26]],"date-time":"2023-05-26T10:08:03Z","timestamp":1685095683000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-34020-8_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031340192","9783031340208"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-34020-8_1","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"27 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"OLA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Optimization and Learning","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 May 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 May 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ola2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ola2023.sciencesconf.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"sciencesconf.org","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"78","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":"32","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":"0","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":"41% - 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":"3","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":"3","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}