<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/76399A45-7E40-4C97-9F19-E81BF24B2405"><efrbr-work:titleOfTheWork>A bilevel particle swarm optimization algorithm for supply chain management problems</efrbr-work:titleOfTheWork></efrbr-work:work><efrbr-expression:expression identifier="http://purl.tuc.gr/dl/dias/76399A45-7E40-4C97-9F19-E81BF24B2405"><efrbr-expression:titleOfTheExpression>A bilevel particle swarm optimization algorithm for supply chain management problems</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">2013</efrbr-expression:dateOfExpression><efrbr-expression:languageOfExpression vocabulary="iso639-1">en</efrbr-expression:languageOfExpression><efrbr-expression:summarizationOfContent>Nature inspired methods are approaches that are used in various fields and for the solution for a number of problems. In this study, a new bilevel particle swarm optimization algorithm is proposed for solving two well known supply chain management problems, the Vehicle Routing Problem and the Location Routing Problem. The results of the algorithms are compared with the results of algorithms that solve these problems with a single objective function and with a bilevel genetic algorithm. As most of the decisions in Supply Chain Management are taken in different levels, the study presented in this paper has two main goals. The first one is to give to the decision maker the possibility to formulate the supply chain management problems as bilevel or multilevel problems and the second one is to propose an efficient nature inspired algorithm that solves this kind of problems.</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">69-93</efrbr-expression:note><efrbr-expression:note type="conference name">Metaheuristics for Bi-level Optimization, Studies in Computational Intelligence</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-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/76399A45-7E40-4C97-9F19-E81BF24B2405" targetEntity="expression" targetURI="http://purl.tuc.gr/dl/dias/76399A45-7E40-4C97-9F19-E81BF24B2405"/></efrbr-structure:structureRelations><efrbr-responsible:responsibleRelations><efrbr-responsible:createdBy sourceEntity="work" sourceURI="http://purl.tuc.gr/dl/dias/76399A45-7E40-4C97-9F19-E81BF24B2405" targetEntity="person" targetURI="http://users.isc.tuc.gr/~imarinakis"/><efrbr-responsible:realizedBy sourceEntity="expression" sourceURI="http://purl.tuc.gr/dl/dias/76399A45-7E40-4C97-9F19-E81BF24B2405" targetEntity="person" targetURI="http://users.isc.tuc.gr/~imarinakis" role="author"/><efrbr-responsible:realizedBy sourceEntity="expression" sourceURI="http://purl.tuc.gr/dl/dias/76399A45-7E40-4C97-9F19-E81BF24B2405" targetEntity="person" targetURI="http://users.isc.tuc.gr/~mmarinaki" role="author"/><efrbr-responsible:realizedBy sourceEntity="expression" sourceURI="http://purl.tuc.gr/dl/dias/76399A45-7E40-4C97-9F19-E81BF24B2405" targetEntity="person" targetURI="http://www.springerlink.com/?MUD=MP" role="publisher"/></efrbr-responsible:responsibleRelations><efrbr-subject:subjectRelations/><efrbr-other:otherRelations/></efrbr:relationships></efrbr:recordSet>