<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/9D4749D3-2D47-4D87-BAE6-10F9EFCF5772"><efrbr-work:titleOfTheWork>A mayfly optimization algorithm</efrbr-work:titleOfTheWork></efrbr-work:work><efrbr-expression:expression identifier="http://purl.tuc.gr/dl/dias/9D4749D3-2D47-4D87-BAE6-10F9EFCF5772"><efrbr-expression:titleOfTheExpression>A mayfly optimization algorithm</efrbr-expression:titleOfTheExpression><efrbr-expression:formOfExpression vocabulary="DIAS:TYPES">
            Peer-Reviewed Journal Publication
            Δημοσίευση σε Περιοδικό με Κριτές
         </efrbr-expression:formOfExpression><efrbr-expression:dateOfExpression type="issued">2021-07-15</efrbr-expression:dateOfExpression><efrbr-expression:dateOfExpression type="published">2020</efrbr-expression:dateOfExpression><efrbr-expression:languageOfExpression vocabulary="iso639-1">en</efrbr-expression:languageOfExpression><efrbr-expression:summarizationOfContent>This paper introduces a new method called the Mayfly Algorithm (MA) to solve optimization problems. Inspired from the flight behavior and the mating process of mayflies, the proposed algorithm combines major advantages of swarm intelligence and evolutionary algorithms. To evaluate the performance of the proposed algorithm, 38 mathematical benchmark functions, including 13 CEC2017 test functions, are employed and the results are compared to those of seven state of the art well-known metaheuristic optimization methods. The MA’s performance is also assessed through convergence behavior in multi-objective optimization as well as using a real-world discrete flow-shop scheduling problem. The comparison results demonstrate the superiority of the proposed method in terms of convergence rate and convergence speed. The processes of nuptial dance and random flight enhance the balance between algorithm’s exploration and exploitation properties and assist its escape from local optima.</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">Computers and Industrial Engineering</efrbr-expression:note><efrbr-expression:note type="journal volume">145</efrbr-expression:note></efrbr-expression:expression><efrbr-person:person identifier="http://users.isc.tuc.gr/~kzervoudakis"><efrbr-person:nameOfPerson vocabulary="TUC:LDAP">
            Zervoudakis Konstantinos
            Ζερβουδακης Κωνσταντινος
         </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="https://v2.sherpa.ac.uk/id/publisher/30"><efrbr-corporateBody:nameOfTheCorporateBody vocabulary="S/R:PUBLISHERS">
            Elsevier
         </efrbr-corporateBody:nameOfTheCorporateBody></efrbr-corporateBody:corporateBody><efrbr-concept:concept identifier="54164026-E0E8-41E9-8B45-E7B323183960"><efrbr-concept:termForTheConcept>
            Mayfly algorithm
         </efrbr-concept:termForTheConcept></efrbr-concept:concept><efrbr-concept:concept identifier="38DAA406-5C39-44CA-A212-DE25F8487765"><efrbr-concept:termForTheConcept>
            Nature-inspired algorithm
         </efrbr-concept:termForTheConcept></efrbr-concept:concept><efrbr-concept:concept identifier="DA1C63BF-367F-446C-9D60-F6C7D00DB002"><efrbr-concept:termForTheConcept>
            Optimization
         </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/9D4749D3-2D47-4D87-BAE6-10F9EFCF5772" targetEntity="expression" targetURI="http://purl.tuc.gr/dl/dias/9D4749D3-2D47-4D87-BAE6-10F9EFCF5772"/></efrbr-structure:structureRelations><efrbr-responsible:responsibleRelations><efrbr-responsible:createdBy sourceEntity="work" sourceURI="http://purl.tuc.gr/dl/dias/9D4749D3-2D47-4D87-BAE6-10F9EFCF5772" targetEntity="person" targetURI="http://users.isc.tuc.gr/~kzervoudakis"/><efrbr-responsible:realizedBy sourceEntity="expression" sourceURI="http://purl.tuc.gr/dl/dias/9D4749D3-2D47-4D87-BAE6-10F9EFCF5772" targetEntity="person" targetURI="http://users.isc.tuc.gr/~kzervoudakis" role="author"/><efrbr-responsible:realizedBy sourceEntity="expression" sourceURI="http://purl.tuc.gr/dl/dias/9D4749D3-2D47-4D87-BAE6-10F9EFCF5772" targetEntity="person" targetURI="http://users.isc.tuc.gr/~tsafarakis" role="author"/><efrbr-responsible:realizedBy sourceEntity="expression" sourceURI="http://purl.tuc.gr/dl/dias/9D4749D3-2D47-4D87-BAE6-10F9EFCF5772" targetEntity="person" targetURI="https://v2.sherpa.ac.uk/id/publisher/30" role="publisher"/></efrbr-responsible:responsibleRelations><efrbr-subject:subjectRelations><efrbr-subject:hasSubject sourceEntity="work" sourceURI="http://purl.tuc.gr/dl/dias/9D4749D3-2D47-4D87-BAE6-10F9EFCF5772" targetEntity="concept" targetURI="54164026-E0E8-41E9-8B45-E7B323183960"/><efrbr-subject:hasSubject sourceEntity="work" sourceURI="http://purl.tuc.gr/dl/dias/9D4749D3-2D47-4D87-BAE6-10F9EFCF5772" targetEntity="concept" targetURI="38DAA406-5C39-44CA-A212-DE25F8487765"/><efrbr-subject:hasSubject sourceEntity="work" sourceURI="http://purl.tuc.gr/dl/dias/9D4749D3-2D47-4D87-BAE6-10F9EFCF5772" targetEntity="concept" targetURI="DA1C63BF-367F-446C-9D60-F6C7D00DB002"/></efrbr-subject:subjectRelations><efrbr-other:otherRelations/></efrbr:relationships></efrbr:recordSet>