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...

Full description

Saved in:
Bibliographic Details
Main Author: Wakat, Spencer Embong
Format: Thesis
Language:English
Published: 2019
Subjects:
Online Access:http://eprints.utm.my/id/eprint/102336/1/SpencerEmbongWakatMFS2019.pdf
http://eprints.utm.my/id/eprint/102336/
http://dms.library.utm.my:8080/vital/access/manager/Repository/vital:145865
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Universiti Teknologi Malaysia
Language: English
id my.utm.102336
record_format eprints
spelling my.utm.1023362023-08-21T08:10:47Z http://eprints.utm.my/id/eprint/102336/ Traveling salesman problem approach for solving drug distribution using simulated annealing and Tabu search Wakat, Spencer Embong QA Mathematics 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 application of the traveling salesman problem. Two meta-heuristic methods were utilized to generate the best solution, which are the simulated annealing and tabu search. There are essential parameters for both of the methods. In the simulated annealing, the right setting for the cooling schedule is very important so that the algorithm will converge to a near-optimal solution. Moreover, the size of the tabu list is an essential value for the tabu search method since it will determine how the algorithm will search for better solutions in the search space. The results of this experiment were analyzed based on the output generated by the developed C++ program, and it revealed that the simulated annealing and tabu search methods were capable of generating a best solution within a short computational time. 2019 Thesis NonPeerReviewed application/pdf en http://eprints.utm.my/id/eprint/102336/1/SpencerEmbongWakatMFS2019.pdf Wakat, Spencer Embong (2019) Traveling salesman problem approach for solving drug distribution using simulated annealing and Tabu search. Masters thesis, Universiti Teknologi Malaysia, Faculty of Science. http://dms.library.utm.my:8080/vital/access/manager/Repository/vital:145865
institution Universiti Teknologi Malaysia
building UTM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Teknologi Malaysia
content_source UTM Institutional Repository
url_provider http://eprints.utm.my/
language English
topic QA Mathematics
spellingShingle QA Mathematics
Wakat, Spencer Embong
Traveling salesman problem approach for solving drug distribution using simulated annealing and Tabu search
description 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 application of the traveling salesman problem. Two meta-heuristic methods were utilized to generate the best solution, which are the simulated annealing and tabu search. There are essential parameters for both of the methods. In the simulated annealing, the right setting for the cooling schedule is very important so that the algorithm will converge to a near-optimal solution. Moreover, the size of the tabu list is an essential value for the tabu search method since it will determine how the algorithm will search for better solutions in the search space. The results of this experiment were analyzed based on the output generated by the developed C++ program, and it revealed that the simulated annealing and tabu search methods were capable of generating a best solution within a short computational time.
format Thesis
author Wakat, Spencer Embong
author_facet Wakat, Spencer Embong
author_sort Wakat, Spencer Embong
title Traveling salesman problem approach for solving drug distribution using simulated annealing and Tabu search
title_short Traveling salesman problem approach for solving drug distribution using simulated annealing and Tabu search
title_full Traveling salesman problem approach for solving drug distribution using simulated annealing and Tabu search
title_fullStr Traveling salesman problem approach for solving drug distribution using simulated annealing and Tabu search
title_full_unstemmed Traveling salesman problem approach for solving drug distribution using simulated annealing and Tabu search
title_sort traveling salesman problem approach for solving drug distribution using simulated annealing and tabu search
publishDate 2019
url http://eprints.utm.my/id/eprint/102336/1/SpencerEmbongWakatMFS2019.pdf
http://eprints.utm.my/id/eprint/102336/
http://dms.library.utm.my:8080/vital/access/manager/Repository/vital:145865
_version_ 1775621972154122240