UMP Institutional Repository

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

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

[img]
Preview
Pdf
ICIST UMS Optimization of Travelling Salesman Problem with Precedence Constraint using Modified GA Encoding_ICIST.pdf

Download (371kB) | Preview

Abstract

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.

Item Type: Article
Uncontrolled Keywords: Travelling salesman problem; Precedence constraint algorithm
Subjects: T Technology > TS Manufactures
Faculty/Division: Faculty of Mechanical Engineering
Depositing User: Dr. Mohd Fadzil Faisae Ab. Rashid
Date Deposited: 22 Nov 2018 02:19
Last Modified: 22 Nov 2018 02:19
URI: http://umpir.ump.edu.my/id/eprint/22512
Download Statistic: View Download Statistics

Actions (login required)

View Item View Item