This paper presents a comprehensive review of simulated annealing (SA)-based optimization algorithms. SA-based algorithms solve single and multiobjective optimization problems, where a desired global minimum/maximum is hidden among many local minima/maxima. Three single objective optimization algorithms (SA, SA with tabu search and CSA) and five multiobjective optimization algorithms (SMOSA, UM...

In this paper, a hybrid evolutionary algorithm (HEA) is proposed to determine the optimal placement of multi-type flexible AC transmission system (FACTS) devices to simultaneously maximize the total transfer capability (TTC) and minimize the system real power loss of power transfers in deregulated power systems. Multi-objective optimal power flow (OPF) with FACTS devices including TTC, power lo...

In this paper we consider the problem of "nding the e$cient frontier associated with the standard mean}variance portfolio optimisation model. We extend the standard model to include cardinality constraints that limit a portfolio to have a speci"ed number of assets, and to impose limits on the proportion of the portfolio held in a given asset (if any of the asset is held). We illustrate the di!e...

As general-purpose parallel computers are increasingly being used to speed up different VLSI applications, the development of parallel algorithms for circuit testing, logic minimization and simulation, HDL-based synthesis, etc. is currently a field of increasing research activity. This paper describes a circuit partitioning algorithm which mixes Simulated Annealing (SA) and Tabu Search (TS) heu...

This paper presents two heuristics for automatic hardware/software partitioning of system level specifications. Partitioning is performed at the granularity of loops, subprograms, and processes with the objective of performance optimization with a limited hardware and software cost. We define the metric values for partitioning and develop a cost function that guides partitioning towards the des...

This paper presents two heuristics for automatic hardware/software partitioning of system level specifications. Partitioning is performed at the granularity of blocks, loops, subprograms, and processes with the objective of performance optimization with a limited hardware and software cost. We define the metric values for partitioning and develop a cost function that guides partitioning towards...

Part selection and machine loading are two major problems in the production planning phase of the flexible manufacturing systems. The problems have a combinatorial structure and usually, in practice, it is difficult to deal with this kind of problems using a mathematical programming model. In this paper, the above problems are formulated as a mixed-integer programming model which is handled seq...

The topology design of campus networks (CNs) is a hard constrained combinatorial optimization problem. Therefore, we resort to heuristics to come up with desirable solutions. A desirable solution must optimize several connicting objectives such as minimization of cost, minimization of network delay, and minimization of maximum number of hops etc. Furthermore, some of the objectives are imprecis...

This paper deals with the task-scheduling and worker-allocation problem, in which each skillful worker is capable to perform multiple tasks and has various regular and worker capacity to perform tasks, and the task allocation is operated with daily overhead. We propose a worker assignment model and develop a heuristic algorithm that is genetic algorithm whose performance is to be evaluated agai...