Referenced Items are not available for this document.
Combinatorial optimization problems with multiple objectives are, in general, more realistic representations of practical situations than their counterparts with a single-objective. The bi-objective minimum spanning tree problem is an NP-hard problem with applications in network design. In this paper a transgenetic algorithm is applied to this problem. A computational experiment compares the proposed approach with a memetic algorithm. The comparison of the algorithms is done with basis on three indicators and statistical tests.
Published in:
Intelligent Systems Design and Applications, 2007. ISDA 2007. Seventh International Conference on
Date of Conference: 20-24 Oct. 2007
- Page(s):
- 735 - 740
- Print ISBN:
- 978-0-7695-2976-9
- INSPEC Accession Number:
- 9878557
- Conference Location :
- Rio de Janeiro
- Digital Object Identifier :
- 10.1109/ISDA.2007.24
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
