{"id":"W2332834184","doi":"10.1016/j.ejor.2016.03.040","title":"An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization","year":2016,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":266,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Vehicle routing problem; Heuristics; Computer science; Synchronization (alternating current); Routing (electronic design automation); Set (abstract data type); Mathematical optimization; Real-time computing; Operations research; Computer network; Mathematics","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.001270712,0.0006153531,0.001586115,0.0007224252,0.0004777396,0.0008293975,0.001830282,0.001663534,0.002531434],"category_scores_gemma":[0.004022388,0.0005950771,0.0006216469,0.000804402,0.0007424799,0.00138904,0.00149802,0.0009332791,0.00021199],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008120207,"about_ca_system_score_gemma":0.001187538,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008650142,"about_ca_topic_score_gemma":0.006238843,"domain_scores_codex":[0.9996347,0.000179651,0.00001333913,0.00007105825,0.00006215325,0.00003895683],"domain_scores_gemma":[0.9984167,0.001204434,0.0001253429,0.00004367632,0.0001250717,0.00008477541],"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.00007383151,0.0000328002,0.00022999,0.00003670752,0.00002226797,0.00003157435,0.00002343311,0.9837168,0.0002465935,0.005921503,0.0007885314,0.008875942],"study_design_scores_gemma":[0.000008346438,0.0000125384,0.00002111799,0.000001753705,0.000001853495,0.000002897996,0.000004361815,0.9990014,0.00001861384,0.0008315084,0.00009424696,0.000001352883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04585023,0.0006483452,0.9476935,0.0005380745,0.0001193924,0.00009318136,0.00009830478,0.0001235402,0.004835544],"genre_scores_gemma":[0.7330157,0.000500758,0.2581994,0.0001907303,0.0001108746,0.0003763909,0.000275901,0.0001000386,0.007230172],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008650142,"threshold_uncertainty_score":0.01719964,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0590928165349166,"score_gpt":0.340670755225449,"score_spread":0.2815779386905324,"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."}}