G. Andal Jayalakshmi

Learn More
This paper introduces three new heuristics for the Euclidean Traveling Salesman Problem (TSP). One of the heuristics called Initialization Heuristics (IH) is applicable only to the Euclidean TSP, while other two heuristics RemoveSharp and LocalOpt can be applied to all forms of symmetric and asymmetric TSPs. A Hybrid Genetic Algorithm (HGA) has been(More)
Association rule mining is to find out association rules that satisfy the predefined minimum support and confidence from a given database. End users of association rule mining tools encounter several in practice when data bases come with binary attributes. In this paper, we introduce a new measure, which does not require initially allotted weights .The(More)
Global routing for VLSI circuits has received wide attraction. In this paper we have presented a Hybrid CHC (HCHC) genetic algorithm for global routing. The hybridization is required for initializing population with feasible solutions. The CHC algorithm is used for evolution. The algorithm was tested for standard test problems and compared with a simple GA.(More)
P2P network is a popular technology used for sharing and searching files on the computers connected to the network. Current search mechanisms of peer-to-peer (P2P) systems can well handle a single keyword search problem. Other than single keyword search, multi keyword search is very popular and useful in many file sharing applications. For multi keyword(More)
  • 1