Article

A Path Relinking Approach for Delay-Constrained Least-Cost Multicast Routing Problem

Authors:

Nejla Ghaboosi,

Abolfazl Toroghi HaghighatAuthors Info & Claims

ICTAI '07: Proceedings of the 19th IEEE International Conference on Tools with Artificial Intelligence - Volume 01

Pages 383 - 390

https://doi.org/10.1109/ICTAI.2007.28

Published: 29 October 2007 Publication History

Publisher Site

Abstract

Path relinking is an evolutionary approach for solving a diverse array of optimization problems. The NP-complete Steiner tree problem is a fundamental component of many real world telecommunication applications and is a critical structure underlying multicast communications. This paper describes a novel path relinking algorithm for the delay- constrained least-cost multicast routing problem. Computational results on various random generated networks indicate that our proposed path relinking algorithm results in the best overall performance with regard to total tree cost in comparison with other existing algorithms and heuristics. Keywords: Path relinking, Multicast routing, Quality of Service, Constrained Steiner tree

Cited By

View all

Omar KAl-Shaar M(2023)Method for Arabic text Summarization using statistical features and word2vector approachProceedings of the 2023 9th International Conference on Computer Technology Applications10.1145/3605423.3605444(258-262)Online publication date: 10-May-2023
https://dl.acm.org/doi/10.1145/3605423.3605444
Mahseur MBoukra A(2019)Quality of Service (QoS) Optimization in a Multicast RoutingInternational Journal of Applied Metaheuristic Computing10.4018/IJAMC.201904010210:2(27-54)Online publication date: 1-Apr-2019
https://dl.acm.org/doi/10.4018/IJAMC.2019040102
(2016)Comparison of automatic summarisation methods for clinical free text notesArtificial Intelligence in Medicine10.1016/j.artmed.2016.01.00367:C(25-37)Online publication date: 1-Feb-2016
https://dl.acm.org/doi/10.1016/j.artmed.2016.01.003
Show More Cited By

Index Terms

A Path Relinking Approach for Delay-Constrained Least-Cost Multicast Routing Problem

Recommendations

GRASP with path relinking for the weighted MAXSAT problem

A GRASP with path relinking for finding good-quality solutions of the weighted maximum satisfiability problem (MAX-SAT) is described in this paper. GRASP, or Greedy Randomized Adaptive Search Procedure, is a randomized multistart metaheuristic, where, ...
GRASP with Path Relinking for Three-Index Assignment

This paper proposes and tests variants of GRASP (greedy randomized adaptive search procedure) with path relinking for the three-index assignment problem (AP3). GRASP is a multistart metaheuristic for combinatorial optimization. It usually consists of a ...
A GRASP with evolutionary path relinking for the truck and trailer routing problem

In the truck and trailer routing problem (TTRP) a heterogeneous fleet composed of trucks and trailers has to serve a set of customers, some only accessible by truck and others accessible with a truck pulling a trailer. This problem is solved using a ...

Comments

Information & Contributors

Information

Published In

ICTAI '07: Proceedings of the 19th IEEE International Conference on Tools with Artificial Intelligence - Volume 01

October 2007

566 pages

ISBN:076953015X

Publisher

IEEE Computer Society

United States

Publication History

Published: 29 October 2007

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 04 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Omar KAl-Shaar M(2023)Method for Arabic text Summarization using statistical features and word2vector approachProceedings of the 2023 9th International Conference on Computer Technology Applications10.1145/3605423.3605444(258-262)Online publication date: 10-May-2023
https://dl.acm.org/doi/10.1145/3605423.3605444
Mahseur MBoukra A(2019)Quality of Service (QoS) Optimization in a Multicast RoutingInternational Journal of Applied Metaheuristic Computing10.4018/IJAMC.201904010210:2(27-54)Online publication date: 1-Apr-2019
https://dl.acm.org/doi/10.4018/IJAMC.2019040102
(2016)Comparison of automatic summarisation methods for clinical free text notesArtificial Intelligence in Medicine10.1016/j.artmed.2016.01.00367:C(25-37)Online publication date: 1-Feb-2016
https://dl.acm.org/doi/10.1016/j.artmed.2016.01.003
Leitner MRuthmair MRaidl G(2011)Stabilized branch-and-price for the rooted delay-constrained steiner tree problemProceedings of the 5th international conference on Network optimization10.5555/2040817.2040834(124-138)Online publication date: 13-Jun-2011
https://dl.acm.org/doi/10.5555/2040817.2040834
Ruthmair MRaidl G(2010)Variable neighborhood search and ant colony optimization for the rooted delay-constrained minimum spanning tree problemProceedings of the 11th international conference on Parallel problem solving from nature: Part II10.5555/1887255.1887298(391-400)Online publication date: 11-Sep-2010
https://dl.acm.org/doi/10.5555/1887255.1887298

Abstract

Cited By

Index Terms

Recommendations

GRASP with path relinking for the weighted MAXSAT problem

GRASP with Path Relinking for Three-Index Assignment

A GRASP with evolutionary path relinking for the truck and trailer routing problem

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations