{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T03:57:34Z","timestamp":1743134254195,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031084201"},{"type":"electronic","value":"9783031084218"}],"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:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-08421-8_6","type":"book-chapter","created":{"date-parts":[[2022,7,18]],"date-time":"2022-07-18T21:02:38Z","timestamp":1658178158000},"page":"77-90","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Automated Design of\u00a0Elevator Systems: Experimenting with\u00a0Constraint-Based Approaches"],"prefix":"10.1007","author":[{"given":"Stefano","family":"Demarchi","sequence":"first","affiliation":[]},{"given":"Marco","family":"Menapace","sequence":"additional","affiliation":[]},{"given":"Armando","family":"Tacchella","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,7,19]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Annunziata, L., Menapace, M., Tacchella, A.: Computer intensive vs. heuristic methods in automated design of elevator systems. In: Proceedings of European Conference on Modelling and Simulation, ECMS 2017, Budapest, Hungary, 23\u201326 May 2017, pp. 543\u2013549 (2017)","key":"6_CR1","DOI":"10.7148\/2017-0543"},{"issue":"2","key":"6_CR2","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/s10601-012-9131-1","volume":"18","author":"C Ans\u00f3tegui","year":"2013","unstructured":"Ans\u00f3tegui, C., Bofill, M., Palah\u00ed, M., Suy, J., Villaret, M.: Solving weighted CSPs with meta-constraints by reformulation into satisfiability modulo theories. Constraints Int. J. 18(2), 236\u2013268 (2013)","journal-title":"Constraints Int. J."},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-540-74970-7_12","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"F Bacchus","year":"2007","unstructured":"Bacchus, F.: GAC via unit propagation. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 133\u2013147. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74970-7_12"},{"unstructured":"Barret, C., Fontaine, P., Tinelli, C.: The SMT-LIB standard - version 2.6 (2017). http:\/\/smtlib.cs.uiowa.edu\/papers\/smt-lib-reference-v2.6-r2017-07-18.pdf","key":"6_CR4"},{"issue":"3","key":"6_CR5","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s10601-012-9123-1","volume":"17","author":"M Bofill","year":"2012","unstructured":"Bofill, M., Palah\u00ed, M., Suy, J., Villaret, M.: Solving constraint satisfaction problems with SAT modulo theories. Constraints Int. J. 17(3), 273\u2013303 (2012)","journal-title":"Constraints Int. J."},{"doi-asserted-by":"crossref","unstructured":"Chang, K.H.: Multiobjective optimization and advanced topics, Chapter 19. In: Chang, K.H. (ed.) e-Design, pp. 1105\u20131173. Academic Press, Boston (2015)","key":"6_CR6","DOI":"10.1016\/B978-0-12-382038-9.00019-3"},{"unstructured":"Chu, G.: Improving combinatorial optimization. In: Twenty-Third International Joint Conference on Artificial Intelligence (2013)","key":"6_CR7"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/978-3-030-58942-4_10","volume-title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research","author":"F Contaldo","year":"2020","unstructured":"Contaldo, F., Trentin, P., Sebastiani, R.: From MiniZinc to optimization modulo theories, and back. In: Hebrard, E., Musliu, N. (eds.) CPAIOR 2020. LNCS, vol. 12296, pp. 148\u2013166. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-58942-4_10"},{"doi-asserted-by":"crossref","unstructured":"Demarchi, S., Menapace, M., Tacchella, A.: Automating elevator design with satisfiability modulo theories. In: 2019 IEEE 31st International Conference on Tools with Artificial Intelligence (ICTAI), pp. 26\u201333. IEEE (2019)","key":"6_CR9","DOI":"10.1109\/ICTAI.2019.00013"},{"unstructured":"Gu, Z., Rothberg, E., Bixby, R.: Gurobi optimization (2019). http:\/\/www.gurobi.com\/","key":"6_CR10"},{"unstructured":"IBM: IBM ILOG CPLEX optimization studio (2017) CPLEX users manual, version 12.7 (2017)","key":"6_CR11"},{"issue":"4","key":"6_CR12","first-page":"41","volume":"8","author":"S Marcus","year":"1987","unstructured":"Marcus, S., Stout, J., McDermott, J.: VT: an expert elevator designer that uses knowledge-based backtracking. AI Mag. 8(4), 41\u201341 (1987)","journal-title":"AI Mag."},{"unstructured":"Marriott, K., Stuckey, P.J., Koninck, L., Samulowitz, H.: A minizinc tutorial (2014)","key":"6_CR13"},{"issue":"2","key":"6_CR14","first-page":"21","volume":"2","author":"J McDermott","year":"1981","unstructured":"McDermott, J.: R1: the formative years. AI Mag. 2(2), 21\u201321 (1981)","journal-title":"AI Mag."},{"unstructured":"Mittal, S., Falkenhainer, B.: Dynamic constraint satisfaction. In: Proceedings Eighth National Conference on Artificial Intelligence, pp. 25\u201332 (1990)","key":"6_CR15"},{"unstructured":"Mittal, S., Frayman, F.: Towards a generic model of configuraton tasks. In: IJCAI, vol. 89, pp. 1395\u20131401 (1989)","key":"6_CR16"},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-540-78800-3_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L de Moura","year":"2008","unstructured":"de Moura, L., Bj\u00f8rner, N.: Z3: an efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337\u2013340. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78800-3_24"},{"key":"6_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/978-3-540-74970-7_38","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"N Nethercote","year":"2007","unstructured":"Nethercote, N., Stuckey, P.J., Becket, R., Brand, S., Duck, G.J., Tack, G.: MiniZinc: towards a standard CP modelling language. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 529\u2013543. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74970-7_38"},{"unstructured":"Perron, L., Furnon, V.: OR-Tools (2020). https:\/\/developers.google.com\/optimization\/","key":"6_CR19"},{"unstructured":"Qu\u00e9va, M.: A Framework for constraint-programming based configuration. DTU Informatics (2011)","key":"6_CR20"},{"issue":"1\u20132","key":"6_CR21","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1017\/S1471068411000469","volume":"12","author":"J Schimpf","year":"2012","unstructured":"Schimpf, J., Shen, K.: ECLiPSe - from LP to CLP. Theory Pract. Logic Program. 12(1\u20132), 127\u2013156 (2012). https:\/\/doi.org\/10.1017\/S1471068411000469","journal-title":"Theory Pract. Logic Program."},{"key":"6_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/978-3-662-54580-5_14","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"R Sebastiani","year":"2017","unstructured":"Sebastiani, R., Trentin, P.: On optimization modulo theories, MaxSMT and sorting networks. In: Legay, A., Margaria, T. (eds.) TACAS 2017. LNCS, vol. 10206, pp. 231\u2013248. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54580-5_14"},{"issue":"3","key":"6_CR23","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s10817-018-09508-6","volume":"64","author":"R Sebastiani","year":"2018","unstructured":"Sebastiani, R., Trentin, P.: OptiMathSAT: a tool for optimization modulo theories. J. Autom. Reason. 64(3), 423\u2013460 (2018). https:\/\/doi.org\/10.1007\/s10817-018-09508-6","journal-title":"J. Autom. Reason."},{"issue":"4","key":"6_CR24","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1017\/S0890060498124046","volume":"12","author":"M Stumptner","year":"1998","unstructured":"Stumptner, M., Friedrich, G.E., Haselbok, A.: Generative constraint-based configuration of large technical systems. Artif. Intell. Eng. Des. Anal. Manuf. 12(4), 307\u2013320 (1998). https:\/\/doi.org\/10.1017\/S0890060498124046","journal-title":"Artif. Intell. Eng. Des. Anal. Manuf."},{"issue":"21","key":"6_CR25","doi-asserted-by":"publisher","first-page":"6381","DOI":"10.1080\/00207543.2014.942012","volume":"52","author":"LL Zhang","year":"2014","unstructured":"Zhang, L.L.: Product configuration: a review of the state-of-the-art and future research. Int. J. Prod. Res. 52(21), 6381\u20136398 (2014)","journal-title":"Int. J. Prod. Res."}],"container-title":["Lecture Notes in Computer Science","AIxIA 2021 \u2013 Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-08421-8_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,18]],"date-time":"2022-07-18T21:03:08Z","timestamp":1658178188000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-08421-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031084201","9783031084218"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-08421-8_6","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":"19 July 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AIxIA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference of the Italian Association for Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aiia2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/aixia2021.disco.unimib.it\/","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":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"58","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":"36","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":"62% - 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","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":"2","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)"}}]}}