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...
Saved in:
Main Author: | Wakat, Spencer Embong |
---|---|
Format: | Thesis |
Language: | English |
Published: |
2019
|
Subjects: | |
Online Access: | http://eprints.utm.my/id/eprint/102336/1/SpencerEmbongWakatMFS2019.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Traveling salesman problem approach for solving petrol distribution using simulated annealing and tabu search
by: Wan Ibrahim, Wan Rohaizad
Published: (2007) -
Heuristic method based on simulated annealing and tabu search for solving traveling salesman problem
by: Abdul Razif, Nur Rafiqah
Published: (2012) -
Enhanced genetic algorithm with simulated annealing in solving travelling salesman problem
by: Pang, Li Sim
Published: (2010) -
The simulated annealing technique for travelling salesman problem
by: Vilu, Subashini
Published: (2012) -
Genetic algorithm software for solving the travelling salesman problem
by: Sekharan, Vijayan Sandiara
Published: (1996)