{"id":"W2093962234","doi":"10.1007/s10732-015-9281-6","title":"A hybrid metaheuristic for the vehicle routing problem with stochastic demand and duration constraints","year":2015,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":65,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal","funders":"Centre interuniversitaire de recherche sur les reseaux d'entreprise, la logistique et le transport","keywords":"Duration (music); Vehicle routing problem; Mathematical optimization; GRASP; Heuristics; Metaheuristic; Computer science; Set (abstract data type); Heuristic; Local search (optimization); Constraint (computer-aided design); Greedy randomized adaptive search procedure; Routing (electronic design automation); Mathematics; Greedy algorithm","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.00122957,0.0009611062,0.001084445,0.001315984,0.0004175605,0.00113781,0.002156073,0.001882131,0.002735591],"category_scores_gemma":[0.001722179,0.0007701908,0.001268245,0.001470276,0.0004689812,0.00109188,0.0009381183,0.001117399,0.0003108404],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001140995,"about_ca_system_score_gemma":0.001522947,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005439724,"about_ca_topic_score_gemma":0.00624136,"domain_scores_codex":[0.999428,0.000245699,0.00002864119,0.00007495827,0.0001384099,0.00008428041],"domain_scores_gemma":[0.9990156,0.0006674428,0.00007582877,0.00006492977,0.0001194977,0.00005671356],"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.00008342852,0.00009311492,0.0002904428,0.00005298651,0.0000780499,0.00004441872,0.00002257177,0.9585127,0.001211049,0.007560998,0.0009069949,0.03114332],"study_design_scores_gemma":[0.00002830752,0.00003534869,0.00004768768,0.000005915308,0.00001277548,0.00001245329,0.00000600366,0.9975879,0.0001569061,0.001668286,0.0004340431,0.000004378879],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04504028,0.0006058533,0.9465634,0.0003066295,0.000163676,0.0001298048,0.0001922632,0.0004361326,0.00656191],"genre_scores_gemma":[0.4092031,0.0003929722,0.5834941,0.0003326394,0.0001343131,0.000475105,0.0003438541,0.0001799826,0.005443948],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005439724,"threshold_uncertainty_score":0.01081616,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02428665998332692,"score_gpt":0.2586422517296701,"score_spread":0.2343555917463432,"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."}}