The capacitated clustering problem (CCP) is the problem in which a given set of weighted objects is to be partitioned into clusters so that the total weight of objects in each cluster is less than a given value (cluster 'capacity'). The objective is to minimize the total scatter of objects from the 'centre' of the cluster to which they have been allocated. A simple constructive heuristic, a R-i...

task graph scheduling is a multi-objective optimization and np-hard problem. in this paper a new algorithm on homogeneous multiprocessors systems is proposed. basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. these two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the other on...

—In this paper, we present a solution method for examination timetabling, consisting of two phases: a constraint programming phase to provide an initial solution and a simulated annealing phase with Kempe chain neighborhood. The second phase is equipped with some refined mechanisms that help to determine crucial cooling schedule parameters. We perform preliminary experiments of the algorithm on...

We discuss a classical reinterpretation of quantum-mechanics-based analysis of classical Markov chains with detailed balance, that is based on the quantum-classical correspondence. The classical reinterpretation is then used to demonstrate that it successfully reproduces a sufficient condition for cooling schedule in classical simulated annealing, which has the inverse-logarithm scaling.

In this paper a parallel algorithm for simulated annealing (S.A.) in the continuous case, the Multiple Trials and Adaptive Supplementary Search, MTASS algorithm, is presented. It is based on a combination of multiple trials, local improved searchs and an adaptive cooling schedule. The results in optimizing some standard test problems are compared with a sequential S.A. algorithms and another pa...

In this paper we propose an optimal anytime version of constrained simulated annealing (CSA) for solving constrained nonlinear programming problems (NLPs). One of the goals of the algorithm is to generate feasible solutions of certain prescribed quality using an average time of the same order of magnitude as that spent by the original CSA with an optimal cooling schedule in generating a solutio...

Microscopy and permeability studies were performed to further illustrate the cooling effects on rennet casein gel structure and help interpret the rheological observations in the first part of this paper. Samples of gels cooled from 80 to 5 degrees C at four rates (0.5, 0.1, 0.05, and 0.025 degrees C/min) were studied with a confocal laser scanning microscope. A larger number of smaller flocs w...

The rheology and microstructure of a rennet casein system were studied in the pH range from 5.8 to 12.0 during cooling from 80 to 5 degrees C at four cooling rates: 0.5, 0.1, 0.05, and 0.025 degrees C/min. A dramatic increase in storage modulus with pH was observed during cooling at a fixed cooling rate. Continuous networks were formed for gels at pH 7.2 and above, while a discontinuous network...

More intense heat waves are expected to occur more frequently in the twenty-first century. During severe waves, cooling capacity shortfall and overheating likely residential buildings, this will adversely affect occupant's thermal comfort productivity. We propose a strategy of pre-cooling house during off-peak hours mitigate waves. Simulation results prototype single-family show that adopting r...

The first polynomial-time algorithm to approximate (with arbitrary precision) the permanent of a non-negative matrix was presented by Jerrum, Sinclair and Vigoda. They designed a simulated annealing algorithm with a running time of O∗(n26) for 0/1 matrices. Subsequently, they improved their analysis, resulting in a O∗(n10) time algorithm. We present a O∗(n7) time algorithm. Our improvement come...