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...
| मुख्य लेखक: | |
|---|---|
| स्वरूप: | थीसिस |
| भाषा: | अंग्रेज़ी |
| प्रकाशित: |
2019
|
| विषय: | |
| ऑनलाइन पहुंच: | http://eprints.utm.my/102336/1/SpencerEmbongWakatMFS2019.pdf |