This paper proposes a new algorithm using Simulated Annealing (SA) for stochastic scheduling. Stochastic effects are added with nondeterministic activity durations. Simple simulated annealing can not properly handle such a complex problem so an improved version is produced and utilized within the algorithm. Generally, the availability of resources is not enough to complete all the current activ...

In this work, we study scheduling sports competitions at multiple venues, a problem recently introduced by Urban and Russell [T.L. Urban, R.A. Russell, Scheduling sports competitions on multiple venues, European Journal of Operational Research 148 (2003) 302–311]. The distinguishing feature of the problem is that venues come into play when scheduling. We develop beam search and simulated anneal...

Experts of chance discovery have faced a new problem, where the previous methods fail to visualize a latent structure behind observation. Invisible events play an important role in the dynamics of visible events. They are called “dark events”. This paper proposes a new method named “human-interactive annealing” for revealing a latent structure and understanding dark events and illustrates pract...

It is a long time that the Simulated Annealing (SA) procedure is introduced as a model-free optimization for solving NP-hard problems. Improvements from the standard SA in the recent decade mostly concentrate on combining its original algorithm with some heuristic methods. These modifications are rarely happened to the initial condition selection methods from which the annealing schedules start...

It is a long time that the Simulated Annealing (SA) procedure is introduced as a model-free optimization for solving NP-hard problems. Improvements from the standard SA in the recent decade mostly concentrate on combining its original algorithm with some heuristic methods. These modifications are rarely happened to the initial condition selection methods from which the annealing schedules start...

This paper explores the use of the stochastic optimization technique of simulated annealing for map generalization. An algorithm is presented that performs operations of displacement, size exaggeration, deletion and size reduction of multiple map objects in order to resolve graphic conflict resulting from map scale reduction. It adopts a trial position approach in which each of n discrete polyg...

We propose a solution to the minimization problem of multiple-valued programmable logic arrays (PLA) that uses simulated annealing. The algorithm accepts a sum-ofproducts expression, divides and recombines the product terms. gradually progressing toward a minimal solution. The input expression can be user-specijied or one produced by another heuristic. Unlike recently studied minimization techn...

7 This paper shows an innovative implementation of simulated annealing in the 8 context of parallel computing. Details regarding the use of parallel computing 9 through a cluster of processors, as well as the implementation decisions, 10 are provided. Simulated annealing is presented aiming at the generation 11 of stochastic realizations of categorical variables reproducing multiple-point 12 st...

Multiple DNA sequence alignment is an important research topic of bioinformatics. In this paper, we present a new method for multiple DNA sequence alignment, based on genetic simulated annealing techniques, to choose the best cutting point set of the multiple DNA sequence set. The experimental results show that the proposed method gets higher scores and more match columns than the method presen...

the robust coloring problem (rcp) is a generalization of the well-known graph coloring problem where we seek for a solution that remains valid when extra edges are added. the rcp is used in scheduling of events with possible last-minute changes and study frequency assignments of the electromagnetic spectrum. this problem has been proved as np-hard and in instances larger than 30 vertices, meta-...