<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/30EE9663-11DC-4FA1-89E0-087B39CDF0B9"><efrbr-work:titleOfTheWork>Designing optimal products: Algorithms and systems</efrbr-work:titleOfTheWork></efrbr-work:work><efrbr-expression:expression identifier="http://purl.tuc.gr/dl/dias/30EE9663-11DC-4FA1-89E0-087B39CDF0B9"><efrbr-expression:titleOfTheExpression>Designing optimal products: Algorithms and systems</efrbr-expression:titleOfTheExpression><efrbr-expression:formOfExpression vocabulary="DIAS:TYPES">
            Peer-Reviewed Journal Publication
            Δημοσίευση σε Περιοδικό με Κριτές
         </efrbr-expression:formOfExpression><efrbr-expression:dateOfExpression type="issued">2015-10-21</efrbr-expression:dateOfExpression><efrbr-expression:dateOfExpression type="published">2010</efrbr-expression:dateOfExpression><efrbr-expression:languageOfExpression vocabulary="iso639-1">en</efrbr-expression:languageOfExpression><efrbr-expression:summarizationOfContent>The high cost of a product failure makes it imperative for a company to assess the market penetration of a new product at its early design. In this context, the Optimal Product Line Design problem was formulated thirty five years ago, and remains a significant research topic in the area of quantitative marketing until today. In this chapter we provide a brief description of the problem, which belongs to the class of NP-hard problems, and review the optimization algorithms that have been applied to it. The performance of the algorithms is evaluated, and the best two approaches are applied to simulated data, as well as a real world scenario. Emphasis is placed on Genetic Algorithms, since the results of the study indicate them as the approach that better fits to the specific marketing problem. Finally, the relevant marketing systems that deal with the problem are presented, and their pros and cons are discussed.</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">Studies in Fuzziness and Soft Computing</efrbr-expression:note><efrbr-expression:note type="journal volume">258</efrbr-expression:note><efrbr-expression:note type="page range">295-336</efrbr-expression:note></efrbr-expression:expression><efrbr-person:person identifier="http://users.isc.tuc.gr/~nmatsatsinis"><efrbr-person:nameOfPerson vocabulary="TUC:LDAP">
            Matsatsinis Nikolaos
            Ματσατσινης Νικολαος
         </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-corporateBody:corporateBody identifier="http://www.springerlink.com/?MUD=MP"><efrbr-corporateBody:nameOfTheCorporateBody vocabulary="S/R:PUBLISHERS">
            Springer Verlag
         </efrbr-corporateBody:nameOfTheCorporateBody></efrbr-corporateBody:corporateBody></efrbr:entities><efrbr:relationships><efrbr-structure:structureRelations><efrbr-structure:realizedThrough sourceEntity="work" sourceURI="http://purl.tuc.gr/dl/dias/30EE9663-11DC-4FA1-89E0-087B39CDF0B9" targetEntity="expression" targetURI="http://purl.tuc.gr/dl/dias/30EE9663-11DC-4FA1-89E0-087B39CDF0B9"/></efrbr-structure:structureRelations><efrbr-responsible:responsibleRelations><efrbr-responsible:createdBy sourceEntity="work" sourceURI="http://purl.tuc.gr/dl/dias/30EE9663-11DC-4FA1-89E0-087B39CDF0B9" targetEntity="person" targetURI="http://users.isc.tuc.gr/~nmatsatsinis"/><efrbr-responsible:realizedBy sourceEntity="expression" sourceURI="http://purl.tuc.gr/dl/dias/30EE9663-11DC-4FA1-89E0-087B39CDF0B9" targetEntity="person" targetURI="http://users.isc.tuc.gr/~nmatsatsinis" role="author"/><efrbr-responsible:realizedBy sourceEntity="expression" sourceURI="http://purl.tuc.gr/dl/dias/30EE9663-11DC-4FA1-89E0-087B39CDF0B9" targetEntity="person" targetURI="http://users.isc.tuc.gr/~tsafarakis" role="author"/><efrbr-responsible:realizedBy sourceEntity="expression" sourceURI="http://purl.tuc.gr/dl/dias/30EE9663-11DC-4FA1-89E0-087B39CDF0B9" targetEntity="person" targetURI="http://www.springerlink.com/?MUD=MP" role="publisher"/></efrbr-responsible:responsibleRelations><efrbr-subject:subjectRelations/><efrbr-other:otherRelations/></efrbr:relationships></efrbr:recordSet>