{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,27]],"date-time":"2026-06-27T03:47:23Z","timestamp":1782532043280,"version":"3.54.5"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032299086","type":"print"},{"value":"9783032299093","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-29909-3_17","type":"book-chapter","created":{"date-parts":[[2026,6,27]],"date-time":"2026-06-27T03:31:49Z","timestamp":1782531109000},"page":"228-242","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Budget-Aware Hybrid ACO\u2013SA Approach for\u00a0Constructive Triangle Reassembly Under Geometric and\u00a0Combinatorial Constraints"],"prefix":"10.1007","author":[{"given":"Damir","family":"Hasanspahi\u0107","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Adis","family":"Alihod\u017ei\u0107","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Damir","family":"Hasi\u0107","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,28]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Alihod\u017ei\u0107, A., Hasanspahi\u0107, D., Tuba, E., Hasi\u0107, D.: Triangle packing strategies within a rectangle. In: Proceedings of IEEE International Conference on Artificial Intelligence, Computer, Data Sciences and Applications (ACDSA), Boracay, Philippines (2026, to appear)","DOI":"10.1109\/ACDSA67686.2026.11468118"},{"key":"17_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-032-06393-9","volume-title":"Exploring Computational Geometry: Theory and Python Implementations","author":"A Alihod\u017ei\u0107","year":"2026","unstructured":"Alihod\u017ei\u0107, A.: Exploring Computational Geometry: Theory and Python Implementations. Springer, Cham (2026)"},{"key":"17_CR3","unstructured":"Allen, S.R., Iacono, J.: Packing identical simple polygons is NP-hard. CoRR abs\/1209.5307 (2012). https:\/\/arxiv.org\/abs\/1209.5307"},{"key":"17_CR4","doi-asserted-by":"publisher","unstructured":"de\u00a0Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry: Algorithms and Applications, 3 edn. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-77974-2","DOI":"10.1007\/978-3-540-77974-2"},{"issue":"3","key":"17_CR5","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1145\/937503.937505","volume":"35","author":"C Blum","year":"2003","unstructured":"Blum, C., Roli, A.: Metaheuristics in combinatorial optimization: overview and conceptual comparison. ACM Comput. Surv. 35(3), 268\u2013308 (2003). https:\/\/doi.org\/10.1145\/937503.937505","journal-title":"ACM Comput. Surv."},{"issue":"6","key":"17_CR6","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1631\/jzus.2005.A0565","volume":"6","author":"C Chuan-bo","year":"2005","unstructured":"Chuan-bo, C., Da-hua, H.: A heuristic method for solving triangle packing problem. J. Zhejiang Univ. - Sci. A 6(6), 565\u2013570 (2005). https:\/\/doi.org\/10.1631\/jzus.2005.A0565","journal-title":"J. Zhejiang Univ. - Sci. A"},{"key":"17_CR7","unstructured":"Chou, A.: NP-hard triangle packing problems. Technical report, MIT Research Science Institute (2016). https:\/\/math.mit.edu\/research\/highschool\/rsi\/documents\/2015Chou.pdf"},{"key":"17_CR8","unstructured":"Delaunay, B.: Sur la sph\u00e8re vide. A la m\u2019emoire de Georges Vorono\u00ef. Bulletin de l\u2019Acad\u2019emie des Sciences de l\u2019URSS. Classe des sciences math\u2019ematiques et naturelles (6), 793\u2013800 (1934)"},{"issue":"1","key":"17_CR9","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M Dorigo","year":"1997","unstructured":"Dorigo, M., Gambardella, L.M.: Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans. Evol. Comput. 1(1), 53\u201366 (1997). https:\/\/doi.org\/10.1109\/4235.585892","journal-title":"IEEE Trans. Evol. Comput."},{"key":"17_CR10","doi-asserted-by":"publisher","unstructured":"Dorigo, M., Maniezzo, V., Colorni, A.: Ant system: optimization by a colony of cooperating agents. IEEE Trans. Syst. Man Cybern. Part B (Cybern.) 26(1), 29\u201341 (1996). https:\/\/doi.org\/10.1109\/3477.484436","DOI":"10.1109\/3477.484436"},{"key":"17_CR11","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/1290.001.0001","volume-title":"Ant Colony Optimization","author":"M Dorigo","year":"2004","unstructured":"Dorigo, M., St\u00fctzle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)"},{"key":"17_CR12","volume-title":"P, NP, and NP-Completeness: The Basics of Computational Complexity","author":"O Goldreich","year":"2012","unstructured":"Goldreich, O.: P, NP, and NP-Completeness: The Basics of Computational Complexity. Cambridge University Press, Cambridge, UK (2012)"},{"key":"17_CR13","doi-asserted-by":"publisher","unstructured":"Guo, B., et al.: Two-dimensional irregular packing problems: a review. Front. Mech. Eng. 8 (2022). https:\/\/doi.org\/10.3389\/fmech.2022.966691","DOI":"10.3389\/fmech.2022.966691"},{"key":"17_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/978-3-540-30140-0_37","volume-title":"Algorithms \u2013 ESA 2004","author":"R Hassin","year":"2004","unstructured":"Hassin, R., Rubinstein, S.: An approximation algorithm for maximum triangle packing. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol. 3221, pp. 403\u2013413. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30140-0_37"},{"issue":"4598","key":"17_CR15","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671\u2013680 (1983). https:\/\/doi.org\/10.1126\/science.220.4598.671","journal-title":"Science"},{"key":"17_CR16","doi-asserted-by":"publisher","unstructured":"van Laarhoven, P.J.M., Aarts, E.H.L.: Simulated Annealing: Theory and Applications. Springer, Dordrecht (1987). https:\/\/doi.org\/10.1007\/978-94-015-7744-1","DOI":"10.1007\/978-94-015-7744-1"},{"issue":"3","key":"17_CR17","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1016\/j.ejor.2019.04.045","volume":"282","author":"AAS Leao","year":"2020","unstructured":"Leao, A.A.S., Toledo, F.M.B., Oliveira, J.F., Carravilla, M.A., Alvarez-Vald\u00e9s, R.: Irregular packing problems: a review of mathematical models. Eur. J. Oper. Res. 282(3), 803\u2013822 (2020). https:\/\/doi.org\/10.1016\/j.ejor.2019.04.045","journal-title":"Eur. J. Oper. Res."},{"key":"17_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-540-28639-4_12","volume-title":"Parameterized and Exact Computation","author":"L Mathieson","year":"2004","unstructured":"Mathieson, L., Prieto, E., Shaw, P.: Packing edge disjoint triangles: a\u00a0parameterized view. In: Downey, R., Fellows, M., Dehne, F. (eds.) IWPEC 2004. LNCS, vol. 3162, pp. 127\u2013137. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-28639-4_12"},{"issue":"6","key":"17_CR19","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1063\/1.1699114","volume":"21","author":"N Metropolis","year":"1953","unstructured":"Metropolis, N., Rosenbluth, A.W., Rosenbluth, M.N., Teller, A.H., Teller, E.: Equation of state calculations by fast computing machines. J. Chem. Phys. 21(6), 1087\u20131092 (1953). https:\/\/doi.org\/10.1063\/1.1699114","journal-title":"J. Chem. Phys."},{"issue":"8","key":"17_CR20","doi-asserted-by":"publisher","first-page":"884","DOI":"10.3390\/e22080884","volume":"22","author":"P Stodola","year":"2020","unstructured":"Stodola, P., Michenka, K., Nohel, J., Rybansk\u00fd, M.: Hybrid algorithm based on ant colony optimization and simulated annealing applied to the dynamic traveling salesman problem. Entropy 22(8), 884 (2020). https:\/\/doi.org\/10.3390\/e22080884","journal-title":"Entropy"},{"key":"17_CR21","doi-asserted-by":"publisher","unstructured":"St\u00fctzle, T., Hoos, H.H.: Max\u2013min ant system and local search for the traveling salesman problem. In: Proceedings of the IEEE International Conference on Evolutionary Computation (ICEC 1997), pp. 309\u2013314. IEEE (1997). https:\/\/doi.org\/10.1109\/ICEC.1997.592327","DOI":"10.1109\/ICEC.1997.592327"},{"issue":"8","key":"17_CR22","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","volume":"16","author":"T St\u00fctzle","year":"2000","unstructured":"St\u00fctzle, T., Hoos, H.: MAX-MIN ant system. Futur. Gener. Comput. Syst. 16(8), 889\u2013914 (2000). https:\/\/doi.org\/10.1016\/S0167-739X(00)00043-1","journal-title":"Futur. Gener. Comput. Syst."},{"key":"17_CR23","volume-title":"Reinforcement Learning: An Introduction","author":"R Sutton","year":"2018","unstructured":"Sutton, R., Barto, A.: Reinforcement Learning: An Introduction, 2nd edn. MIT Press, Cambridge, MA, USA (2018)","edition":"2"},{"issue":"5","key":"17_CR24","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1023\/A:1016540724870","volume":"8","author":"EG Talbi","year":"2002","unstructured":"Talbi, E.G.: A taxonomy of hybrid metaheuristics. J. Heurist. 8(5), 541\u2013564 (2002). https:\/\/doi.org\/10.1023\/A:1016540724870","journal-title":"J. Heurist."},{"key":"17_CR25","doi-asserted-by":"publisher","DOI":"10.1155\/2013\/686845","author":"R Wang","year":"2013","unstructured":"Wang, R., Luo, Y., Dong, J., Liu, S., Qi, X.: A heuristic algorithm for solving triangle packing problem. Discret. Dyn. Nat. Soc. (2013). https:\/\/doi.org\/10.1155\/2013\/686845","journal-title":"Discret. Dyn. Nat. Soc."},{"key":"17_CR26","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/BF00992698","volume":"8","author":"C Watkins","year":"1992","unstructured":"Watkins, C., Dayan, P.: Q-learning. Mach. Learn. 8, 279\u2013292 (1992). https:\/\/doi.org\/10.1007\/BF00992698","journal-title":"Mach. Learn."},{"key":"17_CR27","doi-asserted-by":"publisher","unstructured":"Zhang, Y., Fan, Y.: Packing and covering a unit equilateral triangle with equilateral triangles. Electron. J. Combin. 12(1), R55 (2005). https:\/\/doi.org\/10.37236\/1952","DOI":"10.37236\/1952"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2026 Workshops"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-29909-3_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,27]],"date-time":"2026-06-27T03:31:51Z","timestamp":1782531111000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-29909-3_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032299086","9783032299093"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-29909-3_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"28 June 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hamburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccs-computsci2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iccs-meeting.org\/iccs2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}