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, besidesudthe reason of precedence constraint. The proposed PSO with Topological Sort approach was tested with differentudsize 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.
展开▼
