Local search for Hamiltonian Path with applications to clustering visitation paths

R Torres-Velázquez () and V Estivill-Castro
Additional contact information
R Torres-Velázquez: PHI Investigación Operativa para la alta Dirección de Empresas SA de CV, Av. Acoxpa 524-506A, Col. Prados Coapa
V Estivill-Castro: Griffith University

Journal of the Operational Research Society, 2004, vol. 55, issue 7, 737-748

Abstract: Abstract 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.

Keywords: bond energy algorithm (BEA); 2-opt; local search; clustering a matrix of attributes; cell formation problems (search for similar items in EconPapers)
Date: 2004
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1057/palgrave.jors.2601770 Abstract (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:pal:jorsoc:v:55:y:2004:i:7:d:10.1057_palgrave.jors.2601770

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/41274

DOI: 10.1057/palgrave.jors.2601770

Access Statistics for this article

Journal of the Operational Research Society is currently edited by Tom Archibald and Jonathan Crook

More articles in Journal of the Operational Research Society from Palgrave Macmillan, The OR Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().