A delivery problem which reduces to an NP-complete set-partitioning problem is considered. Two algorithms of parallel simulated annealing, i.e. the simultaneous independent searches and the simultaneous periodically interacting searches are investigated. The objective is to improve the accuracy of solutions to the problem by applying parallelism. The accuracy of a solution is meant as its proxi...

In this paper we propose a new parallelization scheme for Simulated Annealing — Hierarchical Parallel SA (HPSA). This new scheme features coarse-granularity in parallelization, directed at message-passing systems such as clusters. It combines heuristics such as adaptive clustering with SA to achieve more efficiency in local search. Through experiments with various optimization problems and comp...

introduction several methods have been developed to aid in selecting a network of biodiversity protected areas. one of these methods is artificial intelligence which includes a number of different computer algorithms that use an objective function to find the best solution. an algorithm is a mathematical process or a set of rules used for problem solving. recently, site selection algorithms hav...

In short-term production planning, jobs are assigned to machines and scheduled, taking into consideration that operations must be performed in pre-defined sequences. Since the problem is NP-hard, heuristics have to be used. Simulated annealing, neural networks and genetic algorithms are some of the recent approaches. We have tried to improve those methods by taking a hybrid of simulated anneali...

In this paper, we consider the problem of scheduling a set of jobs on two parallel machines to minimize the sum of completion times. Each job requires a setup which must be done by a single server. It is known that this problem is strongly NP-hard. We propose an improved harmony search algorithm. The performance of this algorithm is evaluated and compared with a pure simulated annealing algorit...

Appropriate scheduling and sequencing of tasks on machines is one of the basic and significant problems that a shop or a factory manager encounters with it, this is why in recent decades extensive researches have been done on scheduling issues. A type of scheduling problems is just-in-time (JIT) scheduling and in this area, motivated by JIT manufacturing, this study investigates a mathematical ...

A novel algorithm for particle tracking is presented and evaluated. It is based on deformable templates that converge using a deterministic annealing algorithm. These deformable templates are initialized by Hough transforms. The algorithm, which eeectively represents a merger between neuronic decision making and parameter tting, naturally lends itself to parallel execution. Very good performanc...

This paper presents a new simulated annealing algorithm to solve constrained multi-global optimization problems. To compute all global solutions in a sequential manner, we combine the function stretching technique with the adaptive simulated annealing variant. Constraint-handling is carried out through a nondifferentiable penalty function. To benchmark our penalty stretched simulated annealing ...

In this paper, the author proposes the application of a genetic algorithm and simulated annealing to solve the network planning problem. Compared with other optimisation methods, genetic algorithm and simulated annealing are suitable for traversing large search spaces since they can do this relatively rapidly and because the use of mutation diverts the method away from local minima, which will ...