New genetic operator for solving the travelling salesman problem / Fadzilawani Astifar Alias ... [et al.]

Alias, Fadzilawani Astifar and Shamsuddin, Maisurah and Mohamed, Siti Asmah and Mahlan, Siti Balqis (2015) New genetic operator for solving the travelling salesman problem / Fadzilawani Astifar Alias ... [et al.]. Esteem Academic Journal, 11 (1). pp. 127-134. ISSN 1675-7939


The Travelling Salesman Problem (TSP) is a well-known and important combinatorial optimization problem. The goal is to find the shortest distance tour that visits each city in a given list exactly once and then returns to the starting city. TSP is an NP-complete problem that has many interaction variables with a high degree of freedom. The main objective of TSP is to determine the network route to minimize the total distance, cost or time. In this research, the heuristic method called Genetic Algorithm (GA) is used to solve the TSP. GA is a system developing methods that uses the natural principle of a genetic population and involves three main processes that are crossover, mutation and inversion. GA is implemented with some new operators called Nearest Fragment (NF) and Modified Order Crossover (MOC). GA implementation on TSP is done by using Microsoft C++ Programming. Solutions to the problem are presented and performance comparison is described with the existing best solution.


Item Type: Article
CreatorsID Num. / Email
Alias, Fadzilawani AstifarUNSPECIFIED
Shamsuddin, MaisurahUNSPECIFIED
Mohamed, Siti AsmahUNSPECIFIED
Mahlan, Siti BalqisUNSPECIFIED
Subjects: Q Science > QA Mathematics > Analysis
Divisions: Universiti Teknologi MARA, Pulau Pinang
Journal or Publication Title: Esteem Academic Journal
ISSN: 1675-7939
Volume: 11
Number: 1
Page Range: pp. 127-134
Item ID: 11988
Uncontrolled Keywords: Genetic Algorithm; Travelling Salesman Problem; Distance; Population; Network Route


[img] Text

Download (1MB)

Actions (login required)

View Item View Item


Downloads per month over past year