The Multiobjective Discrete Optimization Problem: A Weighted Min-Max Two-Stage Optimization Approach and a Bicriteria Algorithm

2005 ◽  
Vol 51 (10) ◽  
pp. 1572-1581 ◽  
Author(s):  
Serpil Sayın ◽  
Panos Kouvelis
Author(s):  
Ning Quan ◽  
Harrison Kim

The power maximizing grid-based wind farm layout optimization problem seeks to determine the layout of a given number of turbines from a grid of possible locations such that wind farm power output is maximized. The problem in general is a nonlinear discrete optimization problem which cannot be solved to optimality, so heuristics must be used. This article proposes a new two stage heuristic that first finds a layout that minimizes the maximum pairwise power loss between any pair of turbines. The initial layout is then changed one turbine at a time to decrease sum of pairwise power losses. The proposed heuristic is compared to the greedy algorithm using real world data collected from a site in Iowa. The results suggest that the proposed heuristic produces layouts with slightly higher power output, but are less robust to changes in the dominant wind direction.


Author(s):  
Masoud Ansari ◽  
Amir Khajepour ◽  
Ebrahim Esmailzadeh

Vibration control has always been of great interest for many researchers in different fields, especially mechanical and civil engineering. One of the key elements in control of vibration is damper. One way of optimally suppressing unwanted vibrations is to find the best locations of the dampers in the structure, such that the highest dampening effect is achieved. This paper proposes a new approach that turns the conventional discrete optimization problem of optimal damper placement to a continuous topology optimization. In fact, instead of considering a few dampers and run the discrete optimization problem to find their best locations, the whole structure is considered to be connected to infinite numbers of dampers and level set topology optimization will be performed to determine the optimal damping set, while certain number of dampers are used, and the minimum energy for the system is achieved. This method has a few major advantages over the conventional methods, and can handle damper placement problem for complicated structures (systems) more accurately. The results, obtained in this research are very promising and show the capability of this method in finding the best damper location is structures.


2012 ◽  
Vol 21 (5) ◽  
pp. 643-660 ◽  
Author(s):  
YONATAN BILU ◽  
NATHAN LINIAL

We introduce the notion of a stable instance for a discrete optimization problem, and argue that in many practical situations only sufficiently stable instances are of interest. The question then arises whether stable instances of NP-hard problems are easier to solve, and in particular, whether there exist algorithms that solve in polynomial time all sufficiently stable instances of some NP-hard problem. The paper focuses on the Max-Cut problem, for which we show that this is indeed the case.


Sign in / Sign up

Export Citation Format

Share Document