计算机科学
粒子群优化
网络规划与设计
数学优化
模拟
人工智能
算法
计算机网络
数学
作者
Navid Afkar,Abbas Babazadeh
出处
期刊:International Journal of Computer Science and Information Technology
[Academy and Industry Research Collaboration Center]
日期:2015-02-28
卷期号:7 (1): 59-68
被引量:1
标识
DOI:10.5121/ijcsit.2015.7106
摘要
Transportation Network Design Problem (TNDP) aims to select the best project sets among a number of new projects.Recently, metaheuristic methods are applied to solve TNDP in the sense of finding better solutions sooner.PSO as a metaheuristic method is based on stochastic optimization and is a parallel revolutionary computation technique.The PSO system initializes with a number of random solutions and seeks for optimal solution by improving generations.This paper studies the behavior of PSO on account of improving initial generation and fitness value domain to find better solutions in comparison with previous attempts.
科研通智能强力驱动
Strongly Powered by AbleSci AI