{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001371259,0.001188209,0.001670192,0.001186751,0.0006788595,0.001750273,0.002020321,0.001608749,0.003574775],"category_scores_gemma":[0.002736271,0.001125589,0.001038395,0.001699907,0.0006455499,0.001684914,0.001067055,0.001638395,0.0002882597],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00172904,"about_ca_system_score_gemma":0.002304628,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01085153,"about_ca_topic_score_gemma":0.01352052,"domain_scores_codex":[0.9993641,0.0002553503,0.00003127626,0.00008173748,0.00009069128,0.0001768538],"domain_scores_gemma":[0.9981445,0.001444825,0.0001387373,0.00006394712,0.00007302928,0.0001348844],"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.0002338012,0.0001675751,0.0002673625,0.0001642673,0.00005849541,0.0000877104,0.00006582099,0.9536706,0.0007938475,0.01168986,0.00185034,0.0309503],"study_design_scores_gemma":[0.00008937578,0.0000935668,0.0001436001,0.00001754189,0.00003001956,0.000024349,0.00003686712,0.991268,0.0003557421,0.006906069,0.001022423,0.00001258041],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1581626,0.003592047,0.8209103,0.0007599709,0.0003142851,0.0006152172,0.0005726733,0.000781488,0.01429136],"genre_scores_gemma":[0.6649878,0.001715656,0.3266063,0.0001925865,0.0001349237,0.0003280315,0.0003439866,0.0001405724,0.005550225],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01085153,"threshold_uncertainty_score":0.02157676,"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."}}