Matches in SemOpenAlex for { <https://semopenalex.org/work/W64811297> ?p ?o ?g. }
Showing items 1 to 86 of
86
with 100 items per page.
- W64811297 abstract "The popularity of simulated annealing comes from its ability to find close to optimal solutions for NP-hard combinatorial optimization problems. Unfortunately, the method has a major drawback: its massive requirement of computation time. In this dissertation, we present an efficient annealing schedule which speeds up simulated annealing by a factor of up to twenty-four when compared with general schedules currently available in the literature.The efficient annealing schedule, which lowers the temperature at every step and keeps the system in quasi-equilibrium at all times, is derived from a new quasi-equilibrium criterion. For a given move generation strategy and a given number of steps, this schedule is shown to give the minimum final average cost among all schedules that maintain the system in quasi-equilibrium. Furthermore, with the introduction of two models, we derive an alternate form of this schedule that relates move generation to temperature decrement. At every step, the move generation is controlled to minimize the response time of the system to a change of temperature, leading to the largest decrement in average cost while satisfying the quasi-equilibrium criterion.Most of the practical applications of simulated annealing have been in complicated problem domains, where algorithms either did not exist or performed poorly. To assess the performance of simulated annealing as a general method for solving combinatorial optimization problems, we also compare the method with efficient heuristics on well-studied problems: the traveling salesman problem and the graph partition problem. For high quality solutions and for problems with a small number of close to optimal solutions, our test results indicate that simulated annealing out-performs the heuristics by Lin and Kernighan and by Karp for the traveling salesman problem, and multiple executions of the heuristic by Fiduccia and Mattheyses for the graph partition problem." @default.
- W64811297 created "2016-06-24" @default.
- W64811297 creator A5089113825 @default.
- W64811297 date "1988-01-01" @default.
- W64811297 modified "2023-09-26" @default.
- W64811297 title "An efficient simulated annealing schedule" @default.
- W64811297 cites W129209152 @default.
- W64811297 cites W1548776768 @default.
- W64811297 cites W1652464192 @default.
- W64811297 cites W1980746862 @default.
- W64811297 cites W2008283823 @default.
- W64811297 cites W2011039300 @default.
- W64811297 cites W2014068360 @default.
- W64811297 cites W2014208555 @default.
- W64811297 cites W2020999234 @default.
- W64811297 cites W2024060531 @default.
- W64811297 cites W2039698161 @default.
- W64811297 cites W2042986967 @default.
- W64811297 cites W2050555294 @default.
- W64811297 cites W2056760934 @default.
- W64811297 cites W2095117703 @default.
- W64811297 cites W2115380905 @default.
- W64811297 cites W2120985183 @default.
- W64811297 cites W2128193809 @default.
- W64811297 cites W2143037347 @default.
- W64811297 cites W2154061444 @default.
- W64811297 cites W2161455936 @default.
- W64811297 cites W2162122092 @default.
- W64811297 cites W2171776966 @default.
- W64811297 cites W2326740504 @default.
- W64811297 cites W2796610752 @default.
- W64811297 hasPublicationYear "1988" @default.
- W64811297 type Work @default.
- W64811297 sameAs 64811297 @default.
- W64811297 citedByCount "14" @default.
- W64811297 countsByYear W648112972014 @default.
- W64811297 countsByYear W648112972018 @default.
- W64811297 crossrefType "journal-article" @default.
- W64811297 hasAuthorship W64811297A5089113825 @default.
- W64811297 hasConcept C111919701 @default.
- W64811297 hasConcept C11413529 @default.
- W64811297 hasConcept C126255220 @default.
- W64811297 hasConcept C126980161 @default.
- W64811297 hasConcept C127705205 @default.
- W64811297 hasConcept C175859090 @default.
- W64811297 hasConcept C33923547 @default.
- W64811297 hasConcept C41008148 @default.
- W64811297 hasConcept C45374587 @default.
- W64811297 hasConcept C68387754 @default.
- W64811297 hasConceptScore W64811297C111919701 @default.
- W64811297 hasConceptScore W64811297C11413529 @default.
- W64811297 hasConceptScore W64811297C126255220 @default.
- W64811297 hasConceptScore W64811297C126980161 @default.
- W64811297 hasConceptScore W64811297C127705205 @default.
- W64811297 hasConceptScore W64811297C175859090 @default.
- W64811297 hasConceptScore W64811297C33923547 @default.
- W64811297 hasConceptScore W64811297C41008148 @default.
- W64811297 hasConceptScore W64811297C45374587 @default.
- W64811297 hasConceptScore W64811297C68387754 @default.
- W64811297 hasLocation W648112971 @default.
- W64811297 hasOpenAccess W64811297 @default.
- W64811297 hasPrimaryLocation W648112971 @default.
- W64811297 hasRelatedWork W1482722110 @default.
- W64811297 hasRelatedWork W1575155528 @default.
- W64811297 hasRelatedWork W1587740701 @default.
- W64811297 hasRelatedWork W1597286183 @default.
- W64811297 hasRelatedWork W167854338 @default.
- W64811297 hasRelatedWork W1964440694 @default.
- W64811297 hasRelatedWork W2014068360 @default.
- W64811297 hasRelatedWork W2024060531 @default.
- W64811297 hasRelatedWork W2042986967 @default.
- W64811297 hasRelatedWork W2047422346 @default.
- W64811297 hasRelatedWork W2055078783 @default.
- W64811297 hasRelatedWork W2056760934 @default.
- W64811297 hasRelatedWork W2060193382 @default.
- W64811297 hasRelatedWork W2072339136 @default.
- W64811297 hasRelatedWork W2114552889 @default.
- W64811297 hasRelatedWork W2134092250 @default.
- W64811297 hasRelatedWork W2179564858 @default.
- W64811297 hasRelatedWork W2411789204 @default.
- W64811297 hasRelatedWork W3139666781 @default.
- W64811297 hasRelatedWork W1573193150 @default.
- W64811297 isParatext "false" @default.
- W64811297 isRetracted "false" @default.
- W64811297 magId "64811297" @default.
- W64811297 workType "article" @default.