Share Your Research, Maximize Your Social Impacts
Chess Knight Path Problem Solved by a Parallel Evolutionary Algorithm Implemented in Cuda
Journal: International Journal of Mechanical and Production Engineering Research and Development (IJMPERD ) (Vol.10, No. 5)Publication Date: 2020-10-31
Authors : Roberto M. Poveda Chaves Orlando García Hurtado; Edwin Rivas Trujillo;
Page : 171-178
Keywords : Knight path problem; Graphics Processing Unit (GPU); Fine-Grained Parallel Evolutionary Algorithms (FPEA); Quadratic Assignment Problem (QAP) & 2-opt Local Search Heuristic;
Source : Download
Find it from : Google Scholar
Abstract
We presents in this paper a solution to the classic knight travel problem on an chessboard using a finegrained evolutionary algorithm implemented completely in parallel on a GPU and developed on the CUDA interface. In our Parallel Algorithm, the population is a grid of a GPU, an individual is a block of a GPU, and a chromosome gene encoding an individual is a thread of the GPU.
Other Latest Articles
- Wireless Sensor Networks Integration With IOT To Smart Farm
- BANKING AND INNOVATION DEVELOPMENT FEATURES IN UKRAINE
- THE ECONOMIC SUMMARY OF INSURANCE COMPANIES FINANCIAL SECURITY MECHANISM
- MODIFICATIONS OF INNOVATIVE BUSINESS MODELS OF FINANCIAL COMPANIES
- PLANNING FOREIGN ECONOMIC ACTIVITIES OF ENTERPRISES IN THE GLOBALIZATION OF INTERNATIONAL ECONOMY
Last modified: 2021-03-18 21:48:54