An Improved Simulated Annealing Algorithm for the Maximum Independent Set Problem

An Improved Simulated Annealing Algorithm for the Maximum Independent Set Problem

The maximum independent set problem is a classic graph optimization problem. It is well known that it is an NP-Complete problem. In this paper, an improved simulated annealing algorithm is presented for the maximum independent set problem. In this algorithm, an acceptance function is defined for eve...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Xu, Xinshun, Ma, Jun, Wang, Hua
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Acceptance Function
Applied sciences
Artificial intelligence
Circle Graph
Computer science
control theory
systems
Exact sciences and technology
Maximum Clique
Random Graph
Simulated Annealing Algorithm
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 831
container_issue
container_start_page 822
container_title
container_volume
creator Xu, Xinshun
Ma, Jun
Wang, Hua
description The maximum independent set problem is a classic graph optimization problem. It is well known that it is an NP-Complete problem. In this paper, an improved simulated annealing algorithm is presented for the maximum independent set problem. In this algorithm, an acceptance function is defined for every vertex. This can help the algorithm find a near optimal solution to a problem. Simulations are performed on benchmark graphs and random graphs. The simulation results show that the proposed algorithm provides a high probability of finding optimal solutions.
doi_str_mv 10.1007/11816157_99
format Conference Proceeding
fullrecord <record><control><sourceid>pascalfrancis_sprin</sourceid><recordid>TN_cdi_pascalfrancis_primary_19686090</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>19686090</sourcerecordid><originalsourceid>FETCH-LOGICAL-p1349-c434cd0e63a9ffe0218f5dc3a9484fa350a93edfa04d7d6c3ad7f193b4b54f623</originalsourceid><addsrcrecordid>eNpNkMtOwzAQRc1Loi1d8QPesGARGGecOF5GVYFKRYAK68iJ7TaQOJETEPw9RgWJzbzO1dXoEnLO4IoBiGvGMpayRBRSHpApJhxQxALxkEzCnUWIXB6RuRTZH2P8mEwAIY6k4HhKpsPwCgCxkPGEPOWOrtredx9G003dvjdqDFPunFFN7bY0b7adr8ddS23n6bgz9F59Bl1LV06b3oTiRroxI330XdmY9oycWNUMZv7bZ-TlZvm8uIvWD7erRb6OehZejCqOvNJgUlTSWgMxy2yiq7DxjFuFCSiJRlsFXAudBqCFZRJLXibcpjHOyMXet1dDpRrrlavqoeh93Sr_VTCZZilICLrLvW4IyG2NL8quexsKBsVPoMW_QPEbGBpjEg</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>An Improved Simulated Annealing Algorithm for the Maximum Independent Set Problem</title><source>Springer Books</source><creator>Xu, Xinshun ; Ma, Jun ; Wang, Hua</creator><contributor>Li, Kang ; Huang, De-Shuang ; Irwin, George William</contributor><creatorcontrib>Xu, Xinshun ; Ma, Jun ; Wang, Hua ; Li, Kang ; Huang, De-Shuang ; Irwin, George William</creatorcontrib><description>The maximum independent set problem is a classic graph optimization problem. It is well known that it is an NP-Complete problem. In this paper, an improved simulated annealing algorithm is presented for the maximum independent set problem. In this algorithm, an acceptance function is defined for every vertex. This can help the algorithm find a near optimal solution to a problem. Simulations are performed on benchmark graphs and random graphs. The simulation results show that the proposed algorithm provides a high probability of finding optimal solutions.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 9783540372714</identifier><identifier>ISBN: 3540372717</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 3540372733</identifier><identifier>EISBN: 9783540372738</identifier><identifier>DOI: 10.1007/11816157_99</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Acceptance Function ; Applied sciences ; Artificial intelligence ; Circle Graph ; Computer science; control theory; systems ; Exact sciences and technology ; Maximum Clique ; Random Graph ; Simulated Annealing Algorithm</subject><ispartof>Intelligent Computing, 2006, p.822-831</ispartof><rights>Springer-Verlag Berlin Heidelberg 2006</rights><rights>2007 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/11816157_99$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/11816157_99$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,779,780,784,789,790,793,4048,4049,27924,38254,41441,42510</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&amp;idt=19686090$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Li, Kang</contributor><contributor>Huang, De-Shuang</contributor><contributor>Irwin, George William</contributor><creatorcontrib>Xu, Xinshun</creatorcontrib><creatorcontrib>Ma, Jun</creatorcontrib><creatorcontrib>Wang, Hua</creatorcontrib><title>An Improved Simulated Annealing Algorithm for the Maximum Independent Set Problem</title><title>Intelligent Computing</title><description>The maximum independent set problem is a classic graph optimization problem. It is well known that it is an NP-Complete problem. In this paper, an improved simulated annealing algorithm is presented for the maximum independent set problem. In this algorithm, an acceptance function is defined for every vertex. This can help the algorithm find a near optimal solution to a problem. Simulations are performed on benchmark graphs and random graphs. The simulation results show that the proposed algorithm provides a high probability of finding optimal solutions.</description><subject>Acceptance Function</subject><subject>Applied sciences</subject><subject>Artificial intelligence</subject><subject>Circle Graph</subject><subject>Computer science; control theory; systems</subject><subject>Exact sciences and technology</subject><subject>Maximum Clique</subject><subject>Random Graph</subject><subject>Simulated Annealing Algorithm</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>9783540372714</isbn><isbn>3540372717</isbn><isbn>3540372733</isbn><isbn>9783540372738</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2006</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNpNkMtOwzAQRc1Loi1d8QPesGARGGecOF5GVYFKRYAK68iJ7TaQOJETEPw9RgWJzbzO1dXoEnLO4IoBiGvGMpayRBRSHpApJhxQxALxkEzCnUWIXB6RuRTZH2P8mEwAIY6k4HhKpsPwCgCxkPGEPOWOrtredx9G003dvjdqDFPunFFN7bY0b7adr8ddS23n6bgz9F59Bl1LV06b3oTiRroxI330XdmY9oycWNUMZv7bZ-TlZvm8uIvWD7erRb6OehZejCqOvNJgUlTSWgMxy2yiq7DxjFuFCSiJRlsFXAudBqCFZRJLXibcpjHOyMXet1dDpRrrlavqoeh93Sr_VTCZZilICLrLvW4IyG2NL8quexsKBsVPoMW_QPEbGBpjEg</recordid><startdate>2006</startdate><enddate>2006</enddate><creator>Xu, Xinshun</creator><creator>Ma, Jun</creator><creator>Wang, Hua</creator><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>2006</creationdate><title>An Improved Simulated Annealing Algorithm for the Maximum Independent Set Problem</title><author>Xu, Xinshun ; Ma, Jun ; Wang, Hua</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p1349-c434cd0e63a9ffe0218f5dc3a9484fa350a93edfa04d7d6c3ad7f193b4b54f623</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2006</creationdate><topic>Acceptance Function</topic><topic>Applied sciences</topic><topic>Artificial intelligence</topic><topic>Circle Graph</topic><topic>Computer science; control theory; systems</topic><topic>Exact sciences and technology</topic><topic>Maximum Clique</topic><topic>Random Graph</topic><topic>Simulated Annealing Algorithm</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Xu, Xinshun</creatorcontrib><creatorcontrib>Ma, Jun</creatorcontrib><creatorcontrib>Wang, Hua</creatorcontrib><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Xu, Xinshun</au><au>Ma, Jun</au><au>Wang, Hua</au><au>Li, Kang</au><au>Huang, De-Shuang</au><au>Irwin, George William</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>An Improved Simulated Annealing Algorithm for the Maximum Independent Set Problem</atitle><btitle>Intelligent Computing</btitle><date>2006</date><risdate>2006</risdate><spage>822</spage><epage>831</epage><pages>822-831</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>9783540372714</isbn><isbn>3540372717</isbn><eisbn>3540372733</eisbn><eisbn>9783540372738</eisbn><abstract>The maximum independent set problem is a classic graph optimization problem. It is well known that it is an NP-Complete problem. In this paper, an improved simulated annealing algorithm is presented for the maximum independent set problem. In this algorithm, an acceptance function is defined for every vertex. This can help the algorithm find a near optimal solution to a problem. Simulations are performed on benchmark graphs and random graphs. The simulation results show that the proposed algorithm provides a high probability of finding optimal solutions.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/11816157_99</doi><tpages>10</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0302-9743
ispartof Intelligent Computing, 2006, p.822-831
issn 0302-9743
1611-3349
language eng
recordid cdi_pascalfrancis_primary_19686090
source Springer Books
subjects Acceptance Function
Applied sciences
Artificial intelligence
Circle Graph
Computer science
control theory
systems
Exact sciences and technology
Maximum Clique
Random Graph
Simulated Annealing Algorithm
title An Improved Simulated Annealing Algorithm for the Maximum Independent Set 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-12T00%3A06%3A45IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_sprin&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=An%20Improved%20Simulated%20Annealing%20Algorithm%20for%20the%20Maximum%20Independent%20Set%20Problem&rft.btitle=Intelligent%20Computing&rft.au=Xu,%20Xinshun&rft.date=2006&rft.spage=822&rft.epage=831&rft.pages=822-831&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=9783540372714&rft.isbn_list=3540372717&rft_id=info:doi/10.1007/11816157_99&rft_dat=%3Cpascalfrancis_sprin%3E19686090%3C/pascalfrancis_sprin%3E%3Curl%3E%3C/url%3E&rft.eisbn=3540372733&rft.eisbn_list=9783540372738&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true