Genetic Algorithm Approach to Solve the Shortest Disjoint Path Problem for Optimized Rainbow Network Flow of Multiple Description Codes
Mark Stephen Leeson, Evor L. Hines · 2009
The network flow of multiple description codes (MDCs) is considered and the idea of routing as finding paths for a rainbow of colours (rainbow network flow or RNF) incorporated. An optimized RNF of MDCs that utilises a genetic algorithm (GA) is presented. The GA is used to find the shortest disjoint paths between source node and the destination node to optimize the amount of outgoing MDC packets or provide maximal performance of the bandwidth capacity of every single route for image transmission across the network. The GA based method finds the optimum solution and the effects of variations in GA parameters are investigated.