GA genetic algorithm HGA hybrid genetic algorithm SA simulated annealing algorithm ACO ant colony optimization TS tabu search IA immune algorithm GDA great deluge algorithm CEA cellular evolutionary approach NN neural network NFT near feasible threshold UGF universal generating function MSS multi-state system RB/i/j recovery block architecture that can tolerate i hardware and j software faults ...

This paper presents a new simulated annealing algorithm to solve constrained multi-global optimization problems. To compute all global solutions in a sequential manner, we combine the function stretching technique with the adaptive simulated annealing variant. Constraint-handling is carried out through a nondifferentiable penalty function. To benchmark our penalty stretched simulated annealing ...

in this paper, a stochastic multi-depot multi-objective vehicle routing problem (vrp) is studied. based on observations in real-world problems, we develop an aspect of the problem, such as stochastic availability of routes. to solve the problem in this situation, a two-objective mathematical model is developed, in which the related objective functions are: (1) minimizing transportation costs an...

This paper presents a new hybrid evolutionary algorithm to solve multi-objective multicast routing problems in telecommunication networks. The algorithm combines simulated annealing strategies and genetic local search, aiming at a more flexible and effective exploration and exploitation in the search space of the complex problem to find more non-dominated solutions in the Pareto Front. Due to t...

a pair of degenerate primers, gmpf1 and gmpr1, was designed on the basis of alignment of previously reported grapevine fanleaf virus (gflv) movement protein (mp) nucleotide sequences from iran and other parts of the world. cdna was synthesized by the use of oligo d(t)18 from total rna extraction from each diseased grapevine leaf sample and subjected to polymerase chain reaction (pcr) with the d...

Multi-constrained quality-of-service routing (QoSR) is to find a feasible path that satisfies multiple constraints simultaneously, as an NPC problem, which is also a big challenge for the upcoming next-generation networks. In this paper, we propose SA_MCP, a novel heuristic algorithm, by applying simulated annealing to Dijkstra's algorithm. This algorithm first uses a nonlinear energy function ...

mutual information (mi) is a widely used similarity metric for multimodality image registration. however, it involves an extremely high computational time especially when it is applied to volume images. moreover, its robustness is affected by existence of local maxima. the multi-resolution pyramid approaches have been proposed to speed up the registration process and increase the accuracy of th...

In this paper, an improved genetic algorithm for multi-object optimization is proposed. Simulated annealing is used to local search in genetic algorithms. Furthermore, fuzzy reasoning is adopted to modify crossover probability and mutation probability according to characteristics of population in genetic algorithms instead of fixed parameters. And so, it can be convergence to global optimum qui...

this paper deals with a multi-period fixed charge production-distribution problem associated with backorder and inventories. the objective is to determine the size of the shipments from each supplier and backorder and inventories at each period, so that the total cost incurred during the entire period towards production, transportation, backorder and inventories is minimised. a 0-1 mixed intege...