Abstract
This paper addresses the application of a plasmid based transgenetic algorithm to the biobjective spanning tree problem, an NP-hard problem with several applications in network design. The proposed evolutionary algorithm is inspired on two major evolutionary forces: the horizontal gene transfer and the endosymbiosis. The computational experiments compare the proposed approach to another transgenetic algorithm and to a GRASP algorithm proposed recently for the investigated problem. The comparison of the algorithms is done with basis on the binary additive ε-indicator. The results show that the proposed algorithm consistently produces better solutions than the other methods.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aggarwal, V., Aneja, Y., Nair, K.: Minimal spanning tree subject to a side constraint. Computers & Operations Research 9, 287–296 (1982)
Arroyo, J.E.C., Vieira, P.S., Vianna, D.S.: A GRASP Algorithm for the Multi-criteria Minimum Spanning Tree Problem. Annals of Operations Research 159, 125–133 (2008)
Bazlamaçci, C.F., Hindi, K.S.: Minimum-weight Spanning Tree Algorithms A Survey and Empirical Study. Computers and Operations Research 28, 767–785 (2001)
Conover, W.J.: Practical Nonparametric Statistics, 3rd edn. John Wiley & Sons, Chichester (2001)
Ehrgott, M., Gandibleux, X.: A Survey and Annotated Bibliography of Multiobjective Combinatorial Optimization. OR Spektrum 22, 425–460 (2000)
Feo, T.A., Resende, M.G.C.: Greedy Randomized Adaptive Search Procedures. Journal of Global Optimization 6, 109–133 (1995)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, New York (1979)
Gen, M., Ida, K., Kim, J.R.: A Spanning Tree-Based Genetic Algorithm for Bicriteria Topological Network Design. In: Proceedings of 1998 IEEE International Conference on Evolutionary Computing, pp. 15–20 (1998)
Goldbarg, M.C., Bagi, L.B., Goldbarg, E.F.G.: Transgenetic algorithm for the traveling purchaser problem. European Journal of Operational Research (2008) (accepted)
Gutin, G., Punnen, A.P.: Traveling Salesman Problem and Its Variations. Kluwer Academic Publishers, Dordrecht (2002)
Hakami, S.L.: Steiner’s Problem in Graphs and Its Implications. Networks 1, 113–133 (1971)
Jain, R., Rivera, M.C., Moore, J.E., Lake, J.A.: Horizontal Gene Transfer Accelerates Genome Innovation and Evolution. Molecular Biology and Evolution 20(10), 1598–1602 (2003)
Knowles, J.D.: Local-Search and Hybrid Evolutionary Algorithms for Pareto Optimization. Ph.D Thesis. Department of Computer Science, University of Reading, Reading, UK (2002)
Knowles, J.D., Corne, D.W.: A Comparison of Encodings and Algorithms for Multiobjective Spanning Tree Problems. In: Proceedings of the 2001 Congress on Evolutionary Computation (CEC 2001), pp. 544–551 (2001)
Margulis, L.: Symbiosis in Cell Evolution: Microbial Communities in the Archean and Proterozoic Eons. W.H. Freeman, New York (2002)
Pierce, S.K., Massey, S.E., Hanten, J.J., Curtis, N.E.: Horizontal Transfer of Functional Nuclear Genes Between Multicellular Organisms. The Biological Bulletin 204, 237–240 (2003)
Raidl, G.R.: An Efficient Evolutionary Algorithm for the Degree-constrained Minimum Spanning Tree Problem. In: Proceedings of the 2000 Congress on Evolutionary Computation (CEC 2000), pp. 104–111. IEEE Press, Los Alamitos (2000)
Ramos, R.M., Alonso, S., Sicília, J., González, C.: The Problem of the Optimal Biobjective Spanning Tree. European Journal of Operational Research 111, 617–628 (1998)
Rocha, D.A.M., Goldbarg, E.F.G., Goldbarg, M.C.: A Memetic Algorithm for the Biob-jective Minimum Spanning Tree Problem. In: Gottlieb, J., Raidl, G.R. (eds.) EvoCOP 2006. LNCS, vol. 3906, pp. 183–194. Springer, Heidelberg (2006)
Rocha, D.A.M., Goldbarg, E.F.G., Goldbarg, M.C.: A New Evolutionary Algorithm for the Biobjective Minimum Spanning Tree. In: ISDA 2007 Seventh International Conference on Intelligent Systems Design and Applications, 2007. Proceedings of ISDA 2007, Rio de Janeiro, vol. 1, pp. 735–740. IEEE Computer Society, Danvers (2007)
Sourd, F., Spanjaard, O., Perny, P.: Multi-objective Branch and Bound. Application to the Biobjective Spanning Tree Problem. In: Proceedings of the 7th International Conference on Multi-Objective Programming and Goal Programming (2006)
Steiner, S., Radzik, T.: Solving the Biobjective Minimum Spanning Tree Problem using a k-best Algorithm. Technical Report TR-03-06, Department of Computer Science, King’s College, London (2003)
Zhou, G., Gen, M.: Genetic Algorithm Approach on Multi-Criteria Minimum Spanning Tree Problem. European Journal of Operational Research 114, 141–152 (1999)
Zitzler, E., Thiele, L., Laumanns, M., Fonseca, C.M., Fonseca, V.G.: Performance Assessment of Multiobjective Optimizers: An Analysis and Review. IEEE Transactions on Evolutionary Computation 7(2), 117–132 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Monteiro, S.M.D., Goldbarg, E.F.G., Goldbarg, M.C. (2009). A Plasmid Based Transgenetic Algorithm for the Biobjective Minimum Spanning Tree Problem. In: Cotta, C., Cowling, P. (eds) Evolutionary Computation in Combinatorial Optimization. EvoCOP 2009. Lecture Notes in Computer Science, vol 5482. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01009-5_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-01009-5_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-01008-8
Online ISBN: 978-3-642-01009-5
eBook Packages: Computer ScienceComputer Science (R0)