MétaCan
Menu
Back to cohort
Record W2017760786 · doi:10.1115/1.3290763

Lagrangian Relaxation Approach for Decentralized Decision Making in Engineering Design

2010· article· en· W2017760786 on OpenAlexafffund
Simon Li

Bibliographic record

VenueJournal of Computing and Information Science in Engineering · 2010
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Multi-Objective Optimization Algorithms
Canadian institutionsConcordia University
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsLagrangian relaxationContext (archaeology)Relaxation (psychology)Convergence (economics)Engineering design processWorkflowProcess (computing)Factor (programming language)Computer scienceMathematical optimizationAugmented Lagrangian methodIndustrial engineeringSystems engineeringEngineeringMechanical engineeringMathematics

Abstract

fetched live from OpenAlex

To minimize the coordination efforts among design teams and expedite the design process via parallel workflows, a cooperative and decentralized environment is often considered for team-based design. The cooperative environment implies that teams are motivated to achieve the common objective of the design, while the decentralized environment encourages teams to work independently. Due to the nature of the decentralized environment, achieving an optimal solution is not trivial, even though all teams are motivated and willing to do so. In this context, this paper introduces the Lagrangian relaxation approach for solving decentralized design problems. Also, an objective adjustment factor is proposed to improve the convergence of the solution process. Two examples, welded beam design and heat exchanger design, have been used to illustrate and validate the Lagrangian relaxation approach and the objective adjustment factor.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.004
metaresearch head score (Gemma)0.004
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.004
Threshold uncertainty score0.021

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0040.004
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0020.001
Bibliometrics0.0010.001
Science and technology studies0.0010.001
Scholarly communication0.0010.001
Open science0.0010.002
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0030.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.010
GPT teacher head0.264
Teacher spread0.254 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations0
Published2010
Admission routes2
Has abstractyes

Explore more

Same venueJournal of Computing and Information Science in EngineeringSame topicAdvanced Multi-Objective Optimization AlgorithmsFrench-language works237,207