Benchmark Generator for the IEEE WCCI-2014 Competition on Evolutionary Computation for Dynamic Optimization Problems: Dynamic Travelling Salesman Problem Benchmark Generator

Date

2013-10

Advisors

Journal Title

Journal ISSN

ISSN

Volume Title

Publisher

De Montfort University, U.K.

Type

Technical Report

Peer reviewed

No

Abstract

In 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.

Description

Keywords

Benchmark Generator, Evolutionary Computation, Dynamic Optimization Problem, Dynamic Travelling Salesman Problem

Citation

Mavrovouniotis, 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 2013

Rights

Research Institute

Institute of Artificial Intelligence (IAI)