We examine three Monte Carlo sampling methods on idealized examples. Implementing the Metropolis algorithm on created functions, we compare the single temperature to four temperatures running in parallel. Using simulated annealing and parallel tempering on the traveling salesman problem, we examine what each of the methods is capable of exploring. We focus specifically on parallel tempering’s a...

The Network Design Problem (NDP) is one of the important problems in combinatorial optimization. Among the network design problems, the Multicommodity Capacitated Network Design (MCND) problem has numerous applications in transportation, logistics, telecommunication, and production systems. The MCND problems with splittable flow variables are NP-hard, which means they require exponential time t...

This paper continues our investigation into the feasibility of exploiting the structure of a parallel program to guide its hardware implementation. We review previous work, and present our new approach to the problem based upon placing netlists hierarchically. It is found that appropriate constraints can be derived from the source code in a straight-forward way, and this information can be used...

In this paper we discuss the mapping of the physical problem of 2D crystallization with spherical boundary conditions onto a Simulated Annealing model, and the mapping of this model onto a parallel computer. We discuss some aspects of the finetuning of the simulation code and the overall behaviour, stability and scalability, of our parallel implementation.

The cycle basis of a graph arises in a wide range of engineering problems and has a variety of applications. Minimal and optimal cycle bases reduce the time and memory required for most of such applications. One of the important applications of cycle basis in civil engineering is its use in the force method to frame analysis to generate sparse flexibility matrices, which is needed for optimal a...

Multistage interconnection networks (MINs) are popular in switching and communication applications and have been used in tele-communication and parallel computing systems for many years. Crosstalk a major problem introduced by an optical MIN, is caused by coupling two signals within a switching element. We focus on an efficient solution to avoiding crosstalk by routing traffic through an NϫN op...

This paper presents a genetic algorithm (GA) search method in order to obtain better circuit implementation of the mixed polarity Reed-Muller functions. By combining global searching ability of genetic algorithm and local searching ability of simulated annealing, the proposed GA method could achieve fast convergence. It differs to traditional genetic algorithm, in which the proposed GA forms an...

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...

We applied simulated annealing algorithm to nurse scheduling problem. For time complexity problem of simulated annealing, we suggested an efficient transition rule using cost matrix for simulated annealing. The experimental results showed that the suggested method generated a nurse scheduling faster in time and better in quality compared to traditional simulated annealing.