Preprint Article Version 1 NOT YET PEER-REVIEWED

Construct Linear Polynomial Complementary Transformation for NP-Completeness Using Parallel Genetic Algorithm

  1. Department of Computer Science, University of Bridgeport, 126 Park Ave, Bridgeport, CT 06604, USA
Version 1 : Received: 3 November 2016 / Approved: 7 November 2016 / Online: 7 November 2016 (04:57:46 CET)

How to cite: Eltaeib, T.; Dichter, J. Construct Linear Polynomial Complementary Transformation for NP-Completeness Using Parallel Genetic Algorithm. Preprints 2016, 2016110033 (doi: 10.20944/preprints201611.0033.v1). Eltaeib, T.; Dichter, J. Construct Linear Polynomial Complementary Transformation for NP-Completeness Using Parallel Genetic Algorithm. Preprints 2016, 2016110033 (doi: 10.20944/preprints201611.0033.v1).

Abstract

This paper examines the correlation between numbers of computer cores in parallel genetic algorithms. The objective to determine the linear polynomial complementary equation in order represent the relation between number of parallel processing and optimum solutions. Model this relation as optimization function (f(x)) which able to produce many simulation results. F(x) performance is outperform genetic algorithms. Compression results between genetic algorithm and optimization function is done. Also the optimization function give model to speed up genetic algorithm. Optimization function is a complementary transformation which maps a TSP given to linear without changing the roots of the polynomials.

Subject Areas

genetic algorithms; parallel computation; computational complexity; algorithms; optimization techniques; traveling salesman problem; NP-Hard problems; Berlin-52 data set; machine learning; linear regression

Readers' Comments and Ratings (0)

Discuss and rate this article
Views 68
Downloads 72
Comments 0
Metrics 0
Discuss and rate this article

×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.