Communication network design using particle swarm optimization

Proceedings of the International Multiconference on Computer Science and Information Technology, IMCSIT 2008

Volumn 3, Issue , 2008, Pages 915-920

  Papagianni, C ^a   Papadopoulos, K ^a   Pappas, C ^a   Tselikas, N D ^a   Kaklamani, D T ^a   Venieris, I S ^a  

^a NATIONAL TECHNICAL UNIVERSITY OF ATHENS   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

AVERAGE PACKET DELAYS; COMMUNICATION NETWORKS; DESIGN PROCESS; EVOLUTIONARY APPROACH; HYBRID PARTICLE SWARM OPTIMIZATION ALGORITHM; HYBRID PSO; MULTI OBJECTIVE; MULTI-CRITERIA; NETWORK DESIGN PROBLEMS; NETWORK INFRASTRUCTURE; NETWORK LAYOUT; PREMATURE CONVERGENCE; SINGLE OBJECTIVE;

COMPUTER SCIENCE; DESIGN; INFORMATION TECHNOLOGY; MULTIOBJECTIVE OPTIMIZATION; QUALITY OF SERVICE;

PARTICLE SWARM OPTIMIZATION (PSO);

EID: 70349307497     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IMCSIT.2008.4747351     Document Type: Conference Paper

References (29)

1. R. Kumar, N. Banerjee, " Multicriteria network design using evolutionary algorithm", in 2003 GECCO, pp. 2179-2190.
2. M. Pioro, D. Medhi, " Routing, flow and capacity design in communication and computer networks", Morgan-Kaufmann, 2004.
3. M. Resende, P. Pardalos, " Handbook of Optimization in Telecommunications", Springer, 2006.
4. P. Kampstra, " Evolutionary Computing in telecommunications, A likely EC success story", Thesis, VU university Amsterdam, The Netherlamds, 2005.
5. F. Rothlauf, " Towards a theory of representations for genetic and evolutionary algorithms: Development of basic concepts and their application to binary and tree representations", Ph.D. dissertation, Department of Information systems, University of Bayreth, Germany, 2001.
6. Deb K, Pratap A, Agarwal S, Meyarivan T., " A fast and elitist multi-objective genetic algorithm: NSGA-IL", in Evolutionary Computation, IEEE Transactions on, vol.6, no.2, pp.182-197, Apr 2002.
7. N. Banerjee, R. Kumar, " Multiobjective network design for realistic traffic models.", In Proceedings of GECCO '07, pp. 1904-1911, 2007.
8. A.W. Mohemmed, Z. Mengjie, N.C. Sahoo, " Cooperative Particle Swarm Optimization for the Delay Constrained Least Cost Path Problem", in Proceedings ofEvoCOP 2008, pp. 25-35, 2008.
9. A.W. Mohemmed, N.C. Sahoo, T.K. Geok, " A new particle swarm optimization based algorithm for solving shortest-paths tree problems.", in IEEE CEC 2007, pp. 3221-3225, 2007.
10. F. Rothlauf, D. Goldberg, A. Heinzl, " Network random keys-a tree network representation scheme for genetic and evolutionary algorithms", in Evol. Comput, vol. 10, no. 1, pp. 75-97, Mar. 2002.
11. J. C. Bean, " Genetic algorithms and random keys for sequencing and optimization, " in ORSA Journal on Computing, vol. 6, no. 2, pp. 154-160, 1994.
12. S. Mikki, A. Kishk, " Improved particle swarm optimization technique using hard boundary conditions", in IEEE Microwave and Technology Optical Letters, vol. 46, no. 5, pp. 422-426, Sep. 2005.
13. R. C. Eberhart, Y. Shi, " Comparing inertia weights and constriction factors in particle swarm optimization", in Evolutionary Computation, 2000. Proceedings of the 2000 Congress on, pp.84-88, 2000.
14. J. Riget, J.S. Vesterstroem, " A diversity-guided particle swarm optimizer-the ARPSO", EVALife Technical Report no. 2002-02.
15. N. Higashi, H. Iba, " Particle swarm optimization with Gaussian mutation", in. SIS '03. Proceedings of the 2003 IEEE, pp. 72-79, April 2003.
16. C. F. Juang, " A hybrid of genetic algorithm and particle swarm optimization for recurrent network design", in IEEE Transactions on Systems Man nd Cybernetics Part B, vol.34, no.2, pp. 997-1006, April 2004.
17. Q. Zhang, X. Li, Q. Trana, " Modified Particle Swarm Optimization Algorithm", in Machine Learning and Cybernetics, 2005. Proceedings of 2005 International Conference on, vol.5, pp. 2993-2995, Aug. 2005.
18. R. C. Eberhart, Y. Shi, " Comparison between Genetic Algorithms and Particle Swarm Optimization", in Evolutionary Programming VII: Proceedings of the Seventh Annual Conference on Evolutionary Programming, pp. 611-616, 1998.
19. R. Hassan, B. K. Cohanim, O. D. Week, G. A. Venter, " A omparison of particle swarm optimization and the genetic algorithm", in Proceedings of the 1st AIAA Multidisciplinary Design Optimization Specialist Conference, April 2005.
20. X. Hu, R. Eberhart, " Multiobjective Optimization Using Dynamic Neighborhood Particle Swarm Optimization", in Proceedings of the 2002 Congress on Evolutionary Computation, IEEE World Congress on Computational Intelligence, pp. 1677-1681, May 2002.
21. K. E. Parsopoulos, M. N. Vrahatis. " Particle Swarm Optimization Method in Multiobjective Problems", in Proceedings of the 2002 ACM Symposium on Applied Computing (SAC 2002), pp. 603-607, 2002.
22. U. Baumgartner, Ch. Magele, W. Renhart. " Pareto optimality and particle swarm optimization", in Magnetics, IEEE Transactions on, vol. 40, no.2, pp. 1172-1175, March 2004.
23. J. E Fieldsend, R. M. Everson, S. Singh, " Using unconstrained elite archives for multiobjective optimization", Evolutionary Computation, IEEE Transactions on, vol.7, no.3, pp. 305-323, June 2003.
24. T. Ray, K. M. Liew. " A swarm metaphor for multiobjective design optimization", in Engineering Optimization, vol. 34, no. 2, pp. 141-153, March 2002.
25. C. A. Coello, M. S. Lechunga, " MOPSO: A Proposal for Multiple Objective Particle Swarm Optimization", in Proceedings of the 2002 Congress on Evolutionary Computation, IEEE World Congress on Computational Intelligence, pp. 1051-1056, May 2002.
26. C. Palmer, " An Approach to a Problem in Network Design Using Genetic Algorithms" Ph.D. dissertation, Polytechnic University, Brooklyn, New York.
27. G. R. Raidl, " Various instances of optimal communication spanning tree problems, " personal communication, February 2001.
28. Franz Rothlauf, " Representations for genetic and evolutionary algorithms", Springer-Verlang, 2006.
29. T. C. Hu, " Optimum communication spanning trees", in SIAMJ. on Computing, pp. 188-195, 1974.