The distributed parallel genetic algorithm on the ad hoc network

  • Authors

    • Nima Afifi university of guilan
    • Hassan Tavakoli university of guilan
    2015-02-20
    https://doi.org/10.14419/jacst.v4i1.4162
  • Ad Hoc Networks, Distributed Algorithm, Parallel Computations, Genetic Algorithm, Optimization.

  • Abstract

    Today, mobile computing is one of the important issues in computer and network sciences. Using the processing power of mobile devices purposefully for solving complex issues is one of the research fields for researchers. One of the important issues in the optimization which needs a high processing power for finding the best possible answer is travelling salesman problem. In this paper, by providing a method based on the distributed parallel genetic algorithm on a number of mobile nodes in the Ad Hoc network, it was attempted to increase the speed of finding the best answer for the travelling salesman algorithm.

  • References

    1. [1] Mario Gerla, “Ad Hoc Networks", Springer, "Ad hoc Networks Technologies and Protocols ", Chapter 3, PP. 1-22, 2005.

      [2] N. Fernando, S.W. Loke, W. Rahayu, " Mobile cloud computing: A survey ", Future Generation Computer Systems, Vol. 29, Issue 1, pp. 84-106, Jan. 2013. http://dx.doi.org/10.1016/j.future.2012.05.023.

      [3] L. Kulik, " Mobile Computing Systems Programming: A Graduate Distributed Computing Course ", Distributed Systems Online, IEEE, Vol. 8, Issue 5, May 2007.

      [4] M. Gorges-Schleuter," Explicit parallelism of Genetic Algorithms through population structures ", Parallel Problem Solving from Nature, pp. 150–159, 1991.

      [5] T.Starkweather, D.Whitley, K. Mathias, "Optimization using distributed Genetic Algorithms ", Parallel Problem Solving from Nature, 1991.

      [6] Harun RaÅŸit Er, Nadia ErdoÄŸan ," Parallel Genetic Algorithm to Solve Traveling Salesman Problem on MapReduce Framework using Hadoop Cluster ", International Journal of Soft Computing and Software Engineering [JSCSE], Vol. 3, No. 3, pp. 380-386, 2013.

      [7] Saloni Gupta, Poonam Panwar, “Solving Travelling Salesman Problem Using Genetic Algorithm ", International Journal of Advanced Research in Computer Science and Software Engineering, Vol. 3, Issue 6, Jun. 2013.

      [8] Mohandas, G. Silas, S., Sam, S., " Survey on routing protocols on mobile adhoc networks ", Automation, Computing, Communication, Control and Compressed Sensing (iMac4s), International Multi-Conference, pp. 514-517, march 2013.

      [9] Krishna Gorantala, “Routing Protocols in Mobile Ad hoc Networks ", Master Thesis in Computing Science, Umea University, June 2006.

      [10] ChetanChudasama, S. M. Shah and Mahesh Panchal, “Comparison of Parents Selection Methods of Genetic Algorithm for TSP ", International Conference on Computer Communication and Networks (CSI- COMNET), 2011.

      [11] Dwivedi, TarunaChauhan,SanuSaxena and PrincieAgrawal, " Travelling Salesman Problem using Genetic Algorithm ", International Journal of Computer Applications(IJCA), pp. 25-30, 2012.

      [12] Gábor Renner, Anikó Ekárt, " Genetic algorithms in computer aided design ", Computer-Aided Design, Vol. 35, Issue 8, pp. 709-726, July 2003. http://dx.doi.org/10.1016/S0010-4485(03)00003-4.

  • Downloads

  • How to Cite

    Afifi, N., & Tavakoli, H. (2015). The distributed parallel genetic algorithm on the ad hoc network. Journal of Advanced Computer Science & Technology (JACST), 4(1), 75-83. https://doi.org/10.14419/jacst.v4i1.4162

    Received date: 2015-01-12

    Accepted date: 2015-02-10

    Published date: 2015-02-20