Skip to main content
padlock icon - secure page this page is secure

Genetic annealing with efficient strategies to improve the performance for the NP-hard and routing problems

Buy Article:

$61.00 + tax (Refund Policy)

problem which cannot be solved in polynomial time for asymptotically large values of and travelling salesman problem (TSP) is important in operations research and theoretical computer science. In this paper a balanced combination of genetic algorithm and simulated annealing has been applied. To improve the performance of finding an optimal solution from huge search space, we have incorporated the use of tournament and rank as selection operators, and inver-over operator mechanism for crossover and mutation. This proposed technique is applied for some routing resource problems in a chip design process and a best optimal solution was obtained, and the TSP appears as a sub-problem in many areas and is used as a benchmark for many optimisation methods.
No Reference information available - sign in for access.
No Citation information available - sign in for access.
No Supplementary Data.
No Article Media
No Metrics

Keywords: Lin–Kernighan algorithm; crossover operator; genetic algorithm; inver-over operator; selection operator; simulated annealing

Document Type: Research Article

Affiliations: 1: Jawaharlal Nehru Technological University, Kakinada, Andhra Pradesh, India 2: Indian Institute of Information Technology Design and Manufacturing, Kancheepuram, India 3: Jawaharlal Nehru Technological University, Anantapur, Andhra Pradesh, India

Publication date: November 2, 2015

More about this publication?
  • Access Key
  • Free content
  • Partial Free content
  • New content
  • Open access content
  • Partial Open access content
  • Subscribed content
  • Partial Subscribed content
  • Free trial content
Cookie Policy
Cookie Policy
Ingenta Connect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more