Ant-Line: A Line-Oriented ACO Algorithm for the Set Covering Problem

Ant-Line: A Line-Oriented ACO Algorithm for the Set Covering Problem

This paper proposes the algorithm based on the metaheuristic Ant Colony Optimization (ACO) called Ant-Line, which uses the line-oriented approach for the set covering problem, that is an innovative and emerging approach in the context, beyond the use of a local search. The algorithm is compared with...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Mulati, M. H., Constantino, A. A.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Ant colony optimization
Ant Colony Optimization. Ant-Line. Set covering problem. Combinatorial optimization. Metaheuristic Line-orientation
Context
Equations
Heuristic algorithms
Integrated circuits
Optimization
Search problems
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 274
container_issue
container_start_page 265
container_title
container_volume
creator Mulati, M. H.
Constantino, A. A.
description This paper proposes the algorithm based on the metaheuristic Ant Colony Optimization (ACO) called Ant-Line, which uses the line-oriented approach for the set covering problem, that is an innovative and emerging approach in the context, beyond the use of a local search. The algorithm is compared with other ACO-based approaches. The results obtained are promising and have reached good quality of solution and running time.
doi_str_mv 10.1109/SCCC.2011.34
format Conference Proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_6363406</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6363406</ieee_id><sourcerecordid>6363406</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-d295e22e206752c22d301c93c8b61e6591ec98265c9f0d9a4cd85a67ac9bafcb3</originalsourceid><addsrcrecordid>eNotj8tqwzAQANUXNE1z660X_YBS7UpaW70Z9QmBFNKegy2vU5XELoop9O_7PM1hYGCEuAA9B9D-ahVCmKMGmBt7IGa-KHVB3lkqPR2KCZIHpcng0a8DS4UBQ9Yciwk4RGW9xlNxtt-_aY0aPUzETdWPapF6vpaV_KFa5sT9yK2swlJW282Q0_i6k92Q5fjKcsWjDMMH59Rv5FMemi3vzsVJV2_3PPvnVLzc3T6HB7VY3j-GaqESFG5ULXrHiIyaCocRsTUaojexbAiYnAeOvkRy0Xe69bWNbelqKurom7qLjZmKy79uYub1e067On-uyZCx39tfznFMxw</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Ant-Line: A Line-Oriented ACO Algorithm for the Set Covering Problem</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Mulati, M. H. ; Constantino, A. A.</creator><creatorcontrib>Mulati, M. H. ; Constantino, A. A.</creatorcontrib><description>This paper proposes the algorithm based on the metaheuristic Ant Colony Optimization (ACO) called Ant-Line, which uses the line-oriented approach for the set covering problem, that is an innovative and emerging approach in the context, beyond the use of a local search. The algorithm is compared with other ACO-based approaches. The results obtained are promising and have reached good quality of solution and running time.</description><identifier>ISSN: 1522-4902</identifier><identifier>ISBN: 9781467313643</identifier><identifier>ISBN: 1467313645</identifier><identifier>EISSN: 2691-0632</identifier><identifier>EISBN: 9780769546896</identifier><identifier>EISBN: 0769546897</identifier><identifier>DOI: 10.1109/SCCC.2011.34</identifier><identifier>CODEN: IEEPAD</identifier><language>eng</language><publisher>IEEE</publisher><subject>Ant colony optimization ; Ant Colony Optimization. Ant-Line. Set covering problem. Combinatorial optimization. Metaheuristic Line-orientation ; Context ; Equations ; Heuristic algorithms ; Integrated circuits ; Optimization ; Search problems</subject><ispartof>2011 30th International Conference of the Chilean Computer Science Society, 2011, p.265-274</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6363406$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2052,27902,54895</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6363406$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Mulati, M. H.</creatorcontrib><creatorcontrib>Constantino, A. A.</creatorcontrib><title>Ant-Line: A Line-Oriented ACO Algorithm for the Set Covering Problem</title><title>2011 30th International Conference of the Chilean Computer Science Society</title><addtitle>sccc</addtitle><description>This paper proposes the algorithm based on the metaheuristic Ant Colony Optimization (ACO) called Ant-Line, which uses the line-oriented approach for the set covering problem, that is an innovative and emerging approach in the context, beyond the use of a local search. The algorithm is compared with other ACO-based approaches. The results obtained are promising and have reached good quality of solution and running time.</description><subject>Ant colony optimization</subject><subject>Ant Colony Optimization. Ant-Line. Set covering problem. Combinatorial optimization. Metaheuristic Line-orientation</subject><subject>Context</subject><subject>Equations</subject><subject>Heuristic algorithms</subject><subject>Integrated circuits</subject><subject>Optimization</subject><subject>Search problems</subject><issn>1522-4902</issn><issn>2691-0632</issn><isbn>9781467313643</isbn><isbn>1467313645</isbn><isbn>9780769546896</isbn><isbn>0769546897</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2011</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotj8tqwzAQANUXNE1z660X_YBS7UpaW70Z9QmBFNKegy2vU5XELoop9O_7PM1hYGCEuAA9B9D-ahVCmKMGmBt7IGa-KHVB3lkqPR2KCZIHpcng0a8DS4UBQ9Yciwk4RGW9xlNxtt-_aY0aPUzETdWPapF6vpaV_KFa5sT9yK2swlJW282Q0_i6k92Q5fjKcsWjDMMH59Rv5FMemi3vzsVJV2_3PPvnVLzc3T6HB7VY3j-GaqESFG5ULXrHiIyaCocRsTUaojexbAiYnAeOvkRy0Xe69bWNbelqKurom7qLjZmKy79uYub1e067On-uyZCx39tfznFMxw</recordid><startdate>201111</startdate><enddate>201111</enddate><creator>Mulati, M. H.</creator><creator>Constantino, A. A.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201111</creationdate><title>Ant-Line: A Line-Oriented ACO Algorithm for the Set Covering Problem</title><author>Mulati, M. H. ; Constantino, A. A.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-d295e22e206752c22d301c93c8b61e6591ec98265c9f0d9a4cd85a67ac9bafcb3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2011</creationdate><topic>Ant colony optimization</topic><topic>Ant Colony Optimization. Ant-Line. Set covering problem. Combinatorial optimization. Metaheuristic Line-orientation</topic><topic>Context</topic><topic>Equations</topic><topic>Heuristic algorithms</topic><topic>Integrated circuits</topic><topic>Optimization</topic><topic>Search problems</topic><toplevel>online_resources</toplevel><creatorcontrib>Mulati, M. H.</creatorcontrib><creatorcontrib>Constantino, A. A.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Mulati, M. H.</au><au>Constantino, A. A.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Ant-Line: A Line-Oriented ACO Algorithm for the Set Covering Problem</atitle><btitle>2011 30th International Conference of the Chilean Computer Science Society</btitle><stitle>sccc</stitle><date>2011-11</date><risdate>2011</risdate><spage>265</spage><epage>274</epage><pages>265-274</pages><issn>1522-4902</issn><eissn>2691-0632</eissn><isbn>9781467313643</isbn><isbn>1467313645</isbn><eisbn>9780769546896</eisbn><eisbn>0769546897</eisbn><coden>IEEPAD</coden><abstract>This paper proposes the algorithm based on the metaheuristic Ant Colony Optimization (ACO) called Ant-Line, which uses the line-oriented approach for the set covering problem, that is an innovative and emerging approach in the context, beyond the use of a local search. The algorithm is compared with other ACO-based approaches. The results obtained are promising and have reached good quality of solution and running time.</abstract><pub>IEEE</pub><doi>10.1109/SCCC.2011.34</doi><tpages>10</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 1522-4902
ispartof 2011 30th International Conference of the Chilean Computer Science Society, 2011, p.265-274
issn 1522-4902
2691-0632
language eng
recordid cdi_ieee_primary_6363406
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Ant colony optimization
Ant Colony Optimization. Ant-Line. Set covering problem. Combinatorial optimization. Metaheuristic Line-orientation
Context
Equations
Heuristic algorithms
Integrated circuits
Optimization
Search problems
title Ant-Line: A Line-Oriented ACO Algorithm for the Set Covering Problem
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-30T11%3A07%3A28IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Ant-Line:%20A%20Line-Oriented%20ACO%20Algorithm%20for%20the%20Set%20Covering%20Problem&rft.btitle=2011%2030th%20International%20Conference%20of%20the%20Chilean%20Computer%20Science%20Society&rft.au=Mulati,%20M.%20H.&rft.date=2011-11&rft.spage=265&rft.epage=274&rft.pages=265-274&rft.issn=1522-4902&rft.eissn=2691-0632&rft.isbn=9781467313643&rft.isbn_list=1467313645&rft.coden=IEEPAD&rft_id=info:doi/10.1109/SCCC.2011.34&rft_dat=%3Cieee_6IE%3E6363406%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=9780769546896&rft.eisbn_list=0769546897&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=6363406&rfr_iscdi=true