We apologize for a recent technical issue with our email system, which temporarily affected account activations. Accounts have now been activated. Authors may proceed with paper submissions. PhDFocusTM
CFP last date
20 November 2024
Call for Paper
December Edition
IJCA solicits high quality original research papers for the upcoming December edition of the journal. The last date of research paper submission is 20 November 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

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

by R. O. Oladele, J. S. Sadiku
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 70 - Number 12
Year of Publication: 2013
Authors: R. O. Oladele, J. S. Sadiku
10.5120/12012-7848

R. O. Oladele, J. S. Sadiku . Genetic Algorithm Performance with Different Selection Methods in Solving Multi-Objective Network Design Problem. International Journal of Computer Applications. 70, 12 ( May 2013), 5-9. DOI=10.5120/12012-7848

@article{ 10.5120/12012-7848,
author = { R. O. Oladele, J. S. Sadiku },
title = { Genetic Algorithm Performance with Different Selection Methods in Solving Multi-Objective Network Design Problem },
journal = { International Journal of Computer Applications },
issue_date = { May 2013 },
volume = { 70 },
number = { 12 },
month = { May },
year = { 2013 },
issn = { 0975-8887 },
pages = { 5-9 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume70/number12/12012-7848/ },
doi = { 10.5120/12012-7848 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:32:39.422445+05:30
%A R. O. Oladele
%A J. S. Sadiku
%T Genetic Algorithm Performance with Different Selection Methods in Solving Multi-Objective Network Design Problem
%J International Journal of Computer Applications
%@ 0975-8887
%V 70
%N 12
%P 5-9
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

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.

References
  1. Razali, N. M. , Geraghty, J. 2011. Genetic Algorithm Performance with Different Selection Strategies in Solving TSP. In Proceedings of the World Congress on Engineering, vol. II, London, UK.
  2. Goldberg, D. E. and Deb Kalyanmoy. 1991. A Comparative Analysis of Selection Schemes Used in Genetic Algorithms. In: G. J. E. Rawlins (Ed), Foundations of Genetic Algorithms, Morgan Kaufmann, Los Altos, 69 – 93.
  3. Goh, K. S. , Lim, A. , Rodrigues, B. 2. . 3. Sexual Selection for Genetic Algorithms. Artificial Intelligence Review 19: 123 – 152, Kluwer Academic Publishers.
  4. Julstrom, B. A. 1999. It's All the Same to Me: Revisiting Rank-Based Probabilities and Tournaments, Department of Computer Science, St. Cloud State University.
  5. Mashohor, S. Evans, J. R. , Arslan, T. 2005. Elitist Selection Schemes for Genetic Algorithm based Printed Circuit Board Inspection System, Department of Electronics and Electrical Engineering, University of Edinburgh, 974 – 978.
  6. Zhong, J. , Hu, X. , Gu, M. , Zhang, J. 2005. Comparison of Performance between Different Selection Strategies on Simple Genetic Algorithms. In Proceeding of the International Conference on Computational Intelligence for Modelling, Control and automation, and International Conference of Intelligent Agents, Web Technologies and Internet Commerce.
  7. Jadaan, O. A. , Rajamani, L. , Rao, C. R. 2005. Improved Selection Operator for GA. Journal of Theoretical and Applied Information Technology.
  8. Banerjee, N. , Kumar, R. 2007. Multiobjective Network Design for Realistic Traffic Models. In Proc. Genetic and Evolutionary Computations Conference (GECCO-07), 1904-1911.
  9. Holland, J. H. 1992. Adaptation in Natural and Artificial Systems, 2nd Ed, MIT Press.
  10. Blickle, T, Thiele, L. A. 1995. Comparison of Selection Schemes used in Genetic Algorithms. TIK-Report, Zurich. .
  11. Whitley, D. 1989. The genitor algorithm and selection pressure: Why rank-based allocation of reproductive trials is the best. In Proceeding of the 3rd International Conference on Genetic Algorithms.
  12. Sivaraj, R. ,Ravichandran, T. 2011. A Review of Selection Methods in Genetic Algorithm. International Journal of Engineering Science and Technology (IJEST). Vol. 3, no. 5, 3792 – 3797.
Index Terms

Computer Science
Information Sciences

Keywords

Genetic Algorithm Selection Methods Network Design Problem Performance

Powered by PhDFocusTM