<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/B85725E1-EFFD-4E32-8C19-3D45D1D3DD1D"><efrbr-work:titleOfTheWork>Honey bees mating optimization algorithm for the vehicle routing problem</efrbr-work:titleOfTheWork></efrbr-work:work><efrbr-expression:expression identifier="http://purl.tuc.gr/dl/dias/B85725E1-EFFD-4E32-8C19-3D45D1D3DD1D"><efrbr-expression:titleOfTheExpression>Honey bees mating optimization algorithm for the vehicle routing problem</efrbr-expression:titleOfTheExpression><efrbr-expression:formOfExpression vocabulary="DIAS:TYPES">
            Περίληψη Δημοσίευσης σε Συνέδριο
            Conference Paper Abstract
         </efrbr-expression:formOfExpression><efrbr-expression:dateOfExpression type="issued">2015-10-30</efrbr-expression:dateOfExpression><efrbr-expression:dateOfExpression type="published">2012</efrbr-expression:dateOfExpression><efrbr-expression:languageOfExpression vocabulary="iso639-1">en</efrbr-expression:languageOfExpression><efrbr-expression:summarizationOfContent>This paper introduces a new hybrid algorithmic nature inspired approach based on Honey Bees Mating Optimization, for successfully solving the Vehicle Routing Problem. The proposed algorithm for the solution of the Vehicle Routing Problem, the Honey Bees Mating Optimization (HBMOVRP), combines a Honey Bees Mating Optimization (HBMO) algorithm and the Multiple Phase Neighbor- hood Search — Greedy Randomized Adaptive Search Procedure (MPNS-GRASP) algorithm. The proposed algorithm is tested on a set of benchmark instances and produced very satisfactory results. In all instances, the average quality is less than 0.20%. More specifically, in the fourteen classic instances proposed by Christofides, the average quality is 0.029%. The algorithm is ranked in the 2th place among the most known and effective algorithms in the literature and in the first place among all Nature Inspired methods that have ever been used for this set of instances.</efrbr-expression:summarizationOfContent><efrbr-expression:useRestrictionsOnTheExpression type="creative-commons">http://creativecommons.org/licenses/by/4.0/</efrbr-expression:useRestrictionsOnTheExpression><efrbr-expression:note type="page range">139-148</efrbr-expression:note><efrbr-expression:note type="conference name">Nature Inspired Cooperative Strategies for Optimization</efrbr-expression:note></efrbr-expression:expression><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/~mmarinaki"><efrbr-person:nameOfPerson vocabulary="TUC:LDAP">
            Marinaki Magdalini
            Μαρινακη Μαγδαληνη
         </efrbr-person:nameOfPerson></efrbr-person:person><efrbr-person:person identifier="3204B86C-933F-4844-A11F-4326C87F7D79"><efrbr-person:nameOfPerson vocabulary="">
            Georgios Dounias
         </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" targetEntity="expression" sourceURI="http://purl.tuc.gr/dl/dias/B85725E1-EFFD-4E32-8C19-3D45D1D3DD1D" targetURI="http://purl.tuc.gr/dl/dias/B85725E1-EFFD-4E32-8C19-3D45D1D3DD1D"/></efrbr-structure:structureRelations><efrbr-responsible:responsibleRelations><efrbr-responsible:createdBy sourceEntity="work" targetEntity="person" sourceURI="http://purl.tuc.gr/dl/dias/B85725E1-EFFD-4E32-8C19-3D45D1D3DD1D" targetURI="http://users.isc.tuc.gr/~imarinakis"/><efrbr-responsible:realizedBy sourceEntity="expression" role="author" targetEntity="person" sourceURI="http://purl.tuc.gr/dl/dias/B85725E1-EFFD-4E32-8C19-3D45D1D3DD1D" targetURI="http://users.isc.tuc.gr/~imarinakis"/><efrbr-responsible:realizedBy sourceEntity="expression" role="author" targetEntity="person" sourceURI="http://purl.tuc.gr/dl/dias/B85725E1-EFFD-4E32-8C19-3D45D1D3DD1D" targetURI="http://users.isc.tuc.gr/~mmarinaki"/><efrbr-responsible:realizedBy sourceEntity="expression" role="author" targetEntity="person" sourceURI="http://purl.tuc.gr/dl/dias/B85725E1-EFFD-4E32-8C19-3D45D1D3DD1D" targetURI="3204B86C-933F-4844-A11F-4326C87F7D79"/><efrbr-responsible:realizedBy sourceEntity="expression" role="publisher" targetEntity="person" sourceURI="http://purl.tuc.gr/dl/dias/B85725E1-EFFD-4E32-8C19-3D45D1D3DD1D" targetURI="http://www.springerlink.com/?MUD=MP"/></efrbr-responsible:responsibleRelations><efrbr-subject:subjectRelations/><efrbr-other:otherRelations/></efrbr:relationships></efrbr:recordSet>