2 results for “Traveling Salesman Problem with Multi-Relations (TSPMR)”

Set a search alert

Research ArticleOpen accessIn the keywordsAn 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 PDF Cite

Research ArticleOpen accessIn the keywordsApplication 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 PDF Cite