A genetic simplified swarm algorithm for optimizing n-cities open loop travelling salesman problem
Open Loop Travelling Salesman Problem (OTSP) is one of the extension of Travelling Salesman Problem (TSP) that finding a shortest tour of a number of cities by visiting each city exactly once and do not rerurning to the starting city. In the past, TSP and OTSP has been applied in various vehicle rou...
Saved in:
主要作者: | |
---|---|
格式: | Thesis |
語言: | English English English |
出版: |
2016
|
主題: | |
在線閱讀: | http://eprints.uthm.edu.my/9943/2/24p%20CHIENG%20HOCK%20HUNG.pdf http://eprints.uthm.edu.my/9943/1/CHIENG%20HOCK%20HUNG%20COPYRIGHT%20DECLARATION.pdf http://eprints.uthm.edu.my/9943/3/CHIENG%20HOCK%20HUNG%20WATERMARK.pdf |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|