{"id":"W2397006241","doi":"10.1080/03155986.2003.11732674","title":"A Heuristic Procedure For Path Location With Multisource Demand","year":2003,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Fundación Séneca","keywords":"Correctness; Mathematical optimization; Heuristic; Directed acyclic graph; Path (computing); Computer science; Relaxation (psychology); Lagrangian relaxation; Mathematics; Algorithm","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001752345,0.0001053964,0.0001177266,0.0002111067,0.0003247461,0.0004231351,0.00006534094,0.00008357655,0.00000737329],"category_scores_gemma":[0.0007655997,0.00008740178,0.00001223538,0.0003634708,0.00004304916,0.001014777,0.000009327405,0.0001410545,0.00002094257],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007792039,"about_ca_system_score_gemma":0.0001602236,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001183091,"about_ca_topic_score_gemma":0.000002885005,"domain_scores_codex":[0.9987853,0.00007155754,0.0003723861,0.000086625,0.0004543645,0.0002297977],"domain_scores_gemma":[0.9983518,0.0002647601,0.00004152857,0.0001125507,0.001137832,0.00009151336],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002916696,0.000007708486,0.001288664,0.0008507911,0.0000254772,1.997186e-7,0.001566911,0.9310598,0.00004708918,0.06230409,0.001540188,0.001279909],"study_design_scores_gemma":[0.0007630567,0.00007984248,0.000855636,0.00009836104,0.000003734613,0.00003490831,0.0009773335,0.9463795,0.0001592404,0.00003960525,0.05046567,0.0001431277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02955921,0.0002475718,0.9612995,0.00005647266,0.0001130506,0.001684925,0.0000359946,0.0001246135,0.006878666],"genre_scores_gemma":[0.9778014,0.00002419802,0.02118374,0.00003977257,0.00004781791,0.0005130891,0.00009653978,0.00001563153,0.0002778396],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9482421,"threshold_uncertainty_score":0.4080302,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03506155638362248,"score_gpt":0.3216921373674371,"score_spread":0.2866305809838146,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}