1. Abstract In this work we consider the problem of finding all the global maximizers of a given nonlinear optimization problem. We propose a new algorithm that combines the simulated annealing (SA) method with a function stretching technique, to generate a sequence of global maximization problems that are defined whenever a new maximizer is identified. To find the global maximizers, we apply t...

This paper presents a novel hybrid evolutionary algorithm that combines Particle Swarm Optimization (PSO) and Simulated Annealing (SA) algorithms. When a local optimal solution is reached with PSO, all particles gather around it, and escaping from this local optima becomes difficult . To avoid premature convergence of PSO, we present a new hybrid evolutionary algorithm, called PSOSA, based on t...

In previous work solutions for the nesting problem are produced using the no fit polygon (NFP), a new evaluation method and three evolutionary algorithms (simulated annealing (SA), tabu search (TS) and genetic algorithms (GA)). Tabu search has been shown to produce the best quality solutions for two problems. In this paper this work is developed. A relatively new type of search algorithm (ant a...

Word Sense Disambiguation (WSD) is a difficult problem for NLP. Algorithm that aim to solve the problem focus on the quality of the disambiguation alone and require considerable computational time. In this article we focus on the study of three unsupervised stochastic algorithms for WSD: a Genetic Algorithm (GA) and a Simulated Annealing algorithm (SA) from the state of the art and our own Ant ...

Earth dam is a structure as homogeneous or non-homogeneous forms for raising water level or water supply. Earth dam consist of different parts that one of the main parts is clay core. Choosing an optimal non permeable core which causes reduction of seepage through dam body and also being stable is necessary. The objective of this research is to optimize the geometry of earth dam clay core such ...

Simulated Annealing (SA) is a powerful stochastic search algorithm applicable to a wide range of problems. This paper presents some experiments of applying SA to an NP-hard problem, i.e., call routing in circuit-switched telecommunications networks. The call routing problem considered here can be described as assigning calls to paths in a network so that the number of calls blocked can be minim...

Resource binding, a key step encountered in behavioral synthesis, has been studied intensively in the past. Among the published results, resource binding to reduce switching activity (SA) of the design for minimizing dynamic power has been one of the actively-pursued topics. Two types of SAs can be minimized: the intra−transition SA (occurring during the propagation of a single input vector) an...

We created an algorithm that allows high-throughput mapping of sense-antisense (SA) pairs of transcripts. By this method we mapped approximately 32 000 SA pairs of human mRNAs. Collected SA pairs were divided into three groups: SA pairs based on two or more UniGene clusters (17% of all sense-antisense pairs), SA pairs based on ESTs that belong to the same UniGene cluster (42%), and SA pairs for...

This paper presented a new two-stage green supply chain network, in which includes two innovations. Firstly, it presents a new multi-objective model for a two-stage green supply chain problem that considers the amount o...