Optimizing the average network throughput with evolutionary algorithms

الملخص EN

The paper presents a new evolutionary algorithm (EA) to solve the capacity allocation problem to a given network topology such that the average network throughput (ANT) is maximized.

Also, the problem can be defined as, find the maximum ANT such that the total cost of link capacities does not exceed the specified upper bound.

The proposed EA uses an encoding that represents the link options of the network topology while repairing the infeasible solutions using an additional repair heuristic RC (Repair Capacity) mechanism.

In experimental results, we compare the obtaining results with other previous approaches.