Large-Scale Network Plan Optimization Using Improved Particle Swarm Optimization Algorithm

Houxian Zhang and Zhaolan Yang

Mathematical Problems in Engineering, 2017, vol. 2017, 1-15

Abstract:

No relevant reports have been reported on the optimization of a large-scale network plan with more than 200 works due to the complexity of the problem and the huge amount of computation. In this paper, an improved particle swarm optimization algorithm via optimization of initial particle swarm (OIPSO) is first explained by the stochastic processes theory. Then two optimization examples are solved using this method which are the optimization of resource-leveling with fixed duration and the optimization of resources constraints with shortest project duration in a large network plan with 223 works. Through these two examples, under the same number of iterations, it is proven that the improved algorithm (OIPSO) can accelerate the optimization speed and improve the optimization effect of particle swarm optimization (PSO).

Date: 2017
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2017/3271969.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2017/3271969.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:3271969

DOI: 10.1155/2017/3271969

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().