Generalized benchmark generation for dynamic combinatorial problems

Several general purpose benchmark generators are now available in the literature. They are convenient tools in dynamic continuous optimization as they can produce test instances with controllable features. Yet, a parallel work in dynamic discrete optimization still lacks. In constructing benchmarks for dynamic combinatorial problems, two issues should be addressed: first, test cases that can effectively test an algorithm ability to adapt can be difficult to create; second, it might be necessary to optimize several instances of an NP-hard problem. Hence, this paper proposes a method for generating benchmarks with known solutions without the need to re-optimize. Consequently, the method does not suffer the usual limitations on the problem size or the sequence length. The paper also proposes a general framework for the generation of test problems. It aims to unify existing approaches and to form a basis for designing newer benchmarks. Such a framework can be more appreciated knowing that...

• Type: Conference
• Year: 2005
• Where: GECCO
• Authors: Abdulnasser Younes, Paul H. Calamai, Otman A. Basir
• Keywords: Combinatorial Problems, Dynamic Combinatorial Problems, Dynamic Continuous Optimization, GECCO 2005