Parallel test generation using circuit partitioning and spectral techniques

Xerox has invented, tested, and implemented a novel class of operations-research-based productivity improvement offerings, marketed as Lean Document Production (LDP), for the $100 billion printing industry in the United States. The software toolkit that enables the optimization of print shops is data-driven and simulation-based. It enables quick modeling of complex print production environments under the cellular production framework. The software toolkit automates several steps of the modeling process by taking declarative inputs from the end user and then automatically generating complex simulation models that are used to determine improved design and operating policies. This chapter describes the addition of another layer of automation consisting of simulation-based optimization using simulated annealing and greedy search techniques that enable the search of a large number of design alternatives in the presence of operational and cost constraints. The greedy search procedure quickly determines an acceptable solution in a web-based online application environment. The simulated annealing technique is more time consuming and is performed offline. The results of the application of this approach to real-world problems are described.

Applying network window schema and a simulated annealing technique to optimal VAR planning in large-scale power systems

The paper begins by reviewing a two-level hierarchical multicriteria routing model for MPLS networks with two service classes (QoS and BE services) and alternative routing, as well as the foundations of a heuristic resolution approach, previously proposed by the authors. Afterwards a new approach, of meta-heuristic nature, based on the introduction of simulated annealing and tabu search techniques, in the structure of the dedicated heuristic, is described. The application of the developed procedures to a benchmarking case study will show that, in certain initial conditions, this approach provides improvements in the final results especially in more “difficult” situations detected through sensitivity analysis.

Safwan-Zubair area is located in the south –west part of Basrah Province in the south of Iraq, this area is involved within the Dibdibba plain which is considered as a part of Iraqi Western Desert. Dibdibba formation consists mainly from sand and gravel with some cementing materials like silt and clay, especially in the west of Zubair area. A linked simulation-optimization model for obtaining the optimum pumping rate of groundwater is presented in this paper. Processing Modflow for Windows (PMWIN v.5) is selected to simulate the aquifer behavior being studied. This model is integrated with an optimization model which is based on the simulated annealing (SA) technique. The calibrated values of hydraulic conductivity vary over the range (15-150) m/day; while, the calibrated values of specific yield vary over the range (0.125-0.45). The objective function converges to a maximum value of (0.636925E+8 m3/year). The percentage ratio of inactive wells is 10.9 %, many wells in the study area that occupy incorrect positions, these wells must be turn off for obtaining optimum pumping rate in the study area.

Metaheuristic approaches to the hybrid flow shop scheduling problem with a cost-related criterion

Abstract3G Cellular networks typically consist of a group of NodeBs connected to a Radio Network Controller (RNC), and a group of RNCs to a Serving GPRS Support Node (SGSNs) as well as to a Mobile Switching Centre (MSCs). Post deployment planning of such network is to re-plan the connectivity among the above mentioned network elements with an objective to minimize the cost of operation of the network. This planning problem is traditionally solved under single homing consideration (i.e., one NodeB is homed with only one RNC). However, a single homing solution becomes ineffective when the subscriber distribution changes over time and groups of subscribers begin to show a specific diurnal pattern of their inter-MSC/SGSN mobility. One of the solutions for this problem is dual-homing where some selected NodeBs are connected to two RNCs to reduce the complex handoffs involving two different RNCs as well as two different MSCs/SGSNs. In this paper, we have mapped the dual-homing problem into a search problem and used Simulated Annealing (SA) and Tabu Search (TS) techniques to optimally select the NodeBs and RNCs to be connected. A comparison of the performances of the two meta-heuristic techniques reveals that, though both are efficient enough to produce good solutions, TS is found to be better than SA throughout.KeywordsNetwork planningCellular network3Gdual-homingNodeBRNCMSCSGSNTabu SearchSimulated Annealing

This paper proposes a method for controlling the voltage total harmonic distortion (THD) with a parallel simulated annealing technique. The nonlinear relationship between voltage harmonics and the voltage THD is identified using the revised group method of data handling (RGMDH) based on the self-organization technique. The voltage THD is controlled by some feature variables to decrease harmonic distortion. A simulated annealing (SA) technique is applied to minimize the voltage distortion factor. SA is a stochastic optimization method based on a physical annealing phenomenon. In order to obtain better solutions, this paper proposes a parallel simulated annealing (PSA) technique. PSA is a useful method because of the multi-point search. The effectiveness of the proposed method is demonstrated with test data. >

In this paper, we address the flowpath design issue of Automated Guided Vehicle Systems (AGVSs). In particular, we concentrate on the design of unidirectional flowpaths (i.e. vehicles are restricted to travel only in one direction along a given segment of the flowpath). We have developed intelligent heuristics — simulated annealing and tabu search algorithms for the design of unidirectional AGVSs. Different versions of simulated annealing and tabu search algorithms are implemented. Our extensive computational results indicate that both simulated annealing and tabu search yield solutions of adequate quality for all practical purposes. A tabu search implementation with the use of a frequency-based memory structure dominates all tested heuristics in terms of solution quality (i.e. percent deviation from optimality), with an impressive average performance over 45 test problems of less than 0.85% deviation from optimality.

A composite heuristic for the single machine early/tardy job scheduling problem

OPTIMAL ALLOCATION OF STATIC VAR COMPENSATORS USING MODAL ANALYSIS, SIMULATED ANNEALING AND TABU SEARCH

Simulated annealing optimization technique was used to simulate geological models. After comparing one-point perturbation scheme with two-point swapping scheme, and the Metropolis algorithm with the greedy algorithm, an optimized combination of simulated annealing schedule is presented. The two-dimensional correlation coefficient matrix is introduced to determine a unit configuration which can represent essential features of a geological model. The proposed simulated annealing technique can be used to reproduce the characteristics of a geological model based on multipoint histogram which can be obtained by using a unit configuration. Various geological vertical cross sections and horizontal slices based on field data are used to validate this new technique. Simulated results confirm that one-point perturbation scheme with the Metropolis algorithm provides the best combination to capture the essential features of a geological model. Further, the two-dimensional correlation coefficient matrix provides a technique to choose a priori unit configuration for multipoint histogram, which captures the geological characteristics adequately.

Researchers have indicated that a permutation schedule can be improved by a non-permutation schedule in a flowshop with completion time-based criteria, such as makespan and total completion time. This study proposes a hybrid approach which draws on the advantages of simulated annealing and tabu search for the non-permutation flowshop scheduling problem, in which the objective function is the makespan of the schedule. To verify the effectiveness of the proposed hybrid approach, computational experiments are performed on a set of well-known non-permutation flowshop scheduling benchmark problems. The result shows that the performance of the hybrid approach is better than that of other approaches, including ant colony optimisation, simulated annealing, and tabu search. Further, the proposed approach found new upper bound values for all benchmark problems within a reasonable computational time.

Knowledge-based expert system for optimal reactive power control in distribution system

A fitting algorithm based on simulated annealing techniques for efficiency calibration of HPGe detectors using different mathematical functions

Data hiding is a technique that can embed the secret data in digital images for transmitting messages confidentially through internet. These carriers before transmitting are called cover images and after transmission are called stepno images. An effective stenography algorithm should have lass embedding distortion and capable of evading visual and statistical detection. So there is scope for finding the strength of data hiding technique by considering as optimization problem. Genetic algorithm can solve optimization problems effectively then simulated annealing technique. This paper mainly describes the framework that can analyze security strength of data hiding technique called adaptive pixel pair matching technique and finds penalization parameter and kernel parameter. This paper follows subtractive pixel adjacency matrix model and Experimental results depicted that Genetic algorithm gives better performance than the simulated annealing Technique.