Optimization of Traveling Salesman Problem with Precedence Constraint using Particle Swarm Optimization

Traveling salesman problem with precedence constraint (TSPPC) is one of the complex problems in combinatorial optimization. Many researchers have suggested various mechanisms to solve this problem effectively. This work presents a combination of Particle Swarm Optimization (PSO) and Topological Sort...

Full description

Bibliographic Details
Main Authors:	M. F. F., Ab Rashid, N. M. Zuki, N. M., A. N. M., Rose
Format:	Article
Language:	English
Published:	JSRAD 2015
Subjects:	TS Manufactures
Online Access:	http://umpir.ump.edu.my/id/eprint/11598/ http://umpir.ump.edu.my/id/eprint/11598/ http://umpir.ump.edu.my/id/eprint/11598/1/30jj.pdf

id	oai:umpir.ump.edu.my:11598
recordtype	eprints
spelling	oai:umpir.ump.edu.my:115982018-01-09T02:30:57Z http://umpir.ump.edu.my/id/eprint/11598/ Optimization of Traveling Salesman Problem with Precedence Constraint using Particle Swarm Optimization M. F. F., Ab Rashid N. M. Zuki, N. M. A. N. M., Rose TS Manufactures Traveling salesman problem with precedence constraint (TSPPC) is one of the complex problems in combinatorial optimization. Many researchers have suggested various mechanisms to solve this problem effectively. This work presents a combination of Particle Swarm Optimization (PSO) and Topological Sort approach to optimize TSPPC. The original PSO is designed for continuous problem. Therefore, it is incapable to optimize TSPPC, besides the reason of precedence constraint. The proposed PSO with Topological Sort approach was tested with different size of TSPPC problem. The optimization result showed that it yielded better performance in finding the shortest travelling time in all problem size. This finding is associated with better exploration and solution diversity features in PSO. JSRAD 2015-11 Article PeerReviewed application/pdf en http://umpir.ump.edu.my/id/eprint/11598/1/30jj.pdf M. F. F., Ab Rashid and N. M. Zuki, N. M. and A. N. M., Rose (2015) Optimization of Traveling Salesman Problem with Precedence Constraint using Particle Swarm Optimization. Journal of Scienctific Research & Development , 2 (13). pp. 212-216. ISSN 1115-7569 http://jsrad.org/wp-content/2015/Issue%2013,%202015/30jj.pdf
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. A. N. M., Rose Optimization of Traveling Salesman Problem with Precedence Constraint using Particle Swarm Optimization
description	Traveling salesman problem with precedence constraint (TSPPC) is one of the complex problems in combinatorial optimization. Many researchers have suggested various mechanisms to solve this problem effectively. This work presents a combination of Particle Swarm Optimization (PSO) and Topological Sort approach to optimize TSPPC. The original PSO is designed for continuous problem. Therefore, it is incapable to optimize TSPPC, besides the reason of precedence constraint. The proposed PSO with Topological Sort approach was tested with different size of TSPPC problem. The optimization result showed that it yielded better performance in finding the shortest travelling time in all problem size. This finding is associated with better exploration and solution diversity features in PSO.
format	Article
author	M. F. F., Ab Rashid N. M. Zuki, N. M. A. N. M., Rose
author_facet	M. F. F., Ab Rashid N. M. Zuki, N. M. A. N. M., Rose
author_sort	M. F. F., Ab Rashid
title	Optimization of Traveling Salesman Problem with Precedence Constraint using Particle Swarm Optimization
title_short	Optimization of Traveling Salesman Problem with Precedence Constraint using Particle Swarm Optimization
title_full	Optimization of Traveling Salesman Problem with Precedence Constraint using Particle Swarm Optimization
title_fullStr	Optimization of Traveling Salesman Problem with Precedence Constraint using Particle Swarm Optimization
title_full_unstemmed	Optimization of Traveling Salesman Problem with Precedence Constraint using Particle Swarm Optimization
title_sort	optimization of traveling salesman problem with precedence constraint using particle swarm optimization
publisher	JSRAD
publishDate	2015
url	http://umpir.ump.edu.my/id/eprint/11598/ http://umpir.ump.edu.my/id/eprint/11598/ http://umpir.ump.edu.my/id/eprint/11598/1/30jj.pdf
first_indexed	2018-09-07T01:32:45Z
last_indexed	2018-09-07T01:32:45Z
_version_	1610910495221481472

Optimization of Traveling Salesman Problem with Precedence Constraint using Particle Swarm Optimization

Similar Items