Local Search for Hamiltonian Path with Applications to Clustering Visitation Paths
MetadataShow full item record
Clustering a data array has been found useful in the design of web-sites and distributed database system. We show that a critical step during this clustering process is related to solving the Longest Hamiltonian Path Problem, a well known NP-complete problem. Using the grouping of visitation paths of web-users as a case study, we test several heuristic algorithms. As a result of our experiments, we identify a successful method for dealing with this problem. Our algorithm spends less CPU time and provides better quality solutions than the most recent approach.
Journal of the Operational Research Society
The definitive publisher-authenticated version Journal of the Operational Research Society (2004) 55, 737-748 is available online at: http://www.palgrave-journals.com/jors/journal/v55/n7/abs/2601770a.html