<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/31F2E8DC-61DC-47A8-851B-EADCA05C140E"><efrbr-work:titleOfTheWork>A similarity hybrid harmony search algorithm for the Team Orienteering Problem</efrbr-work:titleOfTheWork></efrbr-work:work><efrbr-expression:expression identifier="http://purl.tuc.gr/dl/dias/31F2E8DC-61DC-47A8-851B-EADCA05C140E"><efrbr-expression:titleOfTheExpression>A similarity hybrid harmony search algorithm for the Team Orienteering Problem</efrbr-expression:titleOfTheExpression><efrbr-expression:formOfExpression vocabulary="DIAS:TYPES">
            Peer-Reviewed Journal Publication
            Δημοσίευση σε Περιοδικό με Κριτές
         </efrbr-expression:formOfExpression><efrbr-expression:dateOfExpression type="issued">2020-05-28</efrbr-expression:dateOfExpression><efrbr-expression:dateOfExpression type="published">2019</efrbr-expression:dateOfExpression><efrbr-expression:languageOfExpression vocabulary="iso639-1">en</efrbr-expression:languageOfExpression><efrbr-expression:summarizationOfContent>The Harmony Search (HS)is a metaheuristic algorithm, which is inspired from the composition of music harmonies. The functionality and flexibility of HS contribute to the development of successful methodologies for different kind of scientific problems. The aim of this paper is to propose a variant of the classic HS algorithm in order to provide competitive solutions for the Team Orienteering Problem (TOP). We introduce the Similarity Hybrid Harmony Search (SHHS)algorithm as an alternative and innovative optimization method. The SHHS follows the standard procedure of HS with some modifications and includes a new strategy called “similarity process”. Two versions of the proposed method have been developed, the static version with predefined values for the parameters of the method and the dynamic one with dynamic adjustment of the parameters. The SHHS algorithm is applied to the known benchmark instances of TOP. The dynamic of the algorithm is tested through a complete solution analysis which gives the superiority of the dynamic version compared to the static one. The results of both versions of the proposed algorithm indicate the positive performance against other effective and robust optimization algorithms from the literature.</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">Applied Soft Computing Journal</efrbr-expression:note><efrbr-expression:note type="journal volume">80</efrbr-expression:note><efrbr-expression:note type="page range">776-796</efrbr-expression:note></efrbr-expression:expression><efrbr-person:person identifier="http://users.isc.tuc.gr/~etsakirakis"><efrbr-person:nameOfPerson vocabulary="TUC:LDAP">
            Tsakirakis Eleftherios
            Τσακιρακης Ελευθεριος
         </efrbr-person:nameOfPerson></efrbr-person:person><efrbr-person:person identifier="http://users.isc.tuc.gr/~mmarinaki"><efrbr-person:nameOfPerson vocabulary="TUC:LDAP">
            Marinaki Magdalini
            Μαρινακη Μαγδαληνη
         </efrbr-person:nameOfPerson></efrbr-person:person><efrbr-person:person identifier="http://users.isc.tuc.gr/~imarinakis"><efrbr-person:nameOfPerson vocabulary="TUC:LDAP">
            Marinakis Ioannis
            Μαρινακης Ιωαννης
         </efrbr-person:nameOfPerson></efrbr-person:person><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-corporateBody:corporateBody identifier="http://www.elsevier.com/"><efrbr-corporateBody:nameOfTheCorporateBody vocabulary="S/R:PUBLISHERS">
            Elsevier
         </efrbr-corporateBody:nameOfTheCorporateBody></efrbr-corporateBody:corporateBody><efrbr-concept:concept identifier="D4115224-487E-4EA3-ADD7-2D57CFFC1BE5"><efrbr-concept:termForTheConcept>
            Harmony search algorithm
         </efrbr-concept:termForTheConcept></efrbr-concept:concept><efrbr-concept:concept identifier="98E8E613-2956-4002-8A3A-7E9ECF1818EA"><efrbr-concept:termForTheConcept>
            Metaheuristic
         </efrbr-concept:termForTheConcept></efrbr-concept:concept><efrbr-concept:concept identifier="9DEFD344-6A54-414E-AB86-A94633A16064"><efrbr-concept:termForTheConcept>
            Similarity process
         </efrbr-concept:termForTheConcept></efrbr-concept:concept><efrbr-concept:concept identifier="CDB554E2-2BB7-493F-AD6E-E316CE662732"><efrbr-concept:termForTheConcept>
            Team Orienteering Problem
         </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/31F2E8DC-61DC-47A8-851B-EADCA05C140E" targetEntity="expression" targetURI="http://purl.tuc.gr/dl/dias/31F2E8DC-61DC-47A8-851B-EADCA05C140E"/></efrbr-structure:structureRelations><efrbr-responsible:responsibleRelations><efrbr-responsible:createdBy sourceEntity="work" sourceURI="http://purl.tuc.gr/dl/dias/31F2E8DC-61DC-47A8-851B-EADCA05C140E" targetEntity="person" targetURI="http://users.isc.tuc.gr/~etsakirakis"/><efrbr-responsible:realizedBy sourceEntity="expression" sourceURI="http://purl.tuc.gr/dl/dias/31F2E8DC-61DC-47A8-851B-EADCA05C140E" targetEntity="person" targetURI="http://users.isc.tuc.gr/~etsakirakis" role="author"/><efrbr-responsible:realizedBy sourceEntity="expression" sourceURI="http://purl.tuc.gr/dl/dias/31F2E8DC-61DC-47A8-851B-EADCA05C140E" targetEntity="person" targetURI="http://users.isc.tuc.gr/~mmarinaki" role="author"/><efrbr-responsible:realizedBy sourceEntity="expression" sourceURI="http://purl.tuc.gr/dl/dias/31F2E8DC-61DC-47A8-851B-EADCA05C140E" targetEntity="person" targetURI="http://users.isc.tuc.gr/~imarinakis" role="author"/><efrbr-responsible:realizedBy sourceEntity="expression" sourceURI="http://purl.tuc.gr/dl/dias/31F2E8DC-61DC-47A8-851B-EADCA05C140E" targetEntity="person" targetURI="http://users.isc.tuc.gr/~nmatsatsinis" role="author"/><efrbr-responsible:realizedBy sourceEntity="expression" sourceURI="http://purl.tuc.gr/dl/dias/31F2E8DC-61DC-47A8-851B-EADCA05C140E" targetEntity="person" targetURI="http://www.elsevier.com/" role="publisher"/></efrbr-responsible:responsibleRelations><efrbr-subject:subjectRelations><efrbr-subject:hasSubject sourceEntity="work" sourceURI="http://purl.tuc.gr/dl/dias/31F2E8DC-61DC-47A8-851B-EADCA05C140E" targetEntity="concept" targetURI="D4115224-487E-4EA3-ADD7-2D57CFFC1BE5"/><efrbr-subject:hasSubject sourceEntity="work" sourceURI="http://purl.tuc.gr/dl/dias/31F2E8DC-61DC-47A8-851B-EADCA05C140E" targetEntity="concept" targetURI="98E8E613-2956-4002-8A3A-7E9ECF1818EA"/><efrbr-subject:hasSubject sourceEntity="work" sourceURI="http://purl.tuc.gr/dl/dias/31F2E8DC-61DC-47A8-851B-EADCA05C140E" targetEntity="concept" targetURI="9DEFD344-6A54-414E-AB86-A94633A16064"/><efrbr-subject:hasSubject sourceEntity="work" sourceURI="http://purl.tuc.gr/dl/dias/31F2E8DC-61DC-47A8-851B-EADCA05C140E" targetEntity="concept" targetURI="CDB554E2-2BB7-493F-AD6E-E316CE662732"/></efrbr-subject:subjectRelations><efrbr-other:otherRelations/></efrbr:relationships></efrbr:recordSet>