Loading…

A quantitative analysis of the simulated annealing algorithm: a case study for the traveling Salesman problem

Saved in:
Bibliographic Details
Published in:Journal of statistical physics 1988, Vol.50 (1-2), p.187-206
Main Authors: AARTS, E. H. L, KORST, J. H. M, VAN LAARHOVEN, P. J. M
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c260t-531977ab6d8c3e0597a1022fdf3c751c930b74f27fa64d6fe8d9a131f746fa2a3
cites cdi_FETCH-LOGICAL-c260t-531977ab6d8c3e0597a1022fdf3c751c930b74f27fa64d6fe8d9a131f746fa2a3
container_end_page 206
container_issue 1-2
container_start_page 187
container_title Journal of statistical physics
container_volume 50
creator AARTS, E. H. L
KORST, J. H. M
VAN LAARHOVEN, P. J. M
description
doi_str_mv 10.1007/BF01022991
format article
fullrecord <record><control><sourceid>pascalfrancis_cross</sourceid><recordid>TN_cdi_crossref_primary_10_1007_BF01022991</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>7046176</sourcerecordid><originalsourceid>FETCH-LOGICAL-c260t-531977ab6d8c3e0597a1022fdf3c751c930b74f27fa64d6fe8d9a131f746fa2a3</originalsourceid><addsrcrecordid>eNpFkEFLAzEUhIMoWKsXf0EOnoTVl81u0nirxapQ8KCel9ds0kayuzXJFvrv3baipwfzvhmYIeSawR0DkPePc2CQ50qxEzJipcwzJRg_JSMY1KyQrDwnFzF-AYCaqHJEmin97rFNLmFyW0OxRb-LLtLO0rQ2NLqm95hMPXxag961K4p-1QWX1s0DRaoxDlTq6x21XTh4UsCtOZDv6E1ssKWb0C29aS7JmUUfzdXvHZPP-dPH7CVbvD2_zqaLTOcCUlZypqTEpagnmhsolcR9K1tbrmXJtOKwlIXNpUVR1MKaSa2QcWZlISzmyMfk9pirQxdjMLbaBNdg2FUMqv1Q1f9QA3xzhDcYNXobsNUu_jkkFIJJwX8AMiFo7Q</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>A quantitative analysis of the simulated annealing algorithm: a case study for the traveling Salesman problem</title><source>SpringerLink Online Journals Archive Complete</source><creator>AARTS, E. H. L ; KORST, J. H. M ; VAN LAARHOVEN, P. J. M</creator><creatorcontrib>AARTS, E. H. L ; KORST, J. H. M ; VAN LAARHOVEN, P. J. M</creatorcontrib><identifier>ISSN: 0022-4715</identifier><identifier>EISSN: 1572-9613</identifier><identifier>DOI: 10.1007/BF01022991</identifier><identifier>CODEN: JSTPBS</identifier><language>eng</language><publisher>Heidelberg: Springer</publisher><subject>Applied sciences ; Exact sciences and technology ; Flows in networks. Combinatorial problems ; Operational research and scientific management ; Operational research. Management science</subject><ispartof>Journal of statistical physics, 1988, Vol.50 (1-2), p.187-206</ispartof><rights>1989 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c260t-531977ab6d8c3e0597a1022fdf3c751c930b74f27fa64d6fe8d9a131f746fa2a3</citedby><cites>FETCH-LOGICAL-c260t-531977ab6d8c3e0597a1022fdf3c751c930b74f27fa64d6fe8d9a131f746fa2a3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,4024,27923,27924,27925</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&amp;idt=7046176$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>AARTS, E. H. L</creatorcontrib><creatorcontrib>KORST, J. H. M</creatorcontrib><creatorcontrib>VAN LAARHOVEN, P. J. M</creatorcontrib><title>A quantitative analysis of the simulated annealing algorithm: a case study for the traveling Salesman problem</title><title>Journal of statistical physics</title><subject>Applied sciences</subject><subject>Exact sciences and technology</subject><subject>Flows in networks. Combinatorial problems</subject><subject>Operational research and scientific management</subject><subject>Operational research. Management science</subject><issn>0022-4715</issn><issn>1572-9613</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1988</creationdate><recordtype>article</recordtype><recordid>eNpFkEFLAzEUhIMoWKsXf0EOnoTVl81u0nirxapQ8KCel9ds0kayuzXJFvrv3baipwfzvhmYIeSawR0DkPePc2CQ50qxEzJipcwzJRg_JSMY1KyQrDwnFzF-AYCaqHJEmin97rFNLmFyW0OxRb-LLtLO0rQ2NLqm95hMPXxag961K4p-1QWX1s0DRaoxDlTq6x21XTh4UsCtOZDv6E1ssKWb0C29aS7JmUUfzdXvHZPP-dPH7CVbvD2_zqaLTOcCUlZypqTEpagnmhsolcR9K1tbrmXJtOKwlIXNpUVR1MKaSa2QcWZlISzmyMfk9pirQxdjMLbaBNdg2FUMqv1Q1f9QA3xzhDcYNXobsNUu_jkkFIJJwX8AMiFo7Q</recordid><startdate>1988</startdate><enddate>1988</enddate><creator>AARTS, E. H. L</creator><creator>KORST, J. H. M</creator><creator>VAN LAARHOVEN, P. J. M</creator><general>Springer</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>1988</creationdate><title>A quantitative analysis of the simulated annealing algorithm: a case study for the traveling Salesman problem</title><author>AARTS, E. H. L ; KORST, J. H. M ; VAN LAARHOVEN, P. J. M</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c260t-531977ab6d8c3e0597a1022fdf3c751c930b74f27fa64d6fe8d9a131f746fa2a3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1988</creationdate><topic>Applied sciences</topic><topic>Exact sciences and technology</topic><topic>Flows in networks. Combinatorial problems</topic><topic>Operational research and scientific management</topic><topic>Operational research. Management science</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>AARTS, E. H. L</creatorcontrib><creatorcontrib>KORST, J. H. M</creatorcontrib><creatorcontrib>VAN LAARHOVEN, P. J. M</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><jtitle>Journal of statistical physics</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>AARTS, E. H. L</au><au>KORST, J. H. M</au><au>VAN LAARHOVEN, P. J. M</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A quantitative analysis of the simulated annealing algorithm: a case study for the traveling Salesman problem</atitle><jtitle>Journal of statistical physics</jtitle><date>1988</date><risdate>1988</risdate><volume>50</volume><issue>1-2</issue><spage>187</spage><epage>206</epage><pages>187-206</pages><issn>0022-4715</issn><eissn>1572-9613</eissn><coden>JSTPBS</coden><cop>Heidelberg</cop><pub>Springer</pub><doi>10.1007/BF01022991</doi><tpages>20</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0022-4715
ispartof Journal of statistical physics, 1988, Vol.50 (1-2), p.187-206
issn 0022-4715
1572-9613
language eng
recordid cdi_crossref_primary_10_1007_BF01022991
source SpringerLink Online Journals Archive Complete
subjects Applied sciences
Exact sciences and technology
Flows in networks. Combinatorial problems
Operational research and scientific management
Operational research. Management science
title A quantitative analysis of the simulated annealing algorithm: a case study for the traveling Salesman problem
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-29T03%3A19%3A13IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20quantitative%20analysis%20of%20the%20simulated%20annealing%20algorithm:%20a%20case%20study%20for%20the%20traveling%20Salesman%20problem&rft.jtitle=Journal%20of%20statistical%20physics&rft.au=AARTS,%20E.%20H.%20L&rft.date=1988&rft.volume=50&rft.issue=1-2&rft.spage=187&rft.epage=206&rft.pages=187-206&rft.issn=0022-4715&rft.eissn=1572-9613&rft.coden=JSTPBS&rft_id=info:doi/10.1007/BF01022991&rft_dat=%3Cpascalfrancis_cross%3E7046176%3C/pascalfrancis_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c260t-531977ab6d8c3e0597a1022fdf3c751c930b74f27fa64d6fe8d9a131f746fa2a3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true