Title: Two new selection methods and their effects on the performance of genetic algorithm in solving supply chain and travelling salesman problems

Authors: Sadegh Eskandari; Marjan Kuchaki Rafsanjani

Addresses: Department of Computer Science, Faculty of Mathematics and Computer, Shahid Bahonar University of Kerman, Kerman, Iran; Department of Computer Science, University of Guilan, Rasht, Iran ' Department of Computer Science, Faculty of Mathematics and Computer, Shahid Bahonar University of Kerman, Kerman, Iran

Abstract: Genetic algorithm (GA) is a well-known evolutionary optimisation method in various operational research areas. Selection is an important operator in GA that provides a trade-off between exploitation and exploration aspects of genetic algorithm. In this paper, two new combinational selection methods called generational sequential mixed selection (GSMS) and generational random mixed selection (GRMS) are presented and compared with six existing selection operators, applied to supply chain network (SCN) design and travelling salesman problems (TSP). The experiments show that the proposed operators achieve better results than existing operators, in every way. Moreover, several state-of-the-art methods are compared with genetic algorithm versions, which adopt the proposed operators. The results on 15 TSPs show that our approach is superior in ten cases. Moreover, the results on ten SCN instances show the superiority of the proposed approach in 50% of the cases.

Keywords: genetic algorithms; GA; selection operators; supply chain network; SCN; travelling salesman problems; TSP.

DOI: 10.1504/IJBIC.2023.135464

International Journal of Bio-Inspired Computation, 2023 Vol.22 No.3, pp.176 - 184

Received: 20 Jan 2022
Accepted: 26 Dec 2022

Published online: 14 Dec 2023 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article