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:
Main Author: | Chieng, Hock Hung |
---|---|
Format: | Thesis |
Language: | English English English |
Published: |
2016
|
Subjects: | |
Online Access: | 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 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Improved genetic Particle Swarm Optimisation multiuser detector for Multi-Carrier Code Division Multiple Access
by: Kho, Desmond Teck Kiang
Published: (2013) -
Solving an application of university course timetabling problem by using genetic algorithm
by: Norhana, Shaibatul Khadri
Published: (2022) -
Optimize class time tabling by using genetic algorithm technique in UTHM
by: Ahmad, Izah Rafidah
Published: (2019) -
Menu Planning Model for Malaysian Boarding School Using Self-Adaptive Hybrid Genetic Algorithms
by: Siti Noor Asyikin, Mohd Razali
Published: (2011) -
Pengubahsuaian matriks hessian famili kaedah newton bagi permasalahan pengoptimuman tak berkekang berskala besar
by: Khadizah Ghazali
Published: (2022)