Application of particle swarm optimization to transportation network design problem

Journal of King Saud University - Science

Volumn 23, Issue 3, 2011, Pages 293-300

  Babazadeh, Abbas ^a   Poorzahedy, Hossain ^b   Nikoosokhan, Saeid ^a  

^a UNIVERSITY OF TEHRAN   (Iran)

^b SHARIF UNIVERSITY OF TECHNOLOGY   (Iran)

Author keywords

Ant colony; Meta heuristics; Network design; Optimization; Particle swarm; Transportation

Indexed keywords

EID: 80052504960     PISSN: 10183647     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jksus.2011.03.001     Document Type: Article

References (32)

1. Abdulaal M., Leblanc L.J. Continuous equilibrium network design models. Transportation Research Part B 1979, 13:19-32.
2. Abraham A., Guo H., Lio H. Swarm intelligence: foundations, perspectives and applications. Swarm Intelligent Systems 2006, 18-25. Springer, Netherlands. N. Nedjah, L.M. Mourelle (Eds.).
3. Boyce D.E., Farhi A., Weischedel R. Optimal network design problem: a branch-and-bound algorithm. Environment and Planning 1973, 5:519-533.
4. Cantarella, G.E., Pavone, G., Vitetta, A., 2002. Heuristics for the network design problem. In: Presented at the EWG 2002 (the 13th Mini Euro Conference), Bari, Italy.
5. Chen M., Sul Alfa A. A network design algorithm using a stochastic incremental traffic assignment approach. Transportation Science 1991, 25:215-224.
6. Clerc M., Kennedy J. The particle swarm-explosion, stability, and convergence in a multidimensional complex space. IEEE Transactions on Evolutionary Computation 2002, 6:58-73.
7. Dantzig G.D., Harvey R.P., Lansdowne Z.F., Robinson D.W., Maier S.F. Formulating and solving the network design problem by decomposition. Transportation Research Part B 1979, 13:5-17.
8. Eberhart R.C., Kennedy J. A new optimizer using particle swarm theory. Proceedings of the Sixth International Symposium on Micro Machine and Human Science 1995, 39-43. IEEE Press, Piscataway, NJ.
9. Eberhart R.C., Shi Y. Comparing inertia weights and constriction factors in particle swarm optimization. Proceedings of the IEEE International Congress on Evolutionary Computation 2000, vol. 1:84-88. IEEE Press, Piscataway, NJ.
10. Haghani, A.E., Daskin, M.S., 1983. Network design application of an extraction algorithm for network aggregation. Transportation Research Record 944, National Research Council, Washington, DC, pp. 37-46.
11. Hoang H.H. Topological optimization of networks: a nonlinear mixed integer model employing generalized benders decomposition. IEEE Transactions on Automatic Control 1982, 27:164-169.
12. Holmberg K., Hellstrand J. Solving the uncapacitated network design problem by a Lagrangean heuristic and branch-and-bound. Operations Research 1998, 46(2):247-259.
13. Jiang M., Luo Y.P., Yang S.Y. Stochastic convergence analysis and parameter selection of the standard particle swarm optimization algorithm. Information Processing Letters 2007, 102(1):8-16.
14. Kennedy J., Eberhart R.C. Particle swarm optimization. Proceedings of the IEEE International Conference on Neural Networks 1995, vol. 4:1942-1948. IEEE Press, Piscataway, NJ.
15. LeBlanc L.J. An algorithm for discrete network design problem. Transportation Science 1975, 9:183-199.
16. Lee C.K., Yang K.I. Network design of one-way streets with simulated annealing. Papers in Regional Science 1994, 32(2):119-134.
17. Magnanti T.L., Wong R.T. Network design and transportation planning: models and algorithms. Transportation Science 1984, 18:1-55.
18. Poorzahedy H., Abulghasemi F. Application of ant system to network design problem. Transportation 2005, 32:251-273.
19. Poorzahedy H., Rouhani O.M. Hybrid meta-heuristic algorithms for solving network design problem. European Journal of Operational Research 2007, 182:578-596.
20. Poorzahedy H., Turnquist M.A. Approximate algorithms for the discrete network design problem. Transportation Research Part B 1982, 16:45-56.
21. Sheffi Y. Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methods 1985, Prentice-Hall, USA.
22. Shi Y., Eberhart R.C. A modified particle swarm optimizer. Proceedings of the IEEE International Conference on Evolutionary Computation 1998, 69-73. IEEE Press, Piscataway, NJ.
23. Shi Y., Eberhart R.C. Parameter selection in particle swarm optimization. Proceedings of the Seventh International Conference on Evolutionary 1998, vol. VII:591-600. Springer-Verlag, New York, USA.
24. Solanki R.S., Gorti J.K., Southworth F. Using decomposition in large-scale highway network design with quasi-optimization heuristic. Transportation Research Part B 1998, 32:127-140.
25. Steenbrink P.A. Optimization of Transport Network 1974, John Wiley, New York, USA.
26. Steenbrink P.A. Transportation network optimization in the Dutch integral transportation study. Transportation Research 1974, 8:11-27.
27. Voss, M.S., Feng, X., 2002. ARMA model selection using particle swarm optimization and AIC criteria. In: Presented at the 15th IFAC World Congress on Automatic Control, Barcelona, Spain.
28. Wong R.T. Introduction and recent advances in network design models and algorithms. Transportation Planning Models 1984, North-Holland, Amsterdam. M. Florian (Ed.).
29. Yang H., Bell M.G.H. Models and algorithms for road network design: a review and some new developments. Transport Review 1998, 18(3):257-278.
30. Yin Y. Genetic algorithm-based approach for bilevel programming models. ASCE Journal of Transportation Engineering 2000, 26(2):115-120.
31. Yisu J., Knowles J., Hongmei L., Yizeng L., Kell D.B. The landscape adaptive particle swarm optimizer. Applied Soft Computing 2008, 8(1):295-304.
32. You P.-S. An efficient computational approach for railway booking problems. European Journal of Operational Research 2008, 185:811-824.