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

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

2009
Lindsay D. Millard Kathleen C. Howell

Decentralized control and agent-based modeling techniques are employed to determine optimal spacecraft motion for formations having multifaceted objectives in complex dynamic regimes. Cooperative satellite “agents” share a common objective (high resolution imaging) and simultaneously pursue private goals (minimal fuel usage). An algorithm is developed based on dual decomposition. The solution f...

A.R Shahani, M.R Amini

This paper deals with the implementation of an efficient Arbitrary Lagrangian Eulerian (ALE) formulation for the three dimensional finite element modeling of mode I self-similar dynamic fracture process. Contrary to the remeshing technique, the presented algorithm can continuously advance the crack with the one mesh topology. The uncoupled approach is employed to treat the equations. So, each t...

2007
Sarawut Wattanawongpitak

This thesis proposes a two-stage optimization for solving unit commitment. In the first stage, Lagrangian Relaxation (LR) method is used to solve unit commitment using a sub-gradient algorithm for updating Lagrange multipliers. In the second stage, Particle Swarm Optimization (PSO) is applied to update Lagrange multipliers in the Lagrangian Relaxation method (PSOLR). Lagrange multipliers soluti...

2007
Jonathan Chevelu Nelly Barbot Olivier Boëffard Arnaud Delhay

This article is interestedin the problemof the linguisticcontent of a speech corpus. Depending on the target task (speech recognition, speech synthesis, etc) we try to control the phonological and linguistic content of the corpus by collectingan optimal set of sentences which make it possible to cover a preset description of phonological attributes (prosodic tags, allophones, syllables, etc) un...

2014
Jeffrey Flanigan Sam Thomson Jaime G. Carbonell Chris Dyer Noah A. Smith

Abstract Meaning Representation (AMR) is a semantic formalism for which a growing set of annotated examples is available. We introduce the first approach to parse sentences into this representation, providing a strong baseline for future improvement. The method is based on a novel algorithm for finding a maximum spanning, connected subgraph, embedded within a Lagrangian relaxation of an optimiz...

Journal: :Computers & OR 2012
Lixin Tang Ping Che Jiyin Liu

Most production planning models are deterministic and often assume a linear relation between production volume and production cost. In this paper, we investigate a production planning problem in a steel production process considering the energy consumption cost which is a nonlinear function of the production quantity. Due to the uncertain environment, the production demands are stochastic. Taki...

2016
Hong Zheng Srinivas Peeta

This study addresses guideway network design for personal rapid transit (PRT) favoring transit-oriented development. The guideway network design problem seeks to minimize both the guideway construction cost and users’ travel time. In particular, a set of optional points, known as Steiner points, are introduced in the graph to reduce the guideway length. The model is formulated as a combined Ste...

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

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