An encoding in metaheuristics for the minimum communication spanning Tree problem
- Publikationstyp:
- Zeitschriftenaufsatz
- Metadaten:
-
- Autoren
- Sammlungen
- metadata
- ISSN
- 1091-9856
- Ausgabe der Veröffentlichung
- 4
- Zeitschrift
- INFORMS journal on computing
- Schlüsselwörter
- 004 Informatik
- 004 Data processing
- Sprache
- eng
- Paginierung
- Seiten: 575 - 584
- Datum der Veröffentlichung
- 2009
- Herausgeber
- INFORMS
- Herausgeber URL
- http://dx.doi.org/10.1287/ijoc.1080.0310
- Datum der Datenerfassung
- 2020
- Datum, an dem der Datensatz öffentlich gemacht wurde
- 2020
- Zugang
- Public
- Titel
- An encoding in metaheuristics for the minimum communication spanning Tree problem
- Ausgabe der Zeitschrift
- 21
Datenquelle: METADATA.UB
- Andere Metadatenquellen:
-
- Autoren
- Autoren-URL
- https://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=fis-test-1&SrcAuth=WosAPI&KeyUT=WOS:000271524200004&DestLinkType=FullRecord&DestApp=WOS_CPL
- DOI
- 10.1287/ijoc.1080.0310
- eISSN
- 1526-5528
- Externe Identifier
- Clarivate Analytics Document Solution ID: 516EI
- ISSN
- 1091-9856
- Ausgabe der Veröffentlichung
- 4
- Zeitschrift
- INFORMS JOURNAL ON COMPUTING
- Schlüsselwörter
- problem-specific representations
- trees
- metaheuristics
- encodings
- communication networks
- Paginierung
- 575 - 584
- Datum der Veröffentlichung
- 2009
- Status
- Published
- Titel
- An Encoding in Metaheuristics for the Minimum Communication Spanning Tree Problem
- Sub types
- Article
- Ausgabe der Zeitschrift
- 21
Datenquelle: Web of Science (Lite)
- Abstract
- <jats:p> Problem-specific encodings can improve the performance of metaheuristics, such as genetic algorithms or simulated annealing. This paper studies the link-biased (LB) encoding, which is a tree representation, and applies metaheuristics using this encoding to the minimum communication spanning tree (MCST) problem. Given the communication requirements of the nodes, the MCST problem seeks a communication spanning tree with minimum total cost. Optimal solutions for MCST problems are similar to minimum spanning trees (MSTs), and the LB encoding exploits this property by encoding trees similar to MSTs with higher probability. The paper investigates how to systematically design problem-specific encodings for MCST problems and how to set the encoding-specific parameter that controls the bias of the LB encoding towards MSTs; it then presents performance results for various MCST problems. </jats:p>
- Autoren
- DOI
- 10.1287/ijoc.1080.0310
- eISSN
- 1526-5528
- ISSN
- 1091-9856
- Ausgabe der Veröffentlichung
- 4
- Zeitschrift
- INFORMS Journal on Computing
- Sprache
- en
- Paginierung
- 575 - 584
- Datum der Veröffentlichung
- 2009
- Status
- Published
- Herausgeber
- Institute for Operations Research and the Management Sciences (INFORMS)
- Herausgeber URL
- http://dx.doi.org/10.1287/ijoc.1080.0310
- Datum der Datenerfassung
- 2023
- Titel
- An Encoding in Metaheuristics for the Minimum Communication Spanning Tree Problem
- Ausgabe der Zeitschrift
- 21
Datenquelle: Crossref
- Autoren
- DOI
- 10.1287/ijoc.1080.0310
- Zeitschrift
- INFORMS J. Comput.
- Artikelnummer
- 4
- Paginierung
- 575 - 584
- Datum der Veröffentlichung
- 2009
- Titel
- An Encoding in Metaheuristics for the Minimum Communication Spanning Tree Problem.
- Ausgabe der Zeitschrift
- 21
Datenquelle: DBLP
- Author's licence
- CC-BY
- Autoren
- Hosting institution
- Universitätsbibliothek Mainz
- Resource version
- Published version
- DOI
- 10.1287/ijoc.1080.0310
- File(s) embargoed
- false
- Open access
- true
- ISSN
- 1091-9856
- Ausgabe der Veröffentlichung
- 4
- Zeitschrift
- INFORMS journal on computing
- Sprache
- eng
- Open access status
- Open Access
- Paginierung
- 575 - 584
- Herausgeber
- INFORMS
- Zugang
- Deleted
- Titel
- An encoding in metaheuristics for the minimum communication spanning Tree problem
- Ausgabe der Zeitschrift
- 21
Files
an_encoding_in_metaheuristics-20230626095224742.pdf
Datenquelle: OPENSCIENCE.UB
- Abstract
- Problem-specific encodings can improve the performance of metaheuristics, such as genetic algorithms or simulated annealing. This paper studies the link-biased (LB) encoding, which is a tree representation, and applies metaheuristics using this encoding to the minimum communication spanning tree (MCST) problem. Given the communication requirements of the nodes, the MCST problem seeks a communication spanning tree with minimum total cost. Optimal solutions for MCST problems are similar to minimum spanning trees (MSTs), and the LB encoding exploits this property by encoding trees similar to MSTs with higher probability. The paper investigates how to systematically design problem-specific encodings for MCST problems and how to set the encoding-specific parameter that controls the bias of the LB encoding towards MSTs; it then presents performance results for various MCST problems.
- Addresses
- Department of Information Systems, University of Mainz, 55099 Mainz, Germany
- Autoren
- Ausgabe der Veröffentlichung
- 4
- Schlüsselwörter
- problem-specific representations
- trees
- metaheuristics
- encodings
- communication networks
- Paginierung
- 575 - 584
- Datum der Veröffentlichung
- 2009
- Titel
- An Encoding in Metaheuristics for the Minimum Communication Spanning Tree Problem
- Ausgabe der Zeitschrift
- 21
Datenquelle: RePEc
- Beziehungen:
- Eigentum von