Stratified opposition-based initialization for variable-length chromosome shortest path problem evolutionary algorithms. (15th May 2021)

• Record Type: Journal Article
• Authors: Ghannami, Aiman; Li, Jing; Hawbani, Ammar; Al-Dubai, Ahmed
• Is Part Of: Expert systems with applications. Volume 170(2021)
• Publication Date: 2021-05-15
• Subjects: Shortest path problem -- Initialization -- Genetic algorithm -- Network kriging; Expert systems (Computer science) -- Periodicals; Systèmes experts (Informatique) -- Périodiques; Electronic journals; 006.33
• DOI: 10.1016/j.eswa.2020.114525
• Languages: English
• ISSNs: 0957-4174

Abstract

Highlights: Stratified sampling reduces genotype diversify thus reducing exploration time. Opposition-Based guessing increases initial population fitness. Path Length diversity is more important during the initialization phase. The repair function can introduce diversity to population. Abstract: Initialization is the first and a major step in the implementation of evolutionary algorithms (EAs). Although there are many common general methods to initialize EAs such as the pseudo-random number generator (PRNG), there is no single method that can fit every problem. This study provides a new, flexible, diversity-aware, and easy-to-implement initialization method for a genetic algorithm for the shortest path problem. The proposed algorithm, called stratified opposition-based sampling (SOBS), considers phenotype and genotype diversity while striving to achieve the best fitness for the initialization population. SOBS does not depend on a specific type of sampling, because the main goal is to stratify the sampling space. SOBS aims at an initial population with higher fitness and diversity in the phenotype and genotype. To investigate the performance of SOBS, four network models were used to simulate real-world networks. Compared with the most frequently used initialization method, that is, PRNG, SOBS provides more accurate solutions, better running time with less memory usage, and an initial population with higher fitness. Statistical analysis showed that SOBS yields solutions with higher accuracy in 68–100% of the time. Although this study was focused on the genetic algorithm, it can be applied to other population-based EAs that solve the shortest path problem and use the same direct population representation such as particle swarm optimization (PSO).