A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
B. Takmare, Sachin
- A Review of Methodologies of TLBO Algorithm to Test the Performance of Benchmark Functions
Authors
1 Department of Computer Engineering, Bharati Vidyapeeth College of Engineering, Kolhapur, Maharashtra, IN
Source
Programmable Device Circuits and Systems, Vol 9, No 7 (2017), Pagination: 141-145Abstract
Like other nature-inspired algorithms, Teaching-Learning-Based Optimization (TLBO) is a population-based method that uses a population of solutions to proceed to the global solution. The motivation to develop a nature-based algorithm is its capacity to solve different optimization problems effectively and efficiently. It was assumed that the behavior of nature is always optimum in its performance. The Performance of algorithm on unconstrained and constrained benchmark functions was tested by running these algorithms sequentially. The main motivation of using parallel computing is to improve the performance of these algorithms. GPGPU is applicable where data parallelism and independency is possible, a good implementation on a General Purpose Graphics Processing Unit (GPGPU) can achieve more than 100 times better speedup over sequential execution. Compute Unified Device Architecture (CUDA) implementation proves better in the evolutionary algorithm regarding of speed up as well as convergence time.
Keywords
Compute Unified Device Architecture, Constrained Benchmark Function, General Purpose Graphics Processing Unit, Teaching-Learning-Based Optimization, and Unconstrained Benchmark Functions.
References
- D. O. Boyer, C. H. Martfnez, N. G. Pedrajas, CIXL2: “A Crossover Operator for Evolutionary Algorithms Based on Population Features.” J. Artif. Intell. Res.(JAIR) 24 (2005): 1-48.
- Rao R. V,V. J. Savsani, and D. P. Vakharia. “Teaching–learning-based optimization: A novel method for constrained mechanical design optimization problems.” Computer-Aided Design 43.3 (2011): 303-315.
- Luca Mussi, Fabio Daolio b, Stefano Cagnoni,“Evaluation of parallel particle swarm optimization algorithms within the CUDA™ architecture.” Information Sciences 181.20 (2011): 4642-4657.
- José M.Cecilia , José M. García a, Andy Nisbet b, Martyn Amosb, Manuel Ujaldón, “Enhancing data parallelism for Ant Colony Optimization on GPUs”, Journal of Parallel and Distributed Computing 73.1 (2013): 42-51
- Hofmann, Johannes, Steffen Limmer, and Dietmar Fey. “Performance investigations of genetic algorithms on graphics cards.” Swarm and Evolutionary Computation 12 (2013): 33-47.
- Audrey Delévacq a, Pierre Delisle a, Marc Gravel b, Michaël Krajecki a,”Parallel ant colony optimization graphics processing unit” Journal of Parallel and Distributed Computing 73(2013): 52-61
- Suresh Chandra Satapathy, “A teaching learning based optimization based on orthogonal design for solving global optimization problems.”SpringerPlus 2.1 (2013): 130.
- Taher Niknam, Rasoul Azizipanah-Abarghooee, and Jamshid Aghaei, “A New Modified Teaching-Learning Algorithm for Reserve Constrained Dynamic Economic Dispatch.” Vol.28, No.2, May 2013.
- Adil Baykasog, Alper Hamzadayi a, Simge Yelkenci Köse a, b, “Testing the performance of teaching–learning based optimization (TLBO) algorithm on combinatorial problems: Flow shop and job shop scheduling cases.” Information Sciences 276 (2014): 204-218.
- Guo-Heng Luo, “A parallel Bees Algorithm implementation on GPU.”Journal System.Architecture 60.3 (2014): 271-279.
- Feng Zou, Lei Wang, Xinhong Hei, Debao Chen, and Dongdong Yang, "Teaching learning- based optimization with dynamic group strategy for global optimization." Information- Sciences 273 (2014):112-131.
- Jitendra kumar Department of Physics & Computer Science, Dayalbagh Educational Institute, India ; Lotika Singh ; Sandeep Paul,”GPU based parallel cooperative particle swarm optimaization using C-CUDA:A case study”Fuzzy Systems (FUZZ), 2013 IEEE International Conference on1-8.
- Momin Jamil, Xin-She Yang,”A Literature survey of Benchmark functions for global optimization problem,” in Int.J Mathematical modelling and Numerical optimization,Blekinge Institute of Technolog.vol.4 ,no.2(2013)
- Ugur Cekmez, Mustafa Ozsiginan, Ozgur Koray Sahingoz,” Adapting the GA Approach to Solve Traveling Salesman Problems on CUDA Architecture,” 14th IEEE International Symposium on Computational Intelligence and Informatics • 19–21 November, 2013 :423-428
- Keesari, H. S., and R. V. Rao. "Optimization of job shop scheduling problems using teaching-learning-based optimization algorithm." OPSEARCH 51, no. 4 (2014): 545-561.
- Nageswara Reddy K and Dr.Padmanabhan G,”Teaching learning based optimization: An optimization technique for job shop scheduling,” http://www.researchgate.net/, March 2016.pp-19-24.
- Zhuo Wang,Renquan Lu,Debao chen,Feng zou,”An Experience Information TLBO for Global Optimization,” in IEEE Transactions on System, Man and Cybernetics:systems, sept2016.pp-1202-1214.