Article

Free access

A hybrid algorithm for the point to multipoint routing problem

Authors:

Heather L. Christensen,

Roger L. Wainwright,

Dale A. SchoenefeldAuthors Info & Claims

SAC '97: Proceedings of the 1997 ACM symposium on Applied computing

Pages 263 - 268

https://doi.org/10.1145/331697.331751

Published: 01 April 1997 Publication History

PDF eReader

References

[1]

Michael J. Alexander and Gabriel Robins, "New Performance-Driven FPGA Routing Algorithms", Proceedings of ACM/SIGDA Design Automation Conference, June 1995.

Digital Library

Google Scholar

[2]

J.E. Beasley, "OR-Library: distributing test problems by electronic mail," J. Opl. Res. Soc., vol. 41, pp 1069- 1072, 1990.

Crossref

Google Scholar

[3]

A.L. Corcoran and R.L. Wainwright, "Using LibGA to Develop Genetic Algorithms for Solving Combinatorial Optimization Problems", Practical Handbook of Genetic Algorithms, Vol. 1, Lance Chambers, ed., CRC Press, 1995, pp 143- 172.

Google Scholar

[4]

Louis Anthony Cox, Jr., Lawrence Davis and Yuping Qiu, "Dynamic Anticipatory Routing In Circuit- Switched Telecommunications Networks", Handbook of Genetic Algorithms, Lawrence Davis, ed., Van Nostrand Reinhold, 1991, pp 124- 143.

Google Scholar

[5]

L. Davis, editor, Handbook of Genetic Algorithms, Van Nostrand Reinhold, 1991.

Google Scholar

[6]

Henrik Esbensen, "Finding (Near-) Optimal Steiner Trees in Large Graphs", Proceedings of the Sixth International Conference on Genetic Algorithms, Morgan Kaufmann Publishers, inc., 1995, pp 485- 492.

Digital Library

Google Scholar

[7]

D. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley, 1989.

Digital Library

Google Scholar

[8]

Melaine Mitchell, An Introduction to Genetic Algorithms, The MIT Press, 1996.

Digital Library

Google Scholar

[9]

Gregory Rawlins, editor, Foundations of Genetic Algorithms, Morgan Kaufman, 1991.

Digital Library

Google Scholar

Cited By

View all

Salcedo-Sanz S(2009)SurveyComputer Science Review10.1016/j.cosrev.2009.07.0013:3(175-192)Online publication date: 1-Aug-2009
https://dl.acm.org/doi/10.1016/j.cosrev.2009.07.001
Moin NHalim H(2008)Genetic Algorithm and Variable Neighborhood Search for Point to Multipoint Routing ProblemSoftware Engineering Research, Management and Applications10.1007/978-3-540-70561-1_10(131-140)Online publication date: 2008
https://doi.org/10.1007/978-3-540-70561-1_10
Rahman MMondol SHossain GDey A(2007)A Hybrid Jumping Genes Genetic Algorithm Based Request Scheduling Approach in Multiple Destination Routing2007 International Conference on Information and Communication Technology10.1109/ICICT.2007.375405(331-335)Online publication date: Mar-2007
https://doi.org/10.1109/ICICT.2007.375405
Show More Cited By

Index Terms

A hybrid algorithm for the point to multipoint routing problem

Recommendations

A hybrid genetic algorithm for the point to multipoint routing problem with single split paths
SAC '01: Proceedings of the 2001 ACM symposium on Applied computing
Group multicast routing problem: A genetic algorithms based approach

To save network resources, multicast transmissions are more and more adopted by the operators when the same content has to reach several destinations in parallel, such as in IPTV services, radio broadcast and video-clip streaming. Though, with respect ...
Using messy genetic algorithms for solving the winner determination problem
GECCO '10: Proceedings of the 12th annual conference companion on Genetic and evolutionary computation

The paper presents a study on the application of messy genetic algorithms for the winner determination problem in the combinatorial auction realm. Messy genetic algorithms operate explicitly on building blocks in order to obtain good solutions. Since ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

SAC '97: Proceedings of the 1997 ACM symposium on Applied computing

April 1997

545 pages

ISBN:0897918509

DOI:10.1145/331697

Editors:
Barrett Bryant
Univ. of Alabama, Birmingham, AL
,
Janice Carroll
Sam Houston State Univ.
,
Dave Oppenheim,
Jim Hightower
California State Univ.-Fullerton, Fullerton, CA
,
K. M. George
Oklahoma State Univ.

Permission to make digital or hard copies of all or part 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 components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 April 1997

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

SAC97

Sponsor:

SAC97: 1997 Symposium on Applied Computing

California, San Jose, USA

Acceptance Rates

Overall Acceptance Rate 1,650 of 6,669 submissions, 25%

Upcoming Conference

SAC '25

Sponsor:
sigapp

The 40th ACM/SIGAPP Symposium on Applied Computing

March 31 - April 4, 2025

Catania , Italy

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
368
Total Downloads

Downloads (Last 12 months)24
Downloads (Last 6 weeks)4

Reflects downloads up to 05 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Salcedo-Sanz S(2009)SurveyComputer Science Review10.1016/j.cosrev.2009.07.0013:3(175-192)Online publication date: 1-Aug-2009
https://dl.acm.org/doi/10.1016/j.cosrev.2009.07.001
Moin NHalim H(2008)Genetic Algorithm and Variable Neighborhood Search for Point to Multipoint Routing ProblemSoftware Engineering Research, Management and Applications10.1007/978-3-540-70561-1_10(131-140)Online publication date: 2008
https://doi.org/10.1007/978-3-540-70561-1_10
Rahman MMondol SHossain GDey A(2007)A Hybrid Jumping Genes Genetic Algorithm Based Request Scheduling Approach in Multiple Destination Routing2007 International Conference on Information and Communication Technology10.1109/ICICT.2007.375405(331-335)Online publication date: Mar-2007
https://doi.org/10.1109/ICICT.2007.375405
Galiasso PWainwright RLamont G(2001)A hybrid genetic algorithm for the point to multipoint routing problem with single split pathsProceedings of the 2001 ACM symposium on Applied computing10.1145/372202.372354(327-332)Online publication date: 1-Mar-2001
https://dl.acm.org/doi/10.1145/372202.372354
Liming Zhu Wainwright RSchoenefeld D(1998)A genetic algorithm for the point to multipoint routing problem with varying number of requests1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360)10.1109/ICEC.1998.699496(171-176)Online publication date: 1998
https://doi.org/10.1109/ICEC.1998.699496

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

A hybrid genetic algorithm for the point to multipoint routing problem with single split paths

Group multicast routing problem: A genetic algorithms based approach

Using messy genetic algorithms for solving the winner determination problem