skip to main content
10.1145/2598394.2598431acmconferencesArticle/Chapter ViewAbstractPublication PagesgeccoConference Proceedingsconference-collections
poster

A novel genetic algorithm based on partitioning for large-scale network design problems

Published: 12 July 2014 Publication History

Abstract

Network design is a broad class of essential engineering and science problems. The target of network design is to construct a graph that satisfies some restrictions. Many network design problems (NDPs) are known as NP-hard and become more challenging as networks grow fast in size. In this paper, we propose a novel genetic algorithm based on partitioning, termed PGA, which divides large-scale NDPs into low dimensional sub-problems and achieves global optimal solution by coordination of sub-problems. Experiments with PGA applied to the degree-constrained minimum spanning tree problem have shown the effectiveness of PGA for large-scale NDPs.

References

[1]
R. Subbu and A. C. Sanderson, "Modeling and convergence analysis of distributed coevolutionary algorithms," IEEE Transactions on Systems, Man, and Cybernetics - Part B: Cybernetics, vol. 34, no. 2, pp. 806--822, Apr. 2004.
[2]
G. R. Raidl, and B. A. Julstrom, "Edge sets: an effective evolutionary encoding of spanning trees," IEEE Trans. Evol. Comput., vol. 7, no. 3, pp. 225--239, June 2003.
[3]
C. B. Lucasius, A. D. Dane and G. Kateman, "On k-medoid clustering of large data sets with the aid of a genetic algorithm: background, feasibility and comparison," Analytical Chimica Acta, vol. 282, no. 3, pp. 647--669, 1993.
[4]
J. Knowles, and D. Corne, "A new evolutionary approach to the degree-constrained minimum spanning tree problem," IEEE Trans. Evol. Comput., vol. 4, no. 2, pp. 125--134, July 2000.

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
GECCO Comp '14: Proceedings of the Companion Publication of the 2014 Annual Conference on Genetic and Evolutionary Computation
July 2014
1524 pages
ISBN:9781450328814
DOI:10.1145/2598394
Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 12 July 2014

Check for updates

Author Tags

  1. Network design
  2. co-evolution
  3. degree-constrained minimum spanning tree problem
  4. genetic algorithm
  5. problem decoupling

Qualifiers

  • Poster

Funding Sources

Conference

GECCO '14
Sponsor:
GECCO '14: Genetic and Evolutionary Computation Conference
July 12 - 16, 2014
BC, Vancouver, Canada

Acceptance Rates

GECCO Comp '14 Paper Acceptance Rate 180 of 544 submissions, 33%;
Overall Acceptance Rate 1,669 of 4,410 submissions, 38%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)2
  • Downloads (Last 6 weeks)1
Reflects downloads up to 15 Sep 2024

Other Metrics

Citations

Cited By

View all

View Options

Get Access

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media