{"id":"W2086399386","doi":"10.1016/j.ejor.2012.02.007","title":"Heuristics for the multi-depot petrol station replenishment problem with time windows","year":2012,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":104,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"TRIPS architecture; Truck; Heuristics; Computer science; Operations research; Heuristic; Set (abstract data type); Depot; Revenue; Vehicle routing problem; Mathematical optimization; Schedule; Gasoline; Transport engineering; Routing (electronic design automation); Engineering; Mathematics; Automotive engineering; Computer network","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008881834,0.00009544361,0.0001115767,0.0001263962,0.0002816183,0.0001539098,0.0002411482,0.00001526125,0.0000903418],"category_scores_gemma":[0.0007421804,0.00006182947,0.00004154133,0.0001965115,0.00005858272,0.0002898375,0.00003093473,0.0003963074,0.00004949745],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001097906,"about_ca_system_score_gemma":0.0000973451,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.838703e-7,"about_ca_topic_score_gemma":4.059989e-7,"domain_scores_codex":[0.9977754,0.0007100853,0.0004092906,0.00008189485,0.0007205527,0.0003027512],"domain_scores_gemma":[0.997831,0.0008058265,0.00008173733,0.0001454754,0.001004996,0.0001309876],"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.0001258452,0.00009203209,0.001074188,0.00003706534,0.0001167919,0.00001031752,0.00105373,0.9769195,0.00464479,0.000522283,0.009303622,0.006099827],"study_design_scores_gemma":[0.002771052,0.0007753313,0.01491666,0.0001220881,0.00004969808,0.0002355327,0.0003545602,0.9183766,0.003124036,0.00002152574,0.05898652,0.0002664579],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01205355,0.0004241228,0.9838054,0.0008856243,0.0001495697,0.0005206225,0.00001987901,0.00003142191,0.002109821],"genre_scores_gemma":[0.5259441,0.00005054989,0.4723203,0.00003970307,0.0006258962,0.00001299424,0.00001145318,0.00006224876,0.0009327915],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5138906,"threshold_uncertainty_score":0.3078284,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08523717946583616,"score_gpt":0.3594690999722097,"score_spread":0.2742319205063736,"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."}}