Monte Carlo Tree Search Algorithm for the Euclidean Steiner Tree Problem
This study is concerned with a novel Monte Carlo Tree Search algorithm for the problem of minimal Euclidean Steiner tree on a plane. Given p p p points (terminals) on a plane, the goal is to find a connection between all the points, so that the total sum of the lengths of edges is as low as possible,...
Uložené v:
| Vydané v: | Journal of Telecommunications and Information Technology Ročník 4; číslo 2017; s. 71 - 81 |
|---|---|
| Hlavný autor: | |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
National Institute of Telecommunications
01.01.2018
|
| Predmet: | |
| ISSN: | 1509-4553, 1899-8852 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | This study is concerned with a novel Monte Carlo Tree Search algorithm for the problem of minimal Euclidean Steiner tree on a plane. Given p p p points (terminals) on a plane, the goal is to find a connection between all the points, so that the total sum of the lengths of edges is as low as possible, while an addition of extra points (Steiner points) is allowed. Finding the minimum Steiner tree is known to be np-hard. While exact algorithms exist for this problem in 2D, their efficiency decreases when the number of terminals grows. A novel algorithm based on Upper Confidence Bound for Trees is proposed. It is adapted to the specific characteristics of Steiner trees. A simple heuristic for fast generation of feasible solutions based on Fermat points is proposed together with a correction procedure. By combing Monte Carlo Tree Search and the proposed heuristics, the proposed algorithm is shown to work better than both the greedy heuristic and pure Monte Carlo simulations. Results of numerical experiments for randomly generated and benchmark library problems (from OR-Lib) are presented and discussed. |
|---|---|
| AbstractList | This study is concerned with a novel Monte Carlo Tree Search algorithm for the problem of minimal Euclidean Steiner tree on a plane. Given p p p points (terminals) on a plane, the goal is to find a connection between all the points, so that the total sum of the lengths of edges is as low as possible, while an addition of extra points (Steiner points) is allowed. Finding the minimum Steiner tree is known to be np-hard. While exact algorithms exist for this problem in 2D, their efficiency decreases when the number of terminals grows. A novel algorithm based on Upper Confidence Bound for Trees is proposed. It is adapted to the specific characteristics of Steiner trees. A simple heuristic for fast generation of feasible solutions based on Fermat points is proposed together with a correction procedure. By combing Monte Carlo Tree Search and the proposed heuristics, the proposed algorithm is shown to work better than both the greedy heuristic and pure Monte Carlo simulations. Results of numerical experiments for randomly generated and benchmark library problems (from OR-Lib) are presented and discussed. |
| Author | Bereta, Michał |
| Author_xml | – sequence: 1 givenname: Michał orcidid: 0000-0002-7153-980X surname: Bereta fullname: Bereta, Michał organization: Cracow University of Technology: Krakow, PL |
| BookMark | eNo9kM1OwkAUhScGExF5AHd9geK9087fkhAUEowm4Hoynd6BktIx07rw7QUxrs7Jycm3-O7ZqIsdMfaIMONSFvLpODTDjAOqGfJL3LAxamNyrQUfnbsAk5dCFHds2vdHAOBGCuB8zFavsRsoW7jUxmyXiLItueQP2bzdx9QMh1MWYsqGA2XLL982Nbku2w7UdJSu__cUq5ZOD-w2uLan6V9O2MfzcrdY5Zu3l_Vivsk956hydNogCOIKeInCg-PSB3R1UXIMTnJnKm9UcD5UXqoApjQo1PmETplKFxO2vnLr6I72MzUnl75tdI39HWLaW5eGxrdkkUyoUdUgQZdUSa0DFMGrSnHQlVdnFl5ZPsW-TxT-eQj216y9mLUXpfZqtvgBSeNs6g |
| Cites_doi | 10.1109/tciaig.2012.2186810 10.1111/itor.12168 10.1016/j.swevo.2011.02.002 10.1007/BF01758756 10.1109/MPER.2002.4312583 10.1038/nature16961 10.4153/CMB-1961-016-2 10.1109/icseng.2005.49 10.1007/s00453-008-9244-5 10.1109/34.44404 10.1023/A:1013689704352 10.1057/jors.1990.166 10.1002/(SICI)1097-0037(199710)30:3<149::AID-NET1>3.0.CO;2-L |
| ContentType | Journal Article |
| DBID | AAYXX CITATION DOA |
| DOI | 10.26636/jtit.2017.122017 |
| DatabaseName | CrossRef DOAJ Directory of Open Access Journals |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | CrossRef |
| Database_xml | – sequence: 1 dbid: DOA name: DOAJ Directory of Open Access Journals url: https://www.doaj.org/ sourceTypes: Open Website |
| DeliveryMethod | fulltext_linktorsrc |
| EISSN | 1899-8852 |
| EndPage | 81 |
| ExternalDocumentID | oai_doaj_org_article_1e9fd17d06084eb688f03fc7b7208bc7 10_26636_jtit_2017_122017 |
| GroupedDBID | 8FE 8FG AAYXX ABUWG AFFHD AFKRA ALMA_UNASSIGNED_HOLDINGS ARAPS BENPR BGLVJ BPHCQ BYOGL CCPQU CITATION GROUPED_DOAJ HCIFZ K6V K7- P2P P62 PHGZM PHGZT PQGLB PQQKQ PROAC Y2W |
| ID | FETCH-LOGICAL-c2217-1a89105e2702415c0a26cf1ad3421fa62a9bc97facfbc67f094915726c1a79b83 |
| IEDL.DBID | DOA |
| ISSN | 1509-4553 |
| IngestDate | Fri Oct 03 12:50:31 EDT 2025 Sat Nov 29 02:43:38 EST 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 2017 |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c2217-1a89105e2702415c0a26cf1ad3421fa62a9bc97facfbc67f094915726c1a79b83 |
| ORCID | 0000-0002-7153-980X |
| OpenAccessLink | https://doaj.org/article/1e9fd17d06084eb688f03fc7b7208bc7 |
| PageCount | 11 |
| ParticipantIDs | doaj_primary_oai_doaj_org_article_1e9fd17d06084eb688f03fc7b7208bc7 crossref_primary_10_26636_jtit_2017_122017 |
| PublicationCentury | 2000 |
| PublicationDate | 2018-01-00 |
| PublicationDateYYYYMMDD | 2018-01-01 |
| PublicationDate_xml | – month: 01 year: 2018 text: 2018-01-00 |
| PublicationDecade | 2010 |
| PublicationTitle | Journal of Telecommunications and Information Technology |
| PublicationYear | 2018 |
| Publisher | National Institute of Telecommunications |
| Publisher_xml | – name: National Institute of Telecommunications |
| References | ref13 ref12 ref15 ref14 ref20 ref11 ref10 ref0 ref2 ref1 ref17 ref16 ref19 ref18 ref8 ref7 ref9 ref4 ref3 ref6 ref5 |
| References_xml | – ident: ref13 – ident: ref1 doi: 10.1109/tciaig.2012.2186810 – ident: ref12 doi: 10.1111/itor.12168 – ident: ref4 – ident: ref3 – ident: ref19 doi: 10.1016/j.swevo.2011.02.002 – ident: ref6 – ident: ref20 – ident: ref11 doi: 10.1007/BF01758756 – ident: ref5 doi: 10.1109/MPER.2002.4312583 – ident: ref0 doi: 10.1038/nature16961 – ident: ref8 doi: 10.4153/CMB-1961-016-2 – ident: ref7 doi: 10.1109/icseng.2005.49 – ident: ref2 doi: 10.1007/s00453-008-9244-5 – ident: ref15 doi: 10.1109/34.44404 – ident: ref17 doi: 10.1023/A:1013689704352 – ident: ref18 – ident: ref14 doi: 10.1057/jors.1990.166 – ident: ref9 doi: 10.1002/(SICI)1097-0037(199710)30:3<149::AID-NET1>3.0.CO;2-L – ident: ref16 – ident: ref10 |
| SSID | ssj0002965022 |
| Score | 2.050711 |
| Snippet | This study is concerned with a novel Monte Carlo Tree Search algorithm for the problem of minimal Euclidean Steiner tree on a plane. Given p p p points... |
| SourceID | doaj crossref |
| SourceType | Open Website Index Database |
| StartPage | 71 |
| SubjectTerms | Euclidean Steiner tree problem MCTS Monte Carlo Tree Search UCT algorithm |
| Title | Monte Carlo Tree Search Algorithm for the Euclidean Steiner Tree Problem |
| URI | https://doaj.org/article/1e9fd17d06084eb688f03fc7b7208bc7 |
| Volume | 4 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAON databaseName: DOAJ Directory of Open Access Journals customDbUrl: eissn: 1899-8852 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0002965022 issn: 1509-4553 databaseCode: DOA dateStart: 20150101 isFulltext: true titleUrlDefault: https://www.doaj.org/ providerName: Directory of Open Access Journals – providerCode: PRVPQU databaseName: Advanced Technologies & Aerospace Database customDbUrl: eissn: 1899-8852 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0002965022 issn: 1509-4553 databaseCode: P5Z dateStart: 20140701 isFulltext: true titleUrlDefault: https://search.proquest.com/hightechjournals providerName: ProQuest – providerCode: PRVPQU databaseName: Computer Science Database customDbUrl: eissn: 1899-8852 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0002965022 issn: 1509-4553 databaseCode: K7- dateStart: 20140701 isFulltext: true titleUrlDefault: http://search.proquest.com/compscijour providerName: ProQuest – providerCode: PRVPQU databaseName: East Europe, Central Europe Database customDbUrl: eissn: 1899-8852 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0002965022 issn: 1509-4553 databaseCode: BYOGL dateStart: 20140701 isFulltext: true titleUrlDefault: https://search.proquest.com/eastcentraleurope providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 1899-8852 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0002965022 issn: 1509-4553 databaseCode: BENPR dateStart: 20140701 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3PS8MwFA4yPHgRRcX5ixw8CXVNmjbJcQ7HLo6BE4aXkp86mJ3Uzb_fl2TKPHnx0kJ5lPRL6fe-5uV7CF1bzYiSosoMVWXGQEFkymqfcWKB7my0YI_NJvh4LGYzOdlq9RVqwpI9cAKuR5z0lnCbV7lgTldC-LzwhmtOc6FN3Eeec7klpsI3mErIPOISAiQ8MmNlWaQlTeCjouqFnC-UdfFbQsPpFyltefdHkhkeoP1Ndoj7aVSHaMc1R2j0EByk8EC1iyWets7hVCOM-4uXJWj71zcMmSeGTA7fr81ibp1q8GPoYunaFD9JXWOO0dPwfjoYZZsGCIAcSIWMKAFsXrqwZwyI1uSKVsYTZQtGiVcVVVIbyb0yXpuKe5BqkpQcgojiUoviBHWaZeNOEQZVJEDcGHh-zTyLrvMup14q7QtrRRfdfCNQvyefixr0QYSrDnDVAac6wdVFdwGjn8BgUR0vwMTVm4mr_5q4s_-4yTnagwGJ9E_kAnVW7dpdol3zuZp_tFfxnYDjpHz-AsLBuL4 |
| linkProvider | Directory of Open Access Journals |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Monte+Carlo+Tree+Search+Algorithm+for+the+Euclidean+Steiner+Tree+Problem&rft.jtitle=Journal+of+Telecommunications+and+Information+Technology&rft.au=Bereta%2C+Micha%C5%82&rft.date=2018-01-01&rft.issn=1509-4553&rft.eissn=1899-8852&rft.volume=4&rft.issue=2017&rft.spage=71&rft.epage=81&rft_id=info:doi/10.26636%2Fjtit.2017.122017&rft.externalDBID=n%2Fa&rft.externalDocID=10_26636_jtit_2017_122017 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1509-4553&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1509-4553&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1509-4553&client=summon |