MétaCan
Menu
Back to cohort
Record W2617449067 · doi:10.5539/jmr.v9n3p95

A Fuzzy-stochastic Approach for Binary Linear Programming under Uncertainties

2017· article· en· W2617449067 on OpenAlexafffundvenue
Wei Peng, René V. Mayorga

Bibliographic record

VenueJournal of Mathematics Research · 2017
Typearticle
Languageen
FieldSocial Sciences
TopicTransportation Planning and Optimization
Canadian institutionsUniversity of Regina
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsMathematicsInterval (graph theory)Fuzzy logicMathematical optimizationBinary numberLinear programmingArtificial intelligenceComputer science

Abstract

fetched live from OpenAlex

This paper presents an innovative Fuzzy-Stochastic Approach (FSA) to solve Binary Linear Programming (BLP) problems under uncertainties. An Interval-coefficient Fuzzy Binary Linear Programming (IFBLP) model is applied here to reflect two different types of uncertainty in a BLP problem. In the proposed IFBLP model the interval coefficient is used to reflect parameter uncertainty, and the fuzzy goal & fuzzy constraints are used to represent model structure uncertainty. The proposed FSA would de-fuzzify the fuzzy constraints in an IFBLP model by considering its fuzzy goal; and then derive two linear BLPs with extreme crisp-coefficients from the IFBLP model, which here are called as a best optimum BLP and a worst optimum BLP. The results of the two-extreme linear BLPs are used to bound the outcome distribution of the IFBLP model. The proposed FSA is applied into a long-term traffic noise control planning to present its applicability.

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.002
metaresearch head score (Gemma)0.003
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: Methods · Consensus signal: Methods
Teacher disagreement score0.004
Threshold uncertainty score0.011

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.003
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.002
Bibliometrics0.0010.001
Science and technology studies0.0010.001
Scholarly communication0.0010.002
Open science0.0010.002
Research integrity0.0010.003
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.223
GPT teacher head0.465
Teacher spread0.241 · 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
GenreMethods

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
Published2017
Admission routes3
Has abstractyes

Explore more

Same venueJournal of Mathematics ResearchSame topicTransportation Planning and OptimizationFrench-language works237,207