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...
محفوظ في:
المؤلف الرئيسي: | Chieng, Hock Hung |
---|---|
التنسيق: | أطروحة |
اللغة: | 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 |
الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
مواد مشابهة
-
Improved genetic Particle Swarm Optimisation multiuser detector for Multi-Carrier Code Division Multiple Access
بواسطة: Kho, Desmond Teck Kiang
منشور في: (2013) -
Solving an application of university course timetabling problem by using genetic algorithm
بواسطة: Norhana, Shaibatul Khadri
منشور في: (2022) -
Optimize class time tabling by using genetic algorithm technique in UTHM
بواسطة: Ahmad, Izah Rafidah
منشور في: (2019) -
Menu Planning Model for Malaysian Boarding School Using Self-Adaptive Hybrid Genetic Algorithms
بواسطة: Siti Noor Asyikin, Mohd Razali
منشور في: (2011) -
Pengubahsuaian matriks hessian famili kaedah newton bagi permasalahan pengoptimuman tak berkekang berskala besar
بواسطة: Khadizah Ghazali
منشور في: (2022)