<efrbr:recordSet xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:efrbr="http://vfrbr.info/efrbr/1.1" xmlns:efrbr-work="http://vfrbr.info/efrbr/1.1/work" xmlns:efrbr-expression="http://vfrbr.info/efrbr/1.1/expression" xmlns:efrbr-manifestation="http://vfrbr.info/efrbr/1.1/manifestation" xmlns:efrbr-person="http://vfrbr.info/efrbr/1.1/person" xmlns:efrbr-corporateBody="http://vfrbr.info/efrbr/1.1/corporateBody" xmlns:efrbr-concept="http://vfrbr.info/efrbr/1.1/concept" xmlns:efrbr-structure="http://vfrbr.info/efrbr/1.1/structure" xmlns:efrbr-responsible="http://vfrbr.info/efrbr/1.1/responsible" xmlns:efrbr-subject="http://vfrbr.info/efrbr/1.1/subject" xmlns:efrbr-other="http://vfrbr.info/efrbr/1.1/other" xsi:schemaLocation="http://vfrbr.info/efrbr/1.1 http://vfrbr.info/schemas/1.1/efrbr.xsd"><efrbr:entities><efrbr-work:work identifier="http://purl.tuc.gr/dl/dias/94276C09-A3BF-4D9E-95E7-55800F26067F"><efrbr-work:titleOfTheWork>Clonal selection algorithms for optimal product line design: a comparative study</efrbr-work:titleOfTheWork></efrbr-work:work><efrbr-expression:expression identifier="http://purl.tuc.gr/dl/dias/94276C09-A3BF-4D9E-95E7-55800F26067F"><efrbr-expression:titleOfTheExpression>Clonal selection algorithms for optimal product line design: a comparative study</efrbr-expression:titleOfTheExpression><efrbr-expression:formOfExpression vocabulary="DIAS:TYPES">
            Peer-Reviewed Journal Publication
            Δημοσίευση σε Περιοδικό με Κριτές
         </efrbr-expression:formOfExpression><efrbr-expression:dateOfExpression type="issued">2024-01-05</efrbr-expression:dateOfExpression><efrbr-expression:dateOfExpression type="published">2022</efrbr-expression:dateOfExpression><efrbr-expression:languageOfExpression vocabulary="iso639-1">en</efrbr-expression:languageOfExpression><efrbr-expression:summarizationOfContent>Product design constitutes a critical process for a firm to stay competitive. Whilst the biologically inspired Clonal Selection Algorithms (CSA) have been applied to efficiently solve several combinatorial optimization problems, they have not yet been tested for optimal product lines. By adopting a previous comparative analysis with real and simulated conjoint data, we adapt and compare in this context 23 CSA variants. Our comparison demonstrates the efficiency of specific cloning, selection and somatic hypermutation operators against other optimization algorithms, such as Simulated Annealing and Genetic Algorithm. To further investigate the robustness of each method to combinatorial size, we extend the previous paradigm to larger product lines and different optimization objectives. The consequent performance variation elucidates how each operator shifts the search focus of CSAs. Collectively, our study demonstrates the importance of a fine balance between global and local search in such combinatorial problems, and the ability of CSAs to achieve it.</efrbr-expression:summarizationOfContent><efrbr-expression:useRestrictionsOnTheExpression type="creative-commons">http://creativecommons.org/licenses/by/4.0/</efrbr-expression:useRestrictionsOnTheExpression><efrbr-expression:note type="journal name">European Journal of Operational Research</efrbr-expression:note><efrbr-expression:note type="journal volume">298</efrbr-expression:note><efrbr-expression:note type="journal number">2</efrbr-expression:note><efrbr-expression:note type="page range">585-595</efrbr-expression:note></efrbr-expression:expression><efrbr-person:person identifier="http://users.isc.tuc.gr/~mpantourakis"><efrbr-person:nameOfPerson vocabulary="TUC:LDAP">
            Pantourakis Michail
            Παντουρακης Μιχαηλ
         </efrbr-person:nameOfPerson></efrbr-person:person><efrbr-person:person identifier="http://users.isc.tuc.gr/~tsafarakis"><efrbr-person:nameOfPerson vocabulary="TUC:LDAP">
            Tsafarakis Stelios
            Τσαφαρακης Στελιος
         </efrbr-person:nameOfPerson></efrbr-person:person><efrbr-person:person identifier="http://users.isc.tuc.gr/~kzervoudakis"><efrbr-person:nameOfPerson vocabulary="TUC:LDAP">
            Zervoudakis Konstantinos
            Ζερβουδακης Κωνσταντινος
         </efrbr-person:nameOfPerson></efrbr-person:person><efrbr-person:person identifier="39810074-B3F9-4400-88D8-7F1A901D5092"><efrbr-person:nameOfPerson vocabulary="">
            Altsitsiadis Efthymios
         </efrbr-person:nameOfPerson></efrbr-person:person><efrbr-person:person identifier="48789334-C0A0-4055-A658-D606E0635A88"><efrbr-person:nameOfPerson vocabulary="">
            Andronikidis Andreas
         </efrbr-person:nameOfPerson></efrbr-person:person><efrbr-person:person identifier="http://users.isc.tuc.gr/~vantamadaki"><efrbr-person:nameOfPerson vocabulary="TUC:LDAP">
            Ntamadaki Vasiliki
            Νταμαδακη Βασιλικη
         </efrbr-person:nameOfPerson></efrbr-person:person><efrbr-corporateBody:corporateBody identifier="https://v2.sherpa.ac.uk/id/publisher/30"><efrbr-corporateBody:nameOfTheCorporateBody vocabulary="S/R:PUBLISHERS">
            Elsevier
         </efrbr-corporateBody:nameOfTheCorporateBody></efrbr-corporateBody:corporateBody><efrbr-concept:concept identifier="84FFA344-41B6-4D87-AC96-0BF77AFB8DB8"><efrbr-concept:termForTheConcept>
            Or in marketing
         </efrbr-concept:termForTheConcept></efrbr-concept:concept><efrbr-concept:concept identifier="8AA06B3E-671C-4958-8FC0-683D55BC739A"><efrbr-concept:termForTheConcept>
            Clonal selection algorithm
         </efrbr-concept:termForTheConcept></efrbr-concept:concept><efrbr-concept:concept identifier="A067D4F9-0B22-4663-B1AD-299F3CAC74E1"><efrbr-concept:termForTheConcept>
            Combinatorial optimization
         </efrbr-concept:termForTheConcept></efrbr-concept:concept><efrbr-concept:concept identifier="21F21042-00D5-4E49-9F9C-F9B4F411DF3B"><efrbr-concept:termForTheConcept>
            Product line design
         </efrbr-concept:termForTheConcept></efrbr-concept:concept></efrbr:entities><efrbr:relationships><efrbr-structure:structureRelations><efrbr-structure:realizedThrough sourceEntity="work" sourceURI="http://purl.tuc.gr/dl/dias/94276C09-A3BF-4D9E-95E7-55800F26067F" targetEntity="expression" targetURI="http://purl.tuc.gr/dl/dias/94276C09-A3BF-4D9E-95E7-55800F26067F"/></efrbr-structure:structureRelations><efrbr-responsible:responsibleRelations><efrbr-responsible:createdBy sourceEntity="work" sourceURI="http://purl.tuc.gr/dl/dias/94276C09-A3BF-4D9E-95E7-55800F26067F" targetEntity="person" targetURI="http://users.isc.tuc.gr/~mpantourakis"/><efrbr-responsible:realizedBy sourceEntity="expression" sourceURI="http://purl.tuc.gr/dl/dias/94276C09-A3BF-4D9E-95E7-55800F26067F" targetEntity="person" targetURI="http://users.isc.tuc.gr/~mpantourakis" role="author"/><efrbr-responsible:realizedBy sourceEntity="expression" sourceURI="http://purl.tuc.gr/dl/dias/94276C09-A3BF-4D9E-95E7-55800F26067F" targetEntity="person" targetURI="http://users.isc.tuc.gr/~tsafarakis" role="author"/><efrbr-responsible:realizedBy sourceEntity="expression" sourceURI="http://purl.tuc.gr/dl/dias/94276C09-A3BF-4D9E-95E7-55800F26067F" targetEntity="person" targetURI="http://users.isc.tuc.gr/~kzervoudakis" role="author"/><efrbr-responsible:realizedBy sourceEntity="expression" sourceURI="http://purl.tuc.gr/dl/dias/94276C09-A3BF-4D9E-95E7-55800F26067F" targetEntity="person" targetURI="39810074-B3F9-4400-88D8-7F1A901D5092" role="author"/><efrbr-responsible:realizedBy sourceEntity="expression" sourceURI="http://purl.tuc.gr/dl/dias/94276C09-A3BF-4D9E-95E7-55800F26067F" targetEntity="person" targetURI="48789334-C0A0-4055-A658-D606E0635A88" role="author"/><efrbr-responsible:realizedBy sourceEntity="expression" sourceURI="http://purl.tuc.gr/dl/dias/94276C09-A3BF-4D9E-95E7-55800F26067F" targetEntity="person" targetURI="http://users.isc.tuc.gr/~vantamadaki" role="author"/><efrbr-responsible:realizedBy sourceEntity="expression" sourceURI="http://purl.tuc.gr/dl/dias/94276C09-A3BF-4D9E-95E7-55800F26067F" targetEntity="person" targetURI="https://v2.sherpa.ac.uk/id/publisher/30" role="publisher"/></efrbr-responsible:responsibleRelations><efrbr-subject:subjectRelations><efrbr-subject:hasSubject sourceEntity="work" sourceURI="http://purl.tuc.gr/dl/dias/94276C09-A3BF-4D9E-95E7-55800F26067F" targetEntity="concept" targetURI="84FFA344-41B6-4D87-AC96-0BF77AFB8DB8"/><efrbr-subject:hasSubject sourceEntity="work" sourceURI="http://purl.tuc.gr/dl/dias/94276C09-A3BF-4D9E-95E7-55800F26067F" targetEntity="concept" targetURI="8AA06B3E-671C-4958-8FC0-683D55BC739A"/><efrbr-subject:hasSubject sourceEntity="work" sourceURI="http://purl.tuc.gr/dl/dias/94276C09-A3BF-4D9E-95E7-55800F26067F" targetEntity="concept" targetURI="A067D4F9-0B22-4663-B1AD-299F3CAC74E1"/><efrbr-subject:hasSubject sourceEntity="work" sourceURI="http://purl.tuc.gr/dl/dias/94276C09-A3BF-4D9E-95E7-55800F26067F" targetEntity="concept" targetURI="21F21042-00D5-4E49-9F9C-F9B4F411DF3B"/></efrbr-subject:subjectRelations><efrbr-other:otherRelations/></efrbr:relationships></efrbr:recordSet>