A simulated annealing approach for the capacitated minimum spanning tree problem

Presents a novel approach to solve an NP-complete problem that is very important from the theoretical and practical point of view, namely the capacitated minimum spanning tree (CMST) problem. This approach has the following features: (a) it is based on the simulated annealing (SA) algorithm; (b) it...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	Torres-Jimenez, J., Pinto-Elias, R., Garcia-Romero, A.
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Automotive engineering Conducting materials Constraint theory Costs Heuristic algorithms NP-complete problem Read only memory Roads Simulated annealing Testing
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

container_end_page	436
container_issue
container_start_page	432
container_title
container_volume
creator	Torres-Jimenez, J. Pinto-Elias, R. Garcia-Romero, A.
description	Presents a novel approach to solve an NP-complete problem that is very important from the theoretical and practical point of view, namely the capacitated minimum spanning tree (CMST) problem. This approach has the following features: (a) it is based on the simulated annealing (SA) algorithm; (b) it represents a tree with N edges using N-2 integers; and (c) it defines a consistent ordering between feasible and infeasible trees. Our SA implementation was tested against the most referenced algorithms for the CMST: the Essau-Williams (1966) algorithm, the Prim (1957) algorithm and the Kruskal (1993) algorithm. The results indicate that our novel approach is very promising for solving CMST problem instances, because it consistently obtains the best results (for the tested cases) but it takes more time.
doi_str_mv	10.1109/ICCIMA.1999.798569
format	Conference Proceeding
fullrecord	<record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_798569</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>798569</ieee_id><sourcerecordid>798569</sourcerecordid><originalsourceid>FETCH-LOGICAL-i89t-bab27d51c38e8bf46ec1431cdebb0cf29802674ac1e1ad1d3cd885331edcd2403</originalsourceid><addsrcrecordid>eNotj8tOwzAURC0hJFDJD3TlH0jxje3YXkYRj0itYNF9dW3fUKMkjZKw4O8JlNnM5pyRhrEtiB2AcI9NXTeHagfOuZ1xVpfuhmXOWGFKp4UUQt2xbJ4_xRqtrVDmnr1XfE79V4cLRY7DQNil4YPjOE4XDGfeXia-nIkHHDGk5Q_r07AqPZ_HVfill4mIr4LvqH9gty12M2X_vWHH56dj_Zrv316autrnybol9-gLEzUEacn6VpUUQEkIkbwXoS2cFUVpFAYgwAhRhmitlhIohlgoITdse51NRHQap9Tj9H26vpY_WJtPbQ</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>A simulated annealing approach for the capacitated minimum spanning tree problem</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Torres-Jimenez, J. ; Pinto-Elias, R. ; Garcia-Romero, A.</creator><creatorcontrib>Torres-Jimenez, J. ; Pinto-Elias, R. ; Garcia-Romero, A.</creatorcontrib><description>Presents a novel approach to solve an NP-complete problem that is very important from the theoretical and practical point of view, namely the capacitated minimum spanning tree (CMST) problem. This approach has the following features: (a) it is based on the simulated annealing (SA) algorithm; (b) it represents a tree with N edges using N-2 integers; and (c) it defines a consistent ordering between feasible and infeasible trees. Our SA implementation was tested against the most referenced algorithms for the CMST: the Essau-Williams (1966) algorithm, the Prim (1957) algorithm and the Kruskal (1993) algorithm. The results indicate that our novel approach is very promising for solving CMST problem instances, because it consistently obtains the best results (for the tested cases) but it takes more time.</description><identifier>ISBN: 9780769503004</identifier><identifier>ISBN: 0769503004</identifier><identifier>DOI: 10.1109/ICCIMA.1999.798569</identifier><language>eng</language><publisher>IEEE</publisher><subject>Automotive engineering ; Conducting materials ; Constraint theory ; Costs ; Heuristic algorithms ; NP-complete problem ; Read only memory ; Roads ; Simulated annealing ; Testing</subject><ispartof>Proceedings Third International Conference on Computational Intelligence and Multimedia Applications. ICCIMA'99 (Cat. No.PR00300), 1999, p.432-436</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/798569$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2051,4035,4036,27904,54898</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/798569$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Torres-Jimenez, J.</creatorcontrib><creatorcontrib>Pinto-Elias, R.</creatorcontrib><creatorcontrib>Garcia-Romero, A.</creatorcontrib><title>A simulated annealing approach for the capacitated minimum spanning tree problem</title><title>Proceedings Third International Conference on Computational Intelligence and Multimedia Applications. ICCIMA'99 (Cat. No.PR00300)</title><addtitle>ICCIMA</addtitle><description>Presents a novel approach to solve an NP-complete problem that is very important from the theoretical and practical point of view, namely the capacitated minimum spanning tree (CMST) problem. This approach has the following features: (a) it is based on the simulated annealing (SA) algorithm; (b) it represents a tree with N edges using N-2 integers; and (c) it defines a consistent ordering between feasible and infeasible trees. Our SA implementation was tested against the most referenced algorithms for the CMST: the Essau-Williams (1966) algorithm, the Prim (1957) algorithm and the Kruskal (1993) algorithm. The results indicate that our novel approach is very promising for solving CMST problem instances, because it consistently obtains the best results (for the tested cases) but it takes more time.</description><subject>Automotive engineering</subject><subject>Conducting materials</subject><subject>Constraint theory</subject><subject>Costs</subject><subject>Heuristic algorithms</subject><subject>NP-complete problem</subject><subject>Read only memory</subject><subject>Roads</subject><subject>Simulated annealing</subject><subject>Testing</subject><isbn>9780769503004</isbn><isbn>0769503004</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>1999</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotj8tOwzAURC0hJFDJD3TlH0jxje3YXkYRj0itYNF9dW3fUKMkjZKw4O8JlNnM5pyRhrEtiB2AcI9NXTeHagfOuZ1xVpfuhmXOWGFKp4UUQt2xbJ4_xRqtrVDmnr1XfE79V4cLRY7DQNil4YPjOE4XDGfeXia-nIkHHDGk5Q_r07AqPZ_HVfill4mIr4LvqH9gty12M2X_vWHH56dj_Zrv316autrnybol9-gLEzUEacn6VpUUQEkIkbwXoS2cFUVpFAYgwAhRhmitlhIohlgoITdse51NRHQap9Tj9H26vpY_WJtPbQ</recordid><startdate>1999</startdate><enddate>1999</enddate><creator>Torres-Jimenez, J.</creator><creator>Pinto-Elias, R.</creator><creator>Garcia-Romero, A.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>1999</creationdate><title>A simulated annealing approach for the capacitated minimum spanning tree problem</title><author>Torres-Jimenez, J. ; Pinto-Elias, R. ; Garcia-Romero, A.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i89t-bab27d51c38e8bf46ec1431cdebb0cf29802674ac1e1ad1d3cd885331edcd2403</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>1999</creationdate><topic>Automotive engineering</topic><topic>Conducting materials</topic><topic>Constraint theory</topic><topic>Costs</topic><topic>Heuristic algorithms</topic><topic>NP-complete problem</topic><topic>Read only memory</topic><topic>Roads</topic><topic>Simulated annealing</topic><topic>Testing</topic><toplevel>online_resources</toplevel><creatorcontrib>Torres-Jimenez, J.</creatorcontrib><creatorcontrib>Pinto-Elias, R.</creatorcontrib><creatorcontrib>Garcia-Romero, 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>Torres-Jimenez, J.</au><au>Pinto-Elias, R.</au><au>Garcia-Romero, A.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>A simulated annealing approach for the capacitated minimum spanning tree problem</atitle><btitle>Proceedings Third International Conference on Computational Intelligence and Multimedia Applications. ICCIMA'99 (Cat. No.PR00300)</btitle><stitle>ICCIMA</stitle><date>1999</date><risdate>1999</risdate><spage>432</spage><epage>436</epage><pages>432-436</pages><isbn>9780769503004</isbn><isbn>0769503004</isbn><abstract>Presents a novel approach to solve an NP-complete problem that is very important from the theoretical and practical point of view, namely the capacitated minimum spanning tree (CMST) problem. This approach has the following features: (a) it is based on the simulated annealing (SA) algorithm; (b) it represents a tree with N edges using N-2 integers; and (c) it defines a consistent ordering between feasible and infeasible trees. Our SA implementation was tested against the most referenced algorithms for the CMST: the Essau-Williams (1966) algorithm, the Prim (1957) algorithm and the Kruskal (1993) algorithm. The results indicate that our novel approach is very promising for solving CMST problem instances, because it consistently obtains the best results (for the tested cases) but it takes more time.</abstract><pub>IEEE</pub><doi>10.1109/ICCIMA.1999.798569</doi><tpages>5</tpages></addata></record>
fulltext	fulltext_linktorsrc
identifier	ISBN: 9780769503004
ispartof	Proceedings Third International Conference on Computational Intelligence and Multimedia Applications. ICCIMA'99 (Cat. No.PR00300), 1999, p.432-436
issn
language	eng
recordid	cdi_ieee_primary_798569
source	IEEE Electronic Library (IEL) Conference Proceedings
subjects	Automotive engineering Conducting materials Constraint theory Costs Heuristic algorithms NP-complete problem Read only memory Roads Simulated annealing Testing
title	A simulated annealing approach for the capacitated minimum spanning tree 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-27T00%3A23%3A04IST&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=A%20simulated%20annealing%20approach%20for%20the%20capacitated%20minimum%20spanning%20tree%20problem&rft.btitle=Proceedings%20Third%20International%20Conference%20on%20Computational%20Intelligence%20and%20Multimedia%20Applications.%20ICCIMA'99%20(Cat.%20No.PR00300)&rft.au=Torres-Jimenez,%20J.&rft.date=1999&rft.spage=432&rft.epage=436&rft.pages=432-436&rft.isbn=9780769503004&rft.isbn_list=0769503004&rft_id=info:doi/10.1109/ICCIMA.1999.798569&rft_dat=%3Cieee_6IE%3E798569%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=798569&rfr_iscdi=true