Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 1 of 1
Full-Text Articles in Engineering
A Hybrid Lehmer Code Genetic Algorithm And Its Application On Traveling Salesman Problems, Jun Zhang
A Hybrid Lehmer Code Genetic Algorithm And Its Application On Traveling Salesman Problems, Jun Zhang
Engineering Management & Systems Engineering Theses & Dissertations
Traveling Salesman Problems (TSP) is a widely studied combinatorial optimization problem. The goal of the TSP is to find a tour which begins in a specific city, visits each of the remaining cities once and returns to the initial cities such that the objective functions are optimized, typically involving minimizing functions like total distance traveled, total time used or total cost.
Genetic algorithms were first proposed by John Holland (1975). It uses an iterative procedure to find the optimal solutions to optimization problems.
This research proposed a hybrid Lehmer code Genetic Algorithm. To compensate for the weaknesses of traditional genetic …