Show simple item record

dc.contributor.authorMavrovouniotis, Michalisen
dc.contributor.authorLi, Changheen
dc.contributor.authorYang, Shengxiangen
dc.contributor.authorYao, Xinen
dc.date.accessioned2016-04-14T12:35:47Z
dc.date.available2016-04-14T12:35:47Z
dc.date.issued2013-10
dc.identifier.citationMavrovouniotis, M., Li, C., Yang, S. and Yao, X. (2013) Benchmark Generator for the IEEE WCCI-2014 Competition on Evolutionary Computation for Dynamic Optimization Problems: Dynamic Travelling Salesman Problem Benchmark Generator. Technical Report 2013, School of Computer Science and Informatics, De Montfort University, U.K., October 2013en
dc.identifier.urihttp://hdl.handle.net/2086/11891
dc.description.abstractIn this report, the dynamic benchmark generator for permutation-encoded problems for the travelling salesman problem (DBGPTSP) proposed in is used to convert any static travelling salesman problem benchmark to a dynamic optimization problem, by modifying the encoding of the instance instead of the fitness landscape.en
dc.language.isoenen
dc.publisherDe Montfort University, U.K.en
dc.subjectBenchmark Generatoren
dc.subjectEvolutionary Computationen
dc.subjectDynamic Optimization Problemen
dc.subjectDynamic Travelling Salesman Problemen
dc.titleBenchmark Generator for the IEEE WCCI-2014 Competition on Evolutionary Computation for Dynamic Optimization Problems: Dynamic Travelling Salesman Problem Benchmark Generatoren
dc.typeTechnical Reporten
dc.identifier.doihttps://doi.org/10.13140/RG.2.1.3822.4729
dc.researchgroupCentre for Computational Intelligenceen
dc.peerreviewedNoen
dc.explorer.multimediaNoen
dc.funderEPSRC (Engineering and Physical Sciences Research Council)en
dc.projectidEP/K001310/1en
dc.cclicenceCC-BY-NCen
dc.researchinstituteInstitute of Artificial Intelligence (IAI)en


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record