This paper reconsiders the travelling tournament problem, a complex sport-scheduling application which has attracted significant interest recently. It proposes a population-based simulated annealing algorithm with both intensification and diversification. The algorithm is organized as a series of simulated annealing waves, each wave being followed by a macro-intensification. The diversification...

In this paper, we present a problem independent general purpose parallel implementation of simulated annealing on distributed message-passing multiproces-sor systems. The sequential algorithm is studied and we give a classiication of combinatorial optimization problems together with their neighborhood structures. Several parallelization approaches are examined considering their suitability for ...

Optimization problems for biomechanical systems have become extremely complex. Simulated annealing (SA) algorithms have performed well in a variety of test problems and biomechanical applications; however, despite advances in computer speed, convergence to optimal solutions for systems of even moderate complexity has remained prohibitive. The objective of this study was to develop a portable pa...

in this paper, we study different methods of solving joint redundancy-availability optimization for series-parallel systems with multi-state components. we analyzed various effective factors on system availability in order to determine the optimum number and version of components in each sub-system and consider the effects of improving failure rates of each component in each sub-system and impr...

This paper presents a fine-grained parallel genetic algorithm with mutation rate as a control parameter. The function of the mutation rate is similar to the function of temperature parameter in the simulated annealing [Lundy’86, Otten’89, and Romeo’85]. The parallel genetic algorithm presented here is based on a Markov chain [Kemeny’60] model. It has been proved that fine-grained parallel genet...

Reducing synchronization constraints in parallel simulated annealing algorithms can improve performance. However, this introduces error in the global cost function. Previous work in parallel simulated annealing suggests that if the amount of error in the cost function is controlled, good quality results can still be obtained. In this paper, we present a model of error in asynchronous parallel s...

In the design of multicomputer systems, the scheduling and mapping of a parallel algorithm onto a host architecture has a critical impact on overall system performance. In this paper we develop a graph-based solution to both aspects of the mapping problem using the simulated annealing optimization heuristic. A two phase mapping strategy is formulated: I) process annealing assigns parallel proce...

A delivery problem which reduces to the NP-complete set-partitioning problem is investigated. The sequential and parallel simulated annealing algorithms to solve the delivery problem are discussed. The objective is to improve the quality of solutions to the problem by applying parallelism.

There is an increasing demand for tools which support the land use planning process and one of the most complex tasks of this process is the design of a land use zoning map. With this aim an algorithm based on simulated annealing has been designed to optimize the delimitation of land use categories according to suitability and compactness criteria. The high number of plots involved in a land us...