This paper presents a new approach for solving network flow optimization problems. In particular, the goal is to optimize the traffic in the network structured event-driven systems as well as to provide means for efficient adaptation of the system to changes in the environment - i.e., when some nodes and/or links fail. Many network flow optimization problems belong to the class of NP hard problems, which can only be solved by using some heuristic approach. In this paper we describe an application of a recently introduced iterative optimization algorithm with evolved improvement steps. This algorithm is well suited for solving hard discrete combinatorial problems as well as rescheduling-like problems; thus it fits the addressed adaptability issue very well
['Jiri Kubalik', 'Richard Mordinyi']
Optimizing Events Traffic in Event-based Systems by means of Evolutionary Algorithms