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

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/1/30jj.pdf

Similar Items

Similar Items