Search

This paper is concerned with the single-row facility layout problem (SRFLP). A globally optimal solution to the SRFLP is a linear placement of rectangular facilities with varying lengths that achieves […]

An affine supply function equilibrium (SFE) approach is used to discuss voltage constraints and reactive power issues in the modeling of strategic behavior. Generation companies (GenCos) can choose their bid parameters with no restrictions for both energy and spinning reserves. The strategic behavior of generators is formulated as a multi-leader single-follower game. Each GenCo is modeled as a leader, while the central market operator running a cost minimization process is the sole follower. An ac model is considered to represent the transmission system. A three-node system is used to illustrate several cases, and study the implications of the incentives of the strategic players to exploit active and reactive power, and spinning reserves in order to maximize profits. Results for a 14-node system are also presented. Index Terms--Ac system, complementarity, market power, mathematical problem with complementarity constraints, Nash equilibrium, oligopoly, spinning reserves, supply function equilibrium.

In this paper, oligopolistic competition in a centralized power market is characterized by a multi-leader single-follower game, and formulated as a nonlinear programming (NLP) problem. An ac network is used to represent the transmission system and is modeled using rectangular coordinates. The follower is composed of a set of competitive suppliers, demands, and the system operator, while the leaders are the dominant suppliers. The ac approach allows one to capture the strategic behavior of suppliers regarding not only active but also reactive power. In addition, the impact of voltage and apparent power flow constraints can be analyzed. Different case studies are presented using a three-node system to highlight the features of the formulation. Results on a 14-node system are also presented. Index Terms--Competition, complementarity, Cournot, mathematical problem with equilibrium constraints (MPEC), Nash equilibrium, oligopoly.

We present a new framework for efficiently finding competitive solutions for the facility-layout problem. This framework is based on the combination of two new mathematical-programming models. The first model is […]

Distributed measurement architecture, due to its efficiency, is used to monitor the power quality in the electric systems. This paper introduces a novel algorithm to determine the optimum allocations of power quality monitors to reduce the cost of the distributed monitoring system taking into account the data redundancy. The optimization problem is formulated as a covering and packing one which can be manipulated by integer linear programm algorithms. The appropriate constraints are deduced by the electrical circuit topology independent of the load parameters. In addition, the problem is adopted to a general form which can be implemented by any optimization package. The proposed algorithm is applied to five different systems for validation. Then, the results are discussed in terms of the cost and data redundancy. Index Terms--Covering and packing, deregulation, linear integer programming, power quality, power quality info nodes (PQIN), power quality monitoring, TOMLAB.

Modern integrated circuit design involves the layout of circuits consisting of millions of switching elements or transistors. Due to the sheer complexity of the problem, optimizing the connectivity between transistors […]

Many fields, ranging from bioinformatics to databases to large-scale integrated circuits, deal with the interrelation between elementary objects. Objects are represented as vertices and the relationships between them are represented […]

This paper deals with the use of Successive Linear Programming (SLP) for the solution of the Security-Constrained Economic Dispatch (SCED) problem. We tutorially describe an Interior Point Method (IPM) for the solution of Linear Programming (LP) problems, discussing important implementation issues that really make this method far superior to the simplex method. A study of the convergence of the SLP technique and a practical criterion to avoid oscillatory behavior in the iteration process are also proposed. A comparison of the proposed method with an efficient simplex code (MINOS) is carried out by solving SCED problems on two standard IEEE systems. The results show that the interior point technique is reliable, accurate and more than two times faster than the simplex algorithm.

A new approach that uses interior point methods is presented for teaching optimization theory to electrical and computer engineers. The features allow students to look at design projects such as VLSI circuit layout and simplify to solving linear systems of equations. The simplification to solve systems of symmetric positive-definite equations allows this material to be taught as part of a numerical methods course for electrical engineers. A simple junior level project is described for teaching interior point optimization and solutions of linear systems of equations. Additional material that would be suitable for senior or graduate-level courses on this topic is also suggested.

The nonlinear optimizationlayout technique (NLT) is a heuristic algorithm developed to minimize the cost for facility layouts, where cost is a function of the relative location of departments. Applications show that NLT is a low-cost procedure that yields effective and accurate solutions within minimal time. A simplified nongraphic version that can be run on a personal computer proves to be as practical and effective as the original algorithm.

The selection of parts and machines poses an important problem in the design and planning phases of cellular manufacturing and flexible manufacturing systems. In most real-life situations, this grouping invariably leads to `bottle-neck' parts and machines. This paper discusses a method of identifying the minimal number of bottle-neck cells (machines or parts) which, when dealt with through either duplication of machines or subcontracting of parts, will result in perfect part-machine groupings with no overlap. The polynomially bounded algorithms used in the analysis are oriented towards finding minimal cut-nodes in either partition of' the bipartite part-machine graph. [ABSTRACT FROM AUTHOR]