Research ArticleOpen accessPhrase in the titleA Gaussian Process Regression Model for the Traveling Salesman ProblemWanatchapong Kongkaew, Juta PichitlamkenProblem statement: Traveling Salesman Problem (TSP) is a famous NP hard problem. Many approaches have been proposed up to date for solving TSP. We consider a TSP tour as a dependent variable and its corresponding distance as an independent variable. If a predictive function can be formulated from arbitrary sample tours, the optimal tour may be predicted from this function. … …Journal of Computer Science, Vol. 8, Issue 10 · 30 Aug 2012 · 7,367 accessesView PDFCite
Research ArticleOpen accessPhrase in the titleApplication of Hybrid Encoding Genetic Algorithm on Pickup and Delivery Traveling Salesman Problem with Traffic ConditionsSupat PatvichaichodProblem statement: This study deals with the pickup and delivery traveling salesman problem with traffic conditions (PDTSPTW), an extension of the pickup and delivery traveling salesman problem (PDTSP) where each customer to be served is associated with two quantities of product to be collected and delivered. Almost PDTSP problems uses distance between each point of customers as Euclidean Distance and … …Journal of Computer Science, Vol. 7, Issue 5 · 7 May 2011 · 6,779 accessesView PDFCite
Research ArticleOpen accessPhrase in the titleAn Improved Genetic Algorithm for the Traveling Salesman Problem with Multi-RelationsSupat PatvichaichodProblem statement: The aim of this research is to investigate the Traveling Salesman Problems with Multi-Relations (TSPMR) in which each of the vertices has several edges and different weights. The study concerns the weights fluctuated by time in which the problem has more complexity than general TSP problem. However, this type of problem closes to the real-world situation in engineering … …Journal of Computer Science, Vol. 7, Issue 1 · 14 Jan 2011 · 6,924 accessesView PDFCite
Research ArticleOpen accessPhrase in the titleThe Traveling Salesman Problem as a Benchmark Test for a Social-Based Genetic AlgorithmN. A. AL-Madi, A. T. KhaderPresent research, showed Traveling Salesman Problem (TSP) to compare values and results concerning the averages and best fits of both, Simple Standard Genetic Algorithm (SGA) and a new approach of Genetic Algorithms named Social-Based Genetic Algorithm (SBGA). Results from TSP test on Social-Based Genetic Algorithms (SBGA) were presented. Results were encouraging in Social-Based Genetic Algorithms (SBGA) performs better in finding … …Journal of Computer Science, Vol. 4, Issue 10 · 31 Oct 2008 · 6,843 accessesView PDFCite
Research ArticleOpen accessPhrase in the titleSolving the Traveling Salesman Problem Using New Operators in Genetic AlgorithmsNaef Taher Al Rahedi, Jalal AtoumProblem statement: Genetic Algorithms (GAs) have been used as search algorithms to find near-optimal solutions for many NP problems. GAs require effective chromosome representations as well as carefully designed crossover and mutation operators to achieve an efficient search. The Traveling Salesman Problem (TSP), as an NP search problem, involves finding the shortest Hamiltonian Path or Cycle in a graph of … …American Journal of Applied Sciences, Vol. 6, Issue 8 · 31 Aug 2009 · 7,584 accessesView PDFCite
Research ArticleOpen accessIn the keywordsNew Integer Programming Formulations of the Generalized Travelling Salesman ProblemPetrica C. PopThe Generalized Travelling Salesman Problem, denoted by GTSP, is a variant of the classical travelling salesman problem (TSP), in which the nodes of an undirected graph are partitioned into node sets (clusters) and the salesman has to visit exactly one node from every cluster. In this paper we described six distinct formulations of the GTSP as an integer programming. Apart … …American Journal of Applied Sciences, Vol. 4, Issue 11 · 30 Nov 2007 · 7,200 accessesView PDFCite
Research ArticleOpen accessIn the abstractDNA Code Word Design for DNA Computing with Real-Time Polymerase Chain ReactionMuhammad Faiz Mohamed Saaid, Zuwairie Ibrahim, Mohamad Shukri Zainal Abidin et al.Problem statement: A number of DNA computing models to solve mathematical graph problem such as the Hamiltonian Path Problem (HPP), Traveling Salesman Problem (TSP), and the Shortest Path Problem (SPP), have been proposed and demonstrated. Normally, the DNA sequences used for the computation should be critically designed in order to reduce error that could occur during a computation. We have … …Journal of Computer Science, Vol. 5, Issue 1 · 31 Jan 2009 · 7,502 accessesView PDFCite
Research ArticleOpen accessIn the abstractEmbedding Malaysian House Red Ant Behavior into an Ant Colony SystemZ. A. Othman, H. M. Rais, A. R. HamdanProblem statement: Ant Colony System (ACS) is the most popular algorithm used to find a shortest path solution in Traveling Salesman Problem (TSP). Several ACS versions have been proposed which aim to achieve an optimum solution by adjusting pheromone levels. However, it still has a room on an improvement. This research aims to improve the algorithm by embedding individual Malaysian … …Journal of Computer Science, Vol. 4, Issue 11 · 30 Nov 2008 · 6,961 accessesView PDFCite
Research ArticleOpen accessIn the abstractMemory Convergence and Optimization with Fuzzy PSO and ACSSubhash C. Pandey, Dr. P. MisraAssociative neural memories are models of biological phenomena that allow for the storage of pattern associations and the retrieval of the desired output pattern upon presentation of a possibly noisy or incomplete version of an input pattern. In this study, we introduce fuzzy swarm particle optimization technique for convergence of associative neural memories based on fuzzy set theory. A Fuzzy … …Journal of Computer Science, Vol. 4, Issue 2 · 28 Feb 2008 · 7,169 accessesView PDFCite
Research ArticleOpen accessAll words, across the recordArtificial Bee Colony based Energy Aware and Energy Efficient Routing ProtocolP. Visu, S. Koteeswaran, J. JanetProblem statement: Network becomes very important technology in the day to day life style of modern computer era, in which the wireless communication become very popular for the last few years. In the same manner, the other wireless network, i.e., ado network is very popular among the researchers in the past few decades. Approach: The Ad hoc networks are defined … …Journal of Computer Science, Vol. 8, Issue 2 · 19 Jan 2012 · 7,095 accessesView PDFCite