<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/E033B572-D70C-4F68-BB0B-3FC67BA0E7E8"><efrbr-work:titleOfTheWork>A memetic differential evolution algorithm for the vehicle routing problem with stochastic demands</efrbr-work:titleOfTheWork></efrbr-work:work><efrbr-expression:expression identifier="http://purl.tuc.gr/dl/dias/E033B572-D70C-4F68-BB0B-3FC67BA0E7E8"><efrbr-expression:titleOfTheExpression>A memetic differential evolution algorithm for the vehicle routing problem with stochastic demands</efrbr-expression:titleOfTheExpression><efrbr-expression:formOfExpression vocabulary="DIAS:TYPES">
            Περίληψη Δημοσίευσης σε Συνέδριο
            Conference Paper Abstract
         </efrbr-expression:formOfExpression><efrbr-expression:dateOfExpression type="issued">2015-10-28</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 chapter introduces a new hybrid algorithmic approach based on the Differential Evolution (DE) algorithm for successfully solving a number of routing problems with stochastic variables. More precisely, we solve one problem with stochastic customers, the Probabilistic Traveling Salesman Problem and one problem with stochastic demands, the Vehicle Routing Problem with Stochastic Demands. The proposed algorithm uses a Variable Neighborhood Search algorithm in order to increase the exploitation abilities of the algorithm. The algorithm is tested on a number of benchmark instances from the literature and it is compared with a hybrid Genetic Algorithm.</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">185-204</efrbr-expression:note><efrbr-expression:note type="conference name">Adaptation and Hybridization in Computational Intelligence, Adaptation, Learning, and Optimization</efrbr-expression:note></efrbr-expression:expression><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="25D50F06-E8AE-4B04-8198-CF19B5283F48"><efrbr-person:nameOfPerson vocabulary="">
            Paraskevi Spanou
         </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/E033B572-D70C-4F68-BB0B-3FC67BA0E7E8" targetEntity="expression" targetURI="http://purl.tuc.gr/dl/dias/E033B572-D70C-4F68-BB0B-3FC67BA0E7E8"/></efrbr-structure:structureRelations><efrbr-responsible:responsibleRelations><efrbr-responsible:createdBy sourceEntity="work" sourceURI="http://purl.tuc.gr/dl/dias/E033B572-D70C-4F68-BB0B-3FC67BA0E7E8" targetEntity="person" targetURI="http://users.isc.tuc.gr/~mmarinaki"/><efrbr-responsible:realizedBy sourceEntity="expression" sourceURI="http://purl.tuc.gr/dl/dias/E033B572-D70C-4F68-BB0B-3FC67BA0E7E8" targetEntity="person" targetURI="http://users.isc.tuc.gr/~mmarinaki" role="author"/><efrbr-responsible:realizedBy sourceEntity="expression" sourceURI="http://purl.tuc.gr/dl/dias/E033B572-D70C-4F68-BB0B-3FC67BA0E7E8" targetEntity="person" targetURI="http://users.isc.tuc.gr/~imarinakis" role="author"/><efrbr-responsible:realizedBy sourceEntity="expression" sourceURI="http://purl.tuc.gr/dl/dias/E033B572-D70C-4F68-BB0B-3FC67BA0E7E8" targetEntity="person" targetURI="25D50F06-E8AE-4B04-8198-CF19B5283F48" role="author"/><efrbr-responsible:realizedBy sourceEntity="expression" sourceURI="http://purl.tuc.gr/dl/dias/E033B572-D70C-4F68-BB0B-3FC67BA0E7E8" targetEntity="person" targetURI="http://www.springerlink.com/?MUD=MP" role="publisher"/></efrbr-responsible:responsibleRelations><efrbr-subject:subjectRelations/><efrbr-other:otherRelations/></efrbr:relationships></efrbr:recordSet>