Genetic Algorithm Application for Navigation System on Virtual Shop
Abstract views: 186

Genetic Algorithm Application for Navigation System on Virtual Shop

Andi Nagoro Syahputra, Ali Sofyan Kholimi, Lailatul Husniah


Online shop becomes one of the updated common types of shop in the era of rapidly grown technology development, yet this system provides its drawbacks. One of the problems which commonly found is a great deal of scamming practices for profit-oriented aims. Virtual shop is defined as a virtual reality application allowing its user to experience shopping in virtual world. A navigation system is required to enable its users in finding out the expected product. Genetic algorithm is one of many search algorithms based on natural selection and natural genetics. On this algorithm, data and string are executed through process of selection to generate problem solving solution. Using this algorithm, the navigation system is proved to be successful on generating path leading to expected product in the virtual shop.


Navigation System, Virtual Shop, Genetic Algorithm

Full Text:



[1] J. Isdale, “Introduction to VR technology,” IEEE Virtual Reality, 2003. Proceedings., p. 302, 2003.

[2] I. R. Karas and U. Atila, “A genetic algorithm approach for finding the shortest driving time on mobile devices,” Sci. Res. Essays, vol. 6, no. 2, pp. 394–405, 2011.

[3] S. Abeysundara, B. Giritharan, and S. Kodithuwakku, “A Genetic Algorithm Approach to Solve the Shortest Path Problem for Road Maps,” Proc. Int. Conf. Inf. Autom., pp. 272–275, 2005.

[4] I. D. Made, A. Baskara, and V. Nurcahyawati, “ISSN 2089-8673 Jurnal Nasional Pendidikan Teknik Informatika ( JANAPATI ) PULAU JAWA DENGAN MENGGUNAKAN ALGORITMA GENETIKA I . Pendahuluan ISSN 2089-8673 Jurnal Nasional Pendidikan Teknik Informatika ( JANAPATI ) II . Dasar Teori,” vol. 1, pp. 244–258, 2012.

[5] D. E. Goldberg and others, “Genetic algorithms in search, optimization, and machine learning,” Addison Wesley Publisching, vol. 412. 1989.

[6] D. E. Goldberg, “David E. Goldberg-Genetic Algorithms in Search, Optimization, and Machine Learning-Addison-Wesley Professional (1989).pdf.” p. 432, 1989.

[7] K. Deb, “An introduction to genetic algorithms,” Sadhana, vol. 24, no. 4–5, pp. 293–315, 1999.

[8] C. W. Ahn and R. S. Ramakrishna, “A genetic algorithm for shortest path routing problem and the sizing of populations,” IEEE Trans. Evol. Comput., vol. 6, no. 6, pp. 566–579, 2002.

[9] H. Fiori de Castro and K. Lucchesi Cavalca, “Availability optimization with genetic algorithm,” Int. J. Qual. Reliab. Manag., vol. 20, no. 7, pp. 847–863, 2003.

[10] M. Melanie, “An introduction to genetic algorithms,” Cambridge, Massachusetts London, England, …, p. 162, 1996.

[11] T. Lu and J. Zhu, “A genetic algorithm for finding a path subject to two constraints,” Appl. Soft Comput. J., vol. 13, no. 2, pp. 891–898, 2013.

[12] Z. H. Ahmed, “Genetic Algorithm for the Traveling Salesman Problem using Sequential Constructive Crossover Operator,” Int. J. Biometrics Bioinforma., vol. 3, no. 6, pp. 96–105, 2010.

[13] T. CHEN and C. CHEN, “Improvements of simple genetic algorithm in structural design,” Int. J. Numer. Methods Eng., vol. 40, no. 7, pp. 1323–1334, 1997.

[14] M. Buckland, AI Techniques for Game Programming, vol. 1, no. 3. 2002.

[15] Anies Hannawati, Thiang, and Eleazar, “Pencarian Rute Optimum Menggunakan Algoritma Genetika,” J. Tek. Elektro, vol. 2, no. 2, pp. 78–83, 2002.


  • There are currently no refbacks.

Referencing Software:

Checked by:

Supervised by:


View My Stats

Creative Commons License Kinetik : Game Technology, Information System, Computer Network, Computing, Electronics, and Control by is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.