Staff View: Travelling salesman problem using genetic algorithm / Muhammad Faiz Wafiq Mohd Zaini, Nurin Hannani Mohd Bakhary and Nur Aishah Zakaria

Travelling salesman problem using genetic algorithm / Muhammad Faiz Wafiq Mohd Zaini, Nurin Hannani Mohd Bakhary and Nur Aishah Zakaria

Travelling Salesmen Problem is a well-known algorithm problem in the fields of computer science and operation research. This paper evaluates the Travelling Salesmen Problem based on dataset used from (Ohlmann & Thomas, 2007) and this research 30 towns that mentioned from (Ohlmann & Thomas, 2...

Full description

Saved in:

Bibliographic Details
Main Authors:	Mohd Zaini, Muhammad Faiz Wafiq, Mohd Bakhary, Nurin Hannani, Zakaria, Nur Aishah
Format:	Student Project
Language:	English
Published:	2022
Subjects:	Statistical data Theory and method of social science statistics Analysis Evolutionary programming (Computer science). Genetic algorithms
Online Access:	https://ir.uitm.edu.my/id/eprint/72385/1/72385.pdf https://ir.uitm.edu.my/id/eprint/72385/
Tags:	Add Tag No Tags, Be the first to tag this record!

id	my.uitm.ir.72385
record_format	eprints
spelling	my.uitm.ir.723852023-03-13T03:11:35Z https://ir.uitm.edu.my/id/eprint/72385/ Travelling salesman problem using genetic algorithm / Muhammad Faiz Wafiq Mohd Zaini, Nurin Hannani Mohd Bakhary and Nur Aishah Zakaria Mohd Zaini, Muhammad Faiz Wafiq Mohd Bakhary, Nurin Hannani Zakaria, Nur Aishah Statistical data Theory and method of social science statistics Analysis Evolutionary programming (Computer science). Genetic algorithms Travelling Salesmen Problem is a well-known algorithm problem in the fields of computer science and operation research. This paper evaluates the Travelling Salesmen Problem based on dataset used from (Ohlmann & Thomas, 2007) and this research 30 towns that mentioned from (Ohlmann & Thomas, 2007). Travelling salesmen must travel to every towns and ends at the same town when it started. Nowadays, the demand for salesmen deliver increase so frequency salesmen travel a lot and need to finds ways to make fast deliveries. Thus, the aim of the study is to help the delivering sector in overcoming the problems of delivering goods to customers while minimizing distance travelled. The method that use in this research is Genetic Algorithm. The first round this research use two Genetic Algorithms’ operator which are crossover and inversion operator. The second round this research use three operator which are crossover, inversion and mutation operator. The parents that used in every section are same. After each operation, the total distance was determine and the least total distance will be chosen. This research stop after 10 iteration which in both round. In each iteration, the selection step compare and select the minimum distance for each chromosome. The result shows using Genetic Algorithm operator can help Travelling Salesmen to minimize the distance effectively and to make it more effective Travelling Salesmen need to use three Genetic Algorithms’ operator. In conclusion, companies deliver sector can apply this research in their companies to decrease their logistic costs. 2022 Student Project NonPeerReviewed text en https://ir.uitm.edu.my/id/eprint/72385/1/72385.pdf Travelling salesman problem using genetic algorithm / Muhammad Faiz Wafiq Mohd Zaini, Nurin Hannani Mohd Bakhary and Nur Aishah Zakaria. (2022) [Student Project] <http://terminalib.uitm.edu.my/72385.pdf> (Unpublished)
institution	Universiti Teknologi Mara
building	Tun Abdul Razak Library
collection	Institutional Repository
continent	Asia
country	Malaysia
content_provider	Universiti Teknologi Mara
content_source	UiTM Institutional Repository
url_provider	http://ir.uitm.edu.my/
language	English
topic	Statistical data Theory and method of social science statistics Analysis Evolutionary programming (Computer science). Genetic algorithms
spellingShingle	Statistical data Theory and method of social science statistics Analysis Evolutionary programming (Computer science). Genetic algorithms Mohd Zaini, Muhammad Faiz Wafiq Mohd Bakhary, Nurin Hannani Zakaria, Nur Aishah Travelling salesman problem using genetic algorithm / Muhammad Faiz Wafiq Mohd Zaini, Nurin Hannani Mohd Bakhary and Nur Aishah Zakaria
description	Travelling Salesmen Problem is a well-known algorithm problem in the fields of computer science and operation research. This paper evaluates the Travelling Salesmen Problem based on dataset used from (Ohlmann & Thomas, 2007) and this research 30 towns that mentioned from (Ohlmann & Thomas, 2007). Travelling salesmen must travel to every towns and ends at the same town when it started. Nowadays, the demand for salesmen deliver increase so frequency salesmen travel a lot and need to finds ways to make fast deliveries. Thus, the aim of the study is to help the delivering sector in overcoming the problems of delivering goods to customers while minimizing distance travelled. The method that use in this research is Genetic Algorithm. The first round this research use two Genetic Algorithms’ operator which are crossover and inversion operator. The second round this research use three operator which are crossover, inversion and mutation operator. The parents that used in every section are same. After each operation, the total distance was determine and the least total distance will be chosen. This research stop after 10 iteration which in both round. In each iteration, the selection step compare and select the minimum distance for each chromosome. The result shows using Genetic Algorithm operator can help Travelling Salesmen to minimize the distance effectively and to make it more effective Travelling Salesmen need to use three Genetic Algorithms’ operator. In conclusion, companies deliver sector can apply this research in their companies to decrease their logistic costs.
format	Student Project
author	Mohd Zaini, Muhammad Faiz Wafiq Mohd Bakhary, Nurin Hannani Zakaria, Nur Aishah
author_facet	Mohd Zaini, Muhammad Faiz Wafiq Mohd Bakhary, Nurin Hannani Zakaria, Nur Aishah
author_sort	Mohd Zaini, Muhammad Faiz Wafiq
title	Travelling salesman problem using genetic algorithm / Muhammad Faiz Wafiq Mohd Zaini, Nurin Hannani Mohd Bakhary and Nur Aishah Zakaria
title_short	Travelling salesman problem using genetic algorithm / Muhammad Faiz Wafiq Mohd Zaini, Nurin Hannani Mohd Bakhary and Nur Aishah Zakaria
title_full	Travelling salesman problem using genetic algorithm / Muhammad Faiz Wafiq Mohd Zaini, Nurin Hannani Mohd Bakhary and Nur Aishah Zakaria
title_fullStr	Travelling salesman problem using genetic algorithm / Muhammad Faiz Wafiq Mohd Zaini, Nurin Hannani Mohd Bakhary and Nur Aishah Zakaria
title_full_unstemmed	Travelling salesman problem using genetic algorithm / Muhammad Faiz Wafiq Mohd Zaini, Nurin Hannani Mohd Bakhary and Nur Aishah Zakaria
title_sort	travelling salesman problem using genetic algorithm / muhammad faiz wafiq mohd zaini, nurin hannani mohd bakhary and nur aishah zakaria
publishDate	2022
url	https://ir.uitm.edu.my/id/eprint/72385/1/72385.pdf https://ir.uitm.edu.my/id/eprint/72385/
_version_	1761622321790976000
score	13.211869

Travelling salesman problem using genetic algorithm / Muhammad Faiz Wafiq Mohd Zaini, Nurin Hannani Mohd Bakhary and Nur Aishah Zakaria

Similar Items