Genetic Algorithms (GA) are robust search techniques that have emerged to be effective for a variety of search and optimization problems. The primary goal of this chapter is to explore various Genetic Algorithm (GA) based automation methods for solving route optimization problems. Three real world problems: Traveling Salesman, Mobile Robot Path-Planning and VLSI global routing are considered here for discussion. All the three problems are Nondeterministic Polynomial (NP)-complete problems and require a heuristic algorithm to produce acceptable solutions in a reasonable time.
Paper
Full text
Genetic Algorithm Based Automation Methods for Route Optimization Problems
Semantic Scholar · Computer Science · 2012
Abstract
Genetic Algorithms (GA) are robust search techniques that have emerged to be effective for a variety of search and optimization problems. The primary goal of this chapter is to explore various Genetic Algorithm (GA) based automation methods for solving route optimization problems. Three real world problems: Traveling Salesman, Mobile Robot Path-Planning and VLSI global routing are considered here for discussion. All the three problems are Nondeterministic Polynomial (NP)-complete problems and require a heuristic algorithm to produce acceptable solutions in a reasonable time.
References (23)
Scroll for more · 11 remaining