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

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:
TS Manufactures
Online Access:http://umpir.ump.edu.my/id/eprint/22512/
http://umpir.ump.edu.my/id/eprint/22512/
http://umpir.ump.edu.my/id/eprint/22512/
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
id ump-22512
recordtype eprints
spelling ump-225122018-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 https://doi.org/10.1166/asl.2018.10775 10.1166/asl.2018.10775
repository_type Digital Repository
institution_category Local University
institution Universiti Malaysia Pahang
building UMP Institutional Repository
collection Online Access
language English
topic TS Manufactures
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
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.
format Article
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
title 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_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_sort optimization of travelling salesman problem with precedence constraint using modified ga encoding
publisher American Scientific Publishers
publishDate 2018
url http://umpir.ump.edu.my/id/eprint/22512/
http://umpir.ump.edu.my/id/eprint/22512/
http://umpir.ump.edu.my/id/eprint/22512/
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
first_indexed 2023-09-18T22:33:33Z
last_indexed 2023-09-18T22:33:33Z
_version_ 1777416445330718720

Similar Items