In [6] solutions for the nesting problem are produced using the No Fit Polygon (NFP), simulated annealing (SA) and a new evaluation method. It showed that SA could out perform hill climbing, thus suggesting that evolutionary approaches produce better solutions than a standard search algorithm. In this paper this work is developed. Genetic algorithms (GA) and tabu search (TS) are compared with t...

In this paper, we study the unrelated parallel machine problem for minimizing the makespan, which is NP-hard. We used Simulated Annealing (SA) and Tabu Search (TS) with Neighborhood Search (NS) based on the structure of the problem. We also used a modified SA algorithm, which gives better results than the traditional SA and developed an effective heuristic for the problem: Squeaky Wheel Optimiz...

Sensitivity Analysis (SA) provides techniques which can be used to identify the parameters which have the greatest influence on the results obtained from a model. Classical SA methods apply to deterministic simulations of ODE models. We extend these to stochastic simulations and consider the analysis of models with bifurcation points and bistable behaviour. We consider local, global and screeni...

This report proposes a double simulated annealing (DSA) for functional magnetic resonance image (fMRI) analysis. The first simulated annealing (SA) is used to disconnect the brain from the skull. The second SA is applied to locate the activation area of the fMRIs. The performance evaluation of this approach includes receiver-operating characteristic (ROC) analysis, similarity analysis, and comp...

The phenomenon of an undesirable nonlinear optical effects degrade the system performance. In optical wave–length division multiplexing (WDM) systems employing dispersion shifted fibers, the crosstalk due to four–wave mixing (FWM) is one of the dominating degradation nonlinear optical effects. Generally, FWM crosstalk suppression can be achieved by using unequally spaced channel allocation meth...

In this paper, we considered a planar perspective transformation between images with overlapping region. It is based on the rectangle-to-quadrilateral mapping and normalized correlations. Initially, the global translation is determined by using a block matching. And to find the correspondence points maximizing correlation in overlapping region by the perspective transformation, we used simulate...

In this paper, we propose a new mathematical model for Capacitated Inventory Routing Problem (CIRP), which considers freshly delivery of perishable products to the customers’ location; otherwise, a reduction in products’ demand may occur. Therefore, we attempt to plan delivering process of products at the right time to avoid extra inventory causing increase in age of products. This ...

In this paper, six different approaches using genetic algorithms (GA) and/or simulated annealing (SA) with improved bottom left (I-BL) algorithm [1] were applied for solution of two dimensional non-guillotine cutting problems. As examples, test problems including 29 individual rectangular pieces were used [2]. Performances of hybrid approaches on solutions of cutting problems were compared. Due...

We consider a class of stochastic approximation (SA) algorithms for solving a system of estimating equations. The standard condition for the convergence of the SA algorithms is that the estimating functions are locally Lipschitz continuous. Here, we show that this condition can be relaxed to the extent that the estimating functions are bounded and continuous almost everywhere. As a consequence,...

In this paper, we propose sequential Monte Carlo simulated annealing (SMC-SA), a populationbased simulated annealing algorithm, for continuous global optimization. SMC-SA incorporates the sequential Monte Carlo method to track the converging sequence of Boltzmann distributions in simulated annealing, such that the empirical distribution will converge weakly to the uniform distribution on the se...