期刊名称：International Journal of Computer Science & Information Technology (IJCSIT)
印刷版ISSN：0975-4660
电子版ISSN：0975-3826
出版年度：2015
卷号：7
期号：1
页码：59
出版社：Academy & Industry Research Collaboration Center (AIRCC)
摘要：Transportation Network Design Problem (TNDP) aims to select the best project sets among a number ofnew projects. Recently, metaheuristic methods are applied to solve TNDP in the sense of finding bettersolutions sooner. PSO as a metaheuristic method is based on stochastic optimization and is a parallelrevolutionary computation technique. The PSO system initializes with a number of random solutions andseeks for optimal solution by improving generations. This paper studies the behavior of PSO on account ofimproving initial generation and fitness value domain to find better solutions in comparison with previousattempts.
关键词：Transportation; Network Design; optimization; Particle Swarm; roulette cycle; initial value
