Optimization of travelling salesman problem with precedence constraint using modified GA encoding

One of the challenges in combinatorial optimization is to optimize travelling salesman problem with precedence constraint (TSPPC). The optimization algorithm to deal with this problem is continuously developed and improved to enhance its performance. Genetic algorithm (GA) is one of popular algorith...

Full description

Bibliographic Details
Main Authors: M. F. F., Ab Rashid, N. M. Zuki, N. M., F. R. M., Romlay, M., Jusop
Format: Article
Language:English
Published: American Scientific Publishers 2018
Subjects:
Online Access:http://umpir.ump.edu.my/id/eprint/22512/1/ICIST%20UMS%20Optimization%20of%20Travelling%20Salesman%20Problem%20with%20Precedence%20Constraint%20using%20Modified%20GA%20Encoding_ICIST.pdf
_version_ 1796992963627188224
author M. F. F., Ab Rashid
N. M. Zuki, N. M.
F. R. M., Romlay
M., Jusop
author_facet M. F. F., Ab Rashid
N. M. Zuki, N. M.
F. R. M., Romlay
M., Jusop
author_sort M. F. F., Ab Rashid
collection UMP
description One of the challenges in combinatorial optimization is to optimize travelling salesman problem with precedence constraint (TSPPC). The optimization algorithm to deal with this problem is continuously developed and improved to enhance its performance. Genetic algorithm (GA) is one of popular algorithm used to optimize TSPPC. In this work, the Genetic algorithm is improved by using a discrete encoding instead of continuous encoding. The numerical experimental results indicated that the proposed algorithm able to search for optimal solution faster compared with original encoding.
first_indexed 2024-03-06T12:27:15Z
format Article
id UMPir22512
institution Universiti Malaysia Pahang
language English
last_indexed 2024-03-06T12:27:15Z
publishDate 2018
publisher American Scientific Publishers
record_format dspace
spelling UMPir225122018-11-22T02:19:45Z http://umpir.ump.edu.my/id/eprint/22512/ Optimization of travelling salesman problem with precedence constraint using modified GA encoding M. F. F., Ab Rashid N. M. Zuki, N. M. F. R. M., Romlay M., Jusop TS Manufactures One of the challenges in combinatorial optimization is to optimize travelling salesman problem with precedence constraint (TSPPC). The optimization algorithm to deal with this problem is continuously developed and improved to enhance its performance. Genetic algorithm (GA) is one of popular algorithm used to optimize TSPPC. In this work, the Genetic algorithm is improved by using a discrete encoding instead of continuous encoding. The numerical experimental results indicated that the proposed algorithm able to search for optimal solution faster compared with original encoding. American Scientific Publishers 2018-06 Article PeerReviewed pdf en http://umpir.ump.edu.my/id/eprint/22512/1/ICIST%20UMS%20Optimization%20of%20Travelling%20Salesman%20Problem%20with%20Precedence%20Constraint%20using%20Modified%20GA%20Encoding_ICIST.pdf M. F. F., Ab Rashid and N. M. Zuki, N. M. and F. R. M., Romlay and M., Jusop (2018) Optimization of travelling salesman problem with precedence constraint using modified GA encoding. Advanced Science Letters, 24 (2). pp. 1484-1487. ISSN 1936-6612. (Published) https://doi.org/10.1166/asl.2018.10775 10.1166/asl.2018.10775
spellingShingle TS Manufactures
M. F. F., Ab Rashid
N. M. Zuki, N. M.
F. R. M., Romlay
M., Jusop
Optimization of travelling salesman problem with precedence constraint using modified GA encoding
title Optimization of travelling salesman problem with precedence constraint using modified GA encoding
title_full Optimization of travelling salesman problem with precedence constraint using modified GA encoding
title_fullStr Optimization of travelling salesman problem with precedence constraint using modified GA encoding
title_full_unstemmed Optimization of travelling salesman problem with precedence constraint using modified GA encoding
title_short Optimization of travelling salesman problem with precedence constraint using modified GA encoding
title_sort optimization of travelling salesman problem with precedence constraint using modified ga encoding
topic TS Manufactures
url http://umpir.ump.edu.my/id/eprint/22512/1/ICIST%20UMS%20Optimization%20of%20Travelling%20Salesman%20Problem%20with%20Precedence%20Constraint%20using%20Modified%20GA%20Encoding_ICIST.pdf
work_keys_str_mv AT mffabrashid optimizationoftravellingsalesmanproblemwithprecedenceconstraintusingmodifiedgaencoding
AT nmzukinm optimizationoftravellingsalesmanproblemwithprecedenceconstraintusingmodifiedgaencoding
AT frmromlay optimizationoftravellingsalesmanproblemwithprecedenceconstraintusingmodifiedgaencoding
AT mjusop optimizationoftravellingsalesmanproblemwithprecedenceconstraintusingmodifiedgaencoding