Many significant engineering and scientific problems involve optimization of some criteria over a combinatorial configuration space. The two methods most often used to solve these problems effectively—simulated annealing (SA) and genetic algorithms (GA)—do not easily lend themselves to massive parallel implementations. Simulated annealing is a naturally serial algorithm, while GA involves a sel...

In this paper we present a generic algorithmic framework, namely, the accelerated stochastic approximation (AC-SA) algorithm, for solving strongly convex stochastic composite optimization (SCO) problems. While the classical stochastic approximation (SA) algorithms are asymptotically optimal for solving differentiable and strongly convex problems, the AC-SA algorithm, when employed with proper s...

− In this paper, we propose a Simulated Annealing PolyClonal Selection Algorithm (SAPCSA) for Traveling Salesman Problems (TSP). By introducing a simulated annealing (SA) strategy to the PolyClonal Selection Algorithm (PCSA), the SAPCSA integrate the characteristics of both SA and PCSA. Numerous instances have been simulated to verify the proposed algorithm.

abstract: in this paper, an exergy analysis approach is proposed for optimal design of distillation column by using simulated annealing algorithm. first, the simulation of a distillation column was performed by using the shortcut results and irreversibility in each tray was obtained. the area beneath the exergy loss profile was used as irreversibility index in the whole column. then, first opti...

The m-machine no-wait flowshop scheduling problem is addressed where setup times are treated as separate from processing times. The objective is to minimize total tardiness. Different dispatching rules have been investigated and three were found to be superior. Two heuristics, a simulated annealing (SA) and a genetic algorithm (GA), have been proposed by using the best performing dispatching ru...

This paper presents a multi-objective Particle Swarm Optimization (PSO) algorithm for worker assignment and mixed-model assembly line balancing problem when task times depend on the worker’s skill level. The objectives of this model are minimization of the number of stations (equivalent to the maximization of the weighted line efficiency), minimization of the weighted smoothness index and minim...

determination of shipment quantity and distribution problem is an important subject in today’s business. this paper describes the inventory/distribution network design. the system addresses a class of distribution network design problem, which is characterized by multiple products family, multiple warehouses and retail-ers. the maximum capacity of vehicles and warehouses are also known. the res...

In this paper we propose a new hybrid algorithm for solving the Unit Commitment Problem (UCP). The algorithm integrates the use of Simulated Annealing (SA) and Tabu Search (TS) for solving the UCP. The algorithm includes a step to find an initial control parameter, at which virtually all trial solutions are accepted. It uses a polynomial-time cooling schedule that is advocated in the SA literat...

Cellular manufacturing system, an application of group technology, has been considered as an effective method to obtain productivity in a factory. For design of manufacturing cells, several mathematical models and various algorithms have been proposed in literature. In the present research, we propose an improved version of discrete particle swarm optimization (PSO) to solve manufacturing cell ...