Genetic Algorithm Performance with Different Selection Methods in Solving Multi-Objective Network Design Problem

Provided by: University of Illinois, Rehab Services
Topic: Mobility
Format: PDF
Selection is one of the key operations of Genetic Algorithm (GA). This paper presents a comparative analysis of GA performance in solving Multi-Objective Network Design Problem (MONDP) using different parent selection methods. Three problem instances were tested and results show that on the average tournament selection is the most effective and most efficient for 10-node network design problem, while Ranking & Scaling is the least effective and least efficient. For 21-node and 36-node network problems, Roulette Wheel is the least effective but most efficient while Ranking & Scaling equals and outperformed tournament in effectiveness and efficiency respectively.

Find By Topic