To our knowledge, this paper investigates the first application of meta-heuristic algorithms to tackle the parallel machines scheduling problem with weighted late work criterion and common due date ([Formula: see text]). Late work criterion is one of the performance measures of scheduling problems which considers the length of late parts of particular jobs when evaluating the quality of schedul...

Nowadays, various imitations of natural processes are used to solve challenging optimization problems faster and more accurately. Spin glass based optimization, specifically, has shown strong local search capability and parallel processing. However, generally, spin glasses have a low rate of convergence, since they use Monte Carlo simulation techniques such as simulated annealing (SA). Here, we...

Object oriented design is a method where developers think in terms of objects instead of procedures or functions. The overall system is designed keeping in view the interaction among objects that maintain the states and provide implementation on them. For implementing object oriented design three methodologies are adopted Object Modeling technique (OMT), Structure Analysis/Structured Design (SA...

An algorithm for fault detection and classification method for wide-area protection in Korean transmission systems is proposed. The modeling of 345-kV and 765-kV Korean power system transmission networks using the Electro Magnetic Transient Program Restructured Version (EMTPRV) is presented and the algorithm for fault detection and classification in transmission lines is developed. The proposed...

In practice, suppliers often provide retailers with forward financing to increase demand or decrease inventory. This paper proposes a new and practical joint replenishment and delivery (JRD) model by considering trade credit. However, because of the complex mathematical properties of JRD, high-quality solutions to the problem have eluded researchers. We design an effective hybrid differential e...

Cenetic Algorithms (CA) and Slmulated Annealing (SA) have emerged as the leadlng methodologies for search and optimization problems in high dlmensional spaces. Previous attempts at hybrkllzing these two algorithms have been cumbersome and requlred major changes to both. In this paper we propose a simple scheme of using Simulated-Annealing Mutation (SAM) and Recombination (SAR) as operators In a...

Facility layout is one of the most important Operations Management problems due to its direct impact on the financial performance of both private and public firms. Facility layout problem (FLP) with stochastic parameters, unequal area facilities, and grid system modeling is named GSUA-STFLP. This problem has not been worked in the literature so that to solve GSUA-STFLP is our main contribution....

Thecontinuous Constrained Optimization Problem (COP) often occurs in industrial applications. In this study, we compare three novel algorithms developed for solving the COP.The first approach consists of an Interval Partitioning Algorithm (IPA) that is exhaustive in covering the whole feasible space. IPA has the capability of discarding sub-spaces that are sub-optimal and/or infeasible, similar...

In this paper, we design genetic algorithm and simulated annealing algorithm and their parallel versions to solve the Closest String problem. Our implementation and experiments show usefulness of the parallel GA and SA algorithms.

This article explains how to apply the deterministic annealing (DA) and simulated annealing (SA) methods to fuzzy entropy based fuzzy c-means clustering. By regularizing the fuzzy c-means method with fuzzy entropy, a membership function similar to the Fermi-Dirac distribution function, well known in statistical mechanics, is obtained, and, while optimizing its parameters by SA, the minimum of t...