Traveling salesman problem approach for solving drug distribution using simulated annealing and Tabu search
In combinatorial mathematics and operational research, the traveling salesman problem is among the most studied problem which aims to find the least possible cost or distance when visiting all the cities exactly once. This research analyzes a drug distribution problem, which is regarded as an applic...
محفوظ في:
المؤلف الرئيسي: | Wakat, Spencer Embong |
---|---|
التنسيق: | أطروحة |
اللغة: | English |
منشور في: |
2019
|
الموضوعات: | |
الوصول للمادة أونلاين: | http://eprints.utm.my/id/eprint/102336/1/SpencerEmbongWakatMFS2019.pdf |
الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
مواد مشابهة
-
Traveling salesman problem approach for solving petrol distribution using simulated annealing and tabu search
بواسطة: Wan Ibrahim, Wan Rohaizad
منشور في: (2007) -
Heuristic method based on simulated annealing and tabu search for solving traveling salesman problem
بواسطة: Abdul Razif, Nur Rafiqah
منشور في: (2012) -
Enhanced genetic algorithm with simulated annealing in solving travelling salesman problem
بواسطة: Pang, Li Sim
منشور في: (2010) -
The simulated annealing technique for travelling salesman problem
بواسطة: Vilu, Subashini
منشور في: (2012) -
Genetic algorithm software for solving the travelling salesman problem
بواسطة: Sekharan, Vijayan Sandiara
منشور في: (1996)