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...
| Autores principales: | , , |
|---|---|
| Formato: | Artículo |
| Lenguaje: | English |
| Publicado: |
JSRAD
2015
|
| Materias: | |
| Acceso en línea: | http://umpir.ump.edu.my/id/eprint/11598/1/30jj.pdf |