Pii: S0305-0548(98)00062-8
نویسندگان
چکیده
We propose a method for determining the starting temperature in two-stage simulated annealing systems utilizing traditional homogeneous temperature schedules. While most previous work in this area has focused on ad hoc experimentally derived constant starting temperatures for the low-temperature annealing phase, this investigation presents a method for generalized starting temperature determination for the aforementioned class of two-stage simulated annealing systems. We have tested our method on three NP-hard optimization problems using both classic and adaptive homogeneous cooling schedules. The experimental results have been consistently very good — on average the running time is halved when using an adaptive cooling schedule and reduced by a third in the case of the classic schedule — with no average loss in solution quality. ( 1999 Elsevier Science Ltd. All rights reserved.
منابع مشابه
Pii: S0305-0548(98)00075-6
In a VOD system, multicast is a preferred method for saving network bandwidth. That is, customers requesting the same video program over a small time interval can be arranged in a multicast tree (group), and 0305-0548/99/$ — see front matter ( 1999 Elsevier Science Ltd. All rights reserved. PII: S0305-0548(98)00075-6 then the video server sends a video stream via this tree to customers. In this...
متن کاملA branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem
متن کامل
A tabu search heuristic for the heterogeneous fleet vehicle routing problem
The Heterogeneous Fleet Vehicle Routing Problem (HVRP) is a variant of the classical Vehicle Routing Problem in which customers are served by a heterogeneous #eet of vehicles with various capacities, "xed costs, and variable costs. This article describes a tabu search heuristic for the HVRP. On a set of benchmark instances, it consistently produces high-quality solutions, including several new ...
متن کاملA competitive local search heuristic for the subset sum problem
Subset sum problems are a special class of diicult singly constrained zero-one integer programming problems. Several heuristics for solving these problems have been reported in the literature. In this paper we propose a new heuristic based on local search which improves upon the previous best.
متن کامل