2 citations · 5 across the 3 of their papers we have counts for
3 papers
cs.OH2012★ 2 cited
Optimal tree for Genetic Algorithms in the Traveling Salesman Problem (TSP)
Sing Liew
In this paper, the author proposes optimal tree as a "gauge" for the generation of the initial population at random in the Genetic Algorithms (GA) to benchmark against the good and…
cs.OH2012★ 1 cited
Applying convex layers, nearest neighbor and triangle inequality to the Traveling Salesman Problem (TSP)
Sing Liew
The author would like to propose a simple but yet effective method, convex layers, nearest neighbor and triangle inequality, to approach the Traveling Salesman Problem (TSP). No co…
cs.OH2012★ 2 cited
Introducing convex layers to the Traveling Salesman Problem
Sing Liew
In this paper, we will propose convex layers to the Traveling Salesman Problem (TSP). Firstly, we will focus on human performance on the TSP. Experimental data shows that untrained…