Optimization of travelling salesman problem with precedence constraint using modified GA encoding
One of the challenges in combinatorial optimization is to optimize travelling salesman problem with precedence constraint (TSPPC). The optimization algorithm to deal with this problem is continuously developed and improved to enhance its performance. Genetic algorithm (GA) is one of popular algorith...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
American Scientific Publishers
2018
|
| Subjects: | |
| Online Access: | http://umpir.ump.edu.my/id/eprint/22512/ http://umpir.ump.edu.my/id/eprint/22512/ http://umpir.ump.edu.my/id/eprint/22512/ http://umpir.ump.edu.my/id/eprint/22512/1/ICIST%20UMS%20Optimization%20of%20Travelling%20Salesman%20Problem%20with%20Precedence%20Constraint%20using%20Modified%20GA%20Encoding_ICIST.pdf |
| Summary: | One of the challenges in combinatorial optimization is to optimize travelling salesman problem with precedence constraint (TSPPC). The optimization algorithm to deal with this problem is continuously developed and improved to enhance its performance. Genetic algorithm (GA) is one of popular algorithm used to optimize TSPPC. In this work, the Genetic algorithm is improved by using a discrete encoding instead of continuous encoding. The numerical experimental results indicated that the proposed algorithm able to search for optimal solution faster compared with original encoding. |
|---|