Table of Contents Author Guidelines Submit a Manuscript
Journal of Mathematics
Volume 2016, Article ID 4015845, 10 pages
Research Article

Improving Genetic Algorithm with Fine-Tuned Crossover and Scaled Architecture

Department of Computer Science and Engineering, University of Bridgeport, 126 Park Avenue, Bridgeport, CT 06604, USA

Received 26 November 2015; Revised 13 March 2016; Accepted 21 March 2016

Academic Editor: Niansheng Tang

Copyright © 2016 Ajay Shrestha and Ausif Mahmood. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


Genetic Algorithm (GA) is a metaheuristic used in solving combinatorial optimization problems. Inspired by evolutionary biology, GA uses selection, crossover, and mutation operators to efficiently traverse the solution search space. This paper proposes nature inspired fine-tuning to the crossover operator using the untapped idea of Mitochondrial DNA (mtDNA). mtDNA is a small subset of the overall DNA. It differentiates itself by inheriting entirely from the female, while the rest of the DNA is inherited equally from both parents. This unique characteristic of mtDNA can be an effective mechanism to identify members with similar genes and restrict crossover between them. It can reduce the rate of dilution of diversity and result in delayed convergence. In addition, we scale the well-known Island Model, where instances of GA are run independently and population members exchanged periodically, to a Continental Model. In this model, multiple web services are executed with each web service running an island model. We applied the concept of mtDNA in solving Traveling Salesman Problem and to train Neural Network for function approximation. Our implementation tests show that leveraging these new concepts of mtDNA and Continental Model results in relative improvement of the optimization quality of GA.