Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Journal of Experimental & Theoretical Artificial Intelligence
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.