• العربية
    • English
  • English 
    • العربية
    • English
  • Login
Home
Publisher PoliciesTerms of InterestHelp Videos
Submit Thesis
IntroductionIUGSpace Policies
JavaScript is disabled for your browser. Some features of this site may not work without it.
View Item 
  •   Home
  • Faculty of Engineering
  • Staff Publications- Faculty of Engineering
  • View Item
  •   Home
  • Faculty of Engineering
  • Staff Publications- Faculty of Engineering
  • View Item

Please use this identifier to cite or link to this item:

http://hdl.handle.net/20.500.12358/24659
TitleProposed Algorithms to solve Big Data traveling salesman problem
Untitled
Abstract

Big data is one of the most concerned topics in business today across information technology sectors. most research fields toward using big data tools to leverage from the huge data that available today. The traveling salesman problem is one of problems that is growth by increasing the input as a factorial (n!). therefore it is important to find algorithm to solve big number of cities with feasible time and within available memory space. This article introduces two proposed algorithms to solve traveling salesman problem by clustering using three methods; k-means, Gaussian Mixture Model, and Self-Organizing Map to select the best one for proposed algorithms. The proposed algorithms depend on arranging the cities (points) in chromosomes for Genetic Algorithm after clustering the big data to reduce the problem and solving each cluster separately based on divide and conquer concept. The two proposed algorithms tested by applying on different number of points, the nearest points algorithm solved traveling salesman problem with 2 million points. number of terabytes (thousands of gigabytes). We assume that, as technology advances over time, the size of datasets that qualify as big data will also increase. Also note that the definition can vary by sector, depending on what kinds of software tools are commonly available and what sizes of datasets are common in a particular industry. With those caveats, big data in many sectors today will range from a few dozen terabytes to multiple petabytes (thousands of terabytes)." [3]. 2. Traveling Salesman Problem (TSP)

Authors
Alhanjouri, Mohammed A.
TypeJournal Article
Date2018
Subjects
gaussian mixture model
and self-organizing map
big data clustering
traveling salesman problem
k- means
Published inInternational Journal of Innovative Science, Engineering & Technology
SeriesVolume: 5, Number: 6
PublisherIJISET
Citation
Item linkItem Link
License
Collections
  • Staff Publications- Faculty of Engineering [908]
Files in this item
PaperNo3.pdf453.7Kb
Thumbnail

The institutional repository of the Islamic University of Gaza was established as part of the ROMOR project that has been co-funded with support from the European Commission under the ERASMUS + European programme. This publication reflects the views only of the author, and the Commission cannot be held responsible for any use which may be made of the information contained therein.

Contact Us | Send Feedback
 

 

Browse

All of IUGSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsSupervisorsThis CollectionBy Issue DateAuthorsTitlesSubjectsSupervisors

My Account

LoginRegister

Statistics

View Usage Statistics

The institutional repository of the Islamic University of Gaza was established as part of the ROMOR project that has been co-funded with support from the European Commission under the ERASMUS + European programme. This publication reflects the views only of the author, and the Commission cannot be held responsible for any use which may be made of the information contained therein.

Contact Us | Send Feedback