MétaCan
Menu
Back to cohort
Record W27583426

Locating Post Offices Using Fuzzy Goal Programming and Geographical Information System (GIS)

2011· article· en· W27583426 on OpenAlexaff
Mohammad Hossein Fazel Zarandi, Soheil Davari, Mina Hamidifar, İ.B. Türkşen

Bibliographic record

VenueAmericas Conference on Information Systems · 2011
Typearticle
Languageen
FieldEngineering
TopicOptimization and Mathematical Programming
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsMegacityGeographic information systemFuzzy logicComputer scienceService (business)Operations researchOrder (exchange)Information systemGoal programmingFacility location problemGeographyBusinessEngineeringArtificial intelligenceMarketingCartographyEconomics
DOInot available

Abstract

fetched live from OpenAlex

This paper deals with the problem of locating new post offices in a megacity. To do so, a combination of geographicalinformation system (GIS) and fuzzy goal programming (FGP) is used. In order to locate new offices, first six types of servicefacilities with high levels of interactions with post offices are defined. Then, aspiration level of proximity for each servicefacility is determined. Based on these values, a fuzzy goal programming model is constructed to find potential locations offacilities. In order to determine the optimal locations among potential facilities, a maximal covering location problem(MCLP) is solved and results are reported. Results show that although the current state is near-optimal, for future expansionsof the network, the government should spend money on central and southern parts of this megacity.

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.001
metaresearch head score (Gemma)0.001
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.017
Threshold uncertainty score0.034

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.001
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0010.001
Scholarly communication0.0020.002
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0010.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.031
GPT teacher head0.236
Teacher spread0.205 · 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 designSimulation or modeling
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

Citations2
Published2011
Admission routes1
Has abstractyes

Explore more

Same venueAmericas Conference on Information SystemsSame topicOptimization and Mathematical ProgrammingFrench-language works237,207