{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T10:51:45Z","timestamp":1770979905273,"version":"3.50.1"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030386283","type":"print"},{"value":"9783030386290","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-38629-0_23","type":"book-chapter","created":{"date-parts":[[2020,1,21]],"date-time":"2020-01-21T09:05:05Z","timestamp":1579597505000},"page":"284-297","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["A New Hybrid Firefly \u2013 Genetic Algorithm for the Optimal Product Line Design Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2146-1493","authenticated-orcid":false,"given":"Konstantinos","family":"Zervoudakis","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5535-4787","authenticated-orcid":false,"given":"Stelios","family":"Tsafarakis","sequence":"additional","affiliation":[]},{"given":"Sovatzidi","family":"Paraskevi-Panagiota","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,1,22]]},"reference":[{"key":"23_CR1","volume-title":"Principles of Marketing","author":"P Kotler","year":"2012","unstructured":"Kotler, P., Armstrong, G.: Principles of Marketing. Pearson\/Prentice Hall, Upper Saddle River (2012)"},{"key":"23_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0022-2496(64)90015-X","volume":"1","author":"RD Luce","year":"1964","unstructured":"Luce, R.D., Tukey, J.W.: Simultaneous conjoint measurement: a new type of fundamental measurement. J. Math. Psychol. 1, 1\u201327 (1964)","journal-title":"J. Math. Psychol."},{"key":"23_CR3","volume-title":"Combinatorial Optimization: Algorithms and Complexity","author":"CH Papadimitriou","year":"1982","unstructured":"Papadimitriou, C.H., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity. Prentice Hall, Upper Saddle River (1982)"},{"key":"23_CR4","doi-asserted-by":"publisher","first-page":"1464","DOI":"10.1287\/mnsc.36.12.1464","volume":"36","author":"R Kohli","year":"1990","unstructured":"Kohli, R., Sukumar, R.: Heuristics for product-line design using conjoint analysis. Manage. Sci. 36, 1464\u20131478 (1990)","journal-title":"Manage. Sci."},{"key":"23_CR5","doi-asserted-by":"publisher","first-page":"767","DOI":"10.1287\/mnsc.41.5.767","volume":"41","author":"SK Nair","year":"1995","unstructured":"Nair, S.K., Thakur, L.S., Wen, K.-W.: Near optimal solutions for product line design and selection: beam search heuristics. Manage. Sci. 41, 767\u2013785 (1995)","journal-title":"Manage. Sci."},{"key":"23_CR6","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1109\/TSMCB.2003.817051","volume":"34","author":"PV Balakrishnan","year":"2004","unstructured":"Balakrishnan, P.V., Gupta, R., Jacob, V.S.: Development of hybrid genetic algorithms for product line designs. IEEE Trans. Syst. Man, Cybern. Part B Cybern. 34, 468\u2013483 (2004)","journal-title":"IEEE Trans. Syst. Man, Cybern. Part B Cybern."},{"key":"23_CR7","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1287\/mnsc.1050.0461","volume":"52","author":"JD Camm","year":"2006","unstructured":"Camm, J.D., Cochran, J.J., Curry, D.J., Kannan, S.: Conjoint optimization: an exact branch-and-bound algorithm for the share-of-choice problem. Manage. Sci. 52, 435\u2013447 (2006)","journal-title":"Manage. Sci."},{"key":"23_CR8","doi-asserted-by":"publisher","first-page":"1544","DOI":"10.1287\/mnsc.1080.0864","volume":"54","author":"A Belloni","year":"2008","unstructured":"Belloni, A., Freund, R., Selove, M., Simester, D.: Optimizing product line designs: efficient methods and comparisons. Manage. Sci. 54, 1544\u20131552 (2008)","journal-title":"Manage. Sci."},{"key":"23_CR9","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.ijresmar.2010.05.002","volume":"28","author":"S Tsafarakis","year":"2011","unstructured":"Tsafarakis, S., Marinakis, Y., Matsatsinis, N.: Particle swarm optimization for optimal product line design. Int. J. Res. Mark. 28, 13\u201322 (2011)","journal-title":"Int. J. Res. Mark."},{"key":"23_CR10","volume-title":"Nature-Inspired Metaheuristic Algorithms","author":"X-S Yang","year":"2008","unstructured":"Yang, X.-S.: Nature-Inspired Metaheuristic Algorithms. Luniver Press, Bristol (2008)"},{"key":"23_CR11","volume-title":"Genetic Algorithms in Search, Optimization, and Machine Learning","author":"DE Goldberg","year":"1989","unstructured":"Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading (1989)"},{"key":"23_CR12","first-page":"47","volume":"3","author":"M Elkhechafi","year":"2017","unstructured":"Elkhechafi, M., Hachimi, H., Elkettani, Y.: A new hybrid firefly with genetic algorithm for global optimization. Int. J. Manag. Appl. Sci. 3, 47\u201351 (2017)","journal-title":"Int. J. Manag. Appl. Sci."},{"key":"23_CR13","unstructured":"Masouleh, M.F., Kazemi, M.A.A., Alborzi, M., Eshlaghy, A.T.: Engineering, technology & applied science research. ETASR (2016)"},{"key":"23_CR14","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.ins.2014.06.002","volume":"283","author":"A Rahmani","year":"2014","unstructured":"Rahmani, A., MirHassani, S.A.: A hybrid Firefly-Genetic Algorithm for the capacitated facility location problem. Inf. Sci. (Ny) 283, 70\u201378 (2014)","journal-title":"Inf. Sci. (Ny)"},{"key":"23_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, 671\u2013680 (1983)","journal-title":"Science"},{"key":"23_CR16","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1016\/0377-2217(89)90329-9","volume":"40","author":"R Kohli","year":"1989","unstructured":"Kohli, R., Krishnamurti, R.: Optimal product design using conjoint analysis: computational complexity and algorithms. Eur. J. Oper. Res. 40, 186\u2013195 (1989)","journal-title":"Eur. J. Oper. Res."},{"key":"23_CR17","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1287\/mksc.22.3.273.17743","volume":"22","author":"O Toubia","year":"2003","unstructured":"Toubia, O., Simester, D.I., Hauser, J.R., Dahan, E.: Fast polyhedral adaptive conjoint estimation. Mark. Sci. 22, 273\u2013303 (2003)","journal-title":"Mark. Sci."},{"key":"23_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/mnsc.27.1.1","volume":"27","author":"ML Fisher","year":"1981","unstructured":"Fisher, M.L.: The Lagrangian relaxation method for solving integer programming problems. Manage. Sci. 27, 1\u201318 (1981)","journal-title":"Manage. Sci."}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-38629-0_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,21]],"date-time":"2020-01-21T09:21:38Z","timestamp":1579598498000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-38629-0_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030386283","9783030386290"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-38629-0_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"22 January 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LION","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Learning and Intelligent Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chania, Crete","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 May 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 May 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lion2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.lion13.pem.tuc.gr\/en\/home\/","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":"52","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":"38","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":"73% - 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":"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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}