Multicriteria Network Design Using Distributed Evolutionary Algorithm
- 317 Downloads
In this paper, we revisit a general class of multicriteria multiconstrained network design problems and attempt to solve, in a novel way, with a Distributed Evolutionary Algorithm (EA). A major challenge to solving such problems is to capture possibly all the (representative) equivalent and diverse solutions at convergence. In this work, we formulate, without loss of generality, a bi-criteria bi-constrained communication network topological design problem. Two of the primary objectives to be optimized are network delay and cost subject to satisfaction of reliability and flow-constraints. This is a NP-hard problem and the two-objective optimal solution front is not known a priori. Therefore, we adopt randomized search method and use multiobjective EA that produces diverse solution-space. We employ a distributed version of the algorithm and generate solutions from multiple tribes to ensure convergence. We tested this approach for designing networks of different sizes and found that the approach scales well with larger networks. Results are compared with those obtained by two traditional approaches namely, the exhaustive search and a heuristic search.
KeywordsSpan Tree Network Design Pareto Front Exhaustive Search Multiobjective Optimization
Unable to display preview. Download preview PDF.
- 2.Hochbaum, D. (ed.): Approximation Algorithms for NP-Hard problems. PWS, Boston (1997)Google Scholar
- 4.Kompella, V.P., Pasquale, J.C., Polyzos, G.C.: Multicast routing for multimedia communication. IEEE/ACM Trans. Networking, 286–292 (1993)Google Scholar
- 10.Deb, K.: Multiobjective Optimization Using Evolutionary Algorithms. Wiley, Chichester (2001)Google Scholar
- 13.Zitzler, E., Laumanns, M., Thiele, L.: SPEA2: Improving the strength Pareto evolutionary algorithm. In: EUROGEN 2001 (2001)Google Scholar
- 17.Purshouse, R.C., Fleming, P.J.: Elitism, sharing and ranking choices in evolutionary multi-criterion optimization. Research Report No. 815, Dept. Automatic Control & Systems Engineering, University of Sheffield (January 2002)Google Scholar
- 21.Atamturk, A., Rajan, D.: Survivable network design: simultaneous routing of flows and slacks. Research Report, IEOR, University of California at BerkeleyGoogle Scholar
- 22.Feo, T.A., Resende, M.G.C.: Greedy randomized adaptive search procedures. Journal of Global Optimization (1995)Google Scholar
- 24.Baran, B., Laufer, F.: Topological optimization of reliable networks using A-Teams. National Computer Center, National University of Asuncion, University Campus of San Lorenzo - ParaguayGoogle Scholar
- 25.Abuali, F.N., Schnoenefeld, D.A., Wainwright, R.L.: Designing telecommunication networks using genetic algorithms and probabilistic minimum spanning Trees. In: Proc. 1994 ACM Symp. Applied Computing, pp. 242–246 (1994)Google Scholar
- 26.Ko, K.T., Tang, K.S., Chan, C.Y., Man, K.F., Kwong, S.: Using genetic algorithms to design mesh networks. IEEE Computer 30(8), 56–61 (1997)Google Scholar