全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

Particle Swarm Optimization (PSO) Performance in Solving the Train Location Problem at Transshipment Yard

DOI: 10.4236/oalib.1101024, PP. 1-8

Subject Areas: Information and communication theory and algorithms, High Performance Computing

Keywords: Particle Swarm Optimization, Transshipment Yards, Train Location

Full-Text   Cite this paper   Add to My Lib

Abstract

Particle swarm optimization (PSO) is an evolutionary computation technique; it has shown its effectiveness as an efficient, fast and simple method of optimization. In this paper, the mathematical model represents NP-hard in the strong sense; since any instance of the quadratic assignment problem (QAP), I will implement the particle swarm optimization (PSO) for the quadratic assignment problem (QAP). The results show that the PSO is an appropriate optimization tool for use in determining the train location in the transshipment yard by comparing it with previous studies to know the PSO’s performance.

Cite this paper

Mohamed, A. and Peng, Q. (2014). Particle Swarm Optimization (PSO) Performance in Solving the Train Location Problem at Transshipment Yard. Open Access Library Journal, 1, e1024. doi: http://dx.doi.org/10.4236/oalib.1101024.

References

[1]  Kellner, M., Boysen, N. and Fliedner, M. (2009) How to Park Freight Trains on Rail-Rail Transshipment Yards. Friedrich-Schiller-Universitat Jena, Lehrstuhl für Operations Management, Germany.
[2]  Liu, H. and Abraham, A. (2007) A Hybrid Fuzzy Variable Neighborhood Particle Swarm Optimization Algorithm for Solving Quadratic Assignment Problems. Journal of Universal Computer Science, 13, 1032-1054.

Full-Text


comments powered by Disqus

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133

WeChat 1538708413