نتایج جستجو برای: lagrangian relaxation based algorithm

تعداد نتایج: 3419800  

2008
Vo Ngoc Dieu Weerakorn Ongsakul

This paper proposes an augmented Lagrange Hopfield network (ALHN) for combined heat and power economic dispatch (CHPED) problem. The ALHN method is the continuous Hopfield neural network with its energy function based on augmented Lagrangian relaxation. In the proposed ALHN, the energy function is augmented by Hopfield terms from Hopfield neural network and penalty factors from augmented Lagran...

P-hub maximal covering location problem is one of the most commonly used location- allocation problems. In this problem, the goal is to determine the best location for the hubs such that the covered demand is maximized by considering the predefined coverage radius. In classical hub problems, if the distance between the origin and destination is less than this radius, coverage is possible; other...

2013
Krzysztof Stachowiak Piotr Zwierzykowski

Due to the process of network convergence, the variety of types of traffic transmitted over a single medium increases steeply. This phenomenon can be handled by the existing networking structure although the protocols that are used and, especially, the underlying routing protocols need to be improved. The problem of finding the shortest path on the Internet can no longer be easily defined as th...

Journal: :European Journal of Operational Research 2008
Aiying Rong Risto Lahdelma Peter B. Luh

Trigeneration is a booming power production technology where three energy commodities are simultaneously produced in a single integrated process. Electric power, heat (e.g. hot water) and cooling (e.g. chilled water) are three typical energy commodities in the trigeneration system. The production of three energy commodities follows a joint characteristic. This paper presents a Lagrangian relaxa...

2006
Vo Ngoc Dieu Weerakorn Ongsakul

This paper proposes an augmented Lagrangian Hopfield network (ALHN) for combined heat and power economic dispatch (CHPED) problem. The ALHN is the continuous Hopfield neural network based on augmented Lagrangian relaxation as its energy function. In the proposed ALHN, its energy function is augmented by Hopfield terms from Hopfield neural network and penalty factors from augmented Lagrangian re...

2011
Ofer Meshi Amir Globerson

Maximum a-posteriori (MAP) estimation is an important task in many applications of probabilistic graphical models. Although finding an exact solution is generally intractable, approximations based on linear programming (LP) relaxation often provide good approximate solutions. In this paper we present an algorithm for solving the LP relaxation optimization problem. In order to overcome the lack ...

2003
Erik Dotzauer

The paper deals with the economic dispatch problem for a district heating system. The distribution network is modeled with a number of nodes and arcs, implying that time delays and restrictions in distribution capacity can be considered. A solution algorithm for the corresponding nonlinear optimization problem is proposed. The method is based on Lagrangian relaxation and exploits the relations ...

Journal: :Computers & OR 2007
Lixin Tang Hua Xuan Jiyin Liu

In this paper we consider the single machine scheduling problem with precedence constraints to minimize the total weighted tardiness of jobs. This problem is known to be strongly NP-hard.A solution methodology based on Lagrangian relaxation is developed to solve it. In this approach, a hybrid backward and forward dynamic programming algorithm is designed for the Lagrangian relaxed problem, whic...

2007
Sandro Pirkwieser Günther R. Raidl Jakob Puchinger

We present a Lagrangian decomposition approach for the Knapsack Constrained Maximum Spanning Tree problem yielding upper bounds as well as heuristic solutions. This method is further combined with an evolutionary algorithm to a sequential hybrid approach. Experimental investigations, including a comparison to a previously suggested simpler Lagrangian relaxation based method, document the advant...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید