A Benchmark Generator for Dynamic Optimization
نویسندگان
چکیده
Almost all real-world problems are dynamic and as such not all problem instances are known a priori. Many strategies to deal with dynamic problems exist in the literature, however they are not fully tested on combinatorial problems due to the deficiency of benchmarks. This paper presents a benchmark generator that uses Genetic Algorithms to produce benchmark problems for the dynamic traveling salesman problem. Various strategies of solving dynamic problems are compared on the new benchmarks. Generality of the Genetic Algorithm was retained so as it can be easily adapted for other kinds of combinatorial problems. Key-Words: dynamic optimization, traveling salesman problem, genetic algorithms, combinatorial problems.
منابع مشابه
Benchmark Generator for the IEEE WCCI-2014 Competition on Evolutionary Computation for Dynamic Optimization Problems Dynamic rotation peak benchmark generator (DRPBG) and Dynamic composition benchmark generator (DCBG)
Many realworld optimization problems are dynamic optimization problems (DOPs), where changes may occur over time regarding the objective function, decision variable, and constraints, etc. DOPs raise big challenges to traditional optimization methods as well as evolutionary algorithms (EAs). The last decade has witnessed increasing research efforts on handling dynamic optimization problems using...
متن کاملBenchmark Generator for the IEEE WCCI-2012 Competition on Evolutionary Computation for Dynamic Optimization Problems
Many realworld optimization problems are dynamic optimization problems (DOPs), where changes may occur over time regarding the objective function, decision variable, and constraints, etc. DOPs raise big challenges to traditional optimization methods as well as evolutionary algorithms (EAs). The last decade has witnessed increasing research efforts on handling dynamic optimization problems using...
متن کاملAnalysis of fitness landscape modifications in evolutionary dynamic optimization
In this work, discrete dynamic optimization problems (DOPs) are theoretically analysed according to the modifications produced in the fitness landscape during the optimization process. Using the proposed analysis framework, the following DOPs are analysed: problems generated by the XOR DOP generator, three versions of the dynamic 0–1 knapsack problem, one problem involving evolutionary robots i...
متن کاملClustering and Memory-based Parent-Child Swarm Meta-heuristic Algorithm for Dynamic Optimization
So far, various optimization methods have been proposed, and swarm intelligence algorithms have gathered a lot of attention by academia. However, most of the recent optimization problems in the real world have a dynamic nature. Thus, an optimization algorithm is required to solve the problems in dynamic environments well. In this paper, a novel collective optimization algorithm, namely the Clus...
متن کاملA Generalized Approach to Construct Benchmark Problems for Dynamic Optimization
There has been a growing interest in studying evolutionary algorithms in dynamic environments in recent years due to its importance in real applications. However, different dynamic test problems have been used to test and compare the performance of algorithms. This paper proposes a generalized dynamic benchmark generator (GDBG) that can be instantiated into the binary space, real space and comb...
متن کامل