{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009581973,0.0009830265,0.000906828,0.001600516,0.0008441906,0.0009118854,0.001969269,0.001354263,0.00710037],"category_scores_gemma":[0.002725572,0.0006487145,0.001031797,0.001516443,0.001020148,0.001245208,0.001287834,0.002007913,0.001814307],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008109211,"about_ca_system_score_gemma":0.001891705,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00217283,"about_ca_topic_score_gemma":0.003171672,"domain_scores_codex":[0.9990694,0.0003027448,0.00003127772,0.0001527271,0.0003334365,0.0001104155],"domain_scores_gemma":[0.9990183,0.0005353109,0.00009586523,0.0002069998,0.0001112043,0.00003222759],"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.0001980518,0.0002451486,0.0004486858,0.000482063,0.0001164802,0.0002950919,0.000259735,0.5583634,0.01552201,0.07246624,0.007969401,0.3436337],"study_design_scores_gemma":[0.00008454804,0.0001078608,0.0001830623,0.000046081,0.00003164622,0.0002269437,0.00005705698,0.9522644,0.007403045,0.02724936,0.01229984,0.00004609027],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002337301,0.00004864272,0.9958269,0.00005250672,0.00001596975,0.00008032857,0.00004158264,0.0003363779,0.00126042],"genre_scores_gemma":[0.05397818,0.0001001625,0.9434435,0.00005666971,0.00001753785,0.0002845821,0.0002329304,0.0001446523,0.001741797],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00710037,"threshold_uncertainty_score":0.02375311,"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."}}