Open Access
Subscription Access
Improving Initial Generations in PSO Algorithm for Transportation Network Design Problem
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.
Keywords
Transportation, Network Design, Optimization, Particle Swarm, Roulette Cycle, Initial Value.
User
Font Size
Information
Abstract Views: 321
PDF Views: 152