{"id":"W2031935785","doi":"10.1007/s00170-012-4708-9","title":"Solving reverse logistics vehicle routing problems with time windows","year":2013,"lang":"en","type":"article","venue":"The International Journal of Advanced Manufacturing Technology","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":48,"is_retracted":false,"has_abstract":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vehicle routing problem; Simulated annealing; Mathematical optimization; Heuristic; Reverse logistics; Integer programming; Computer science; Routing (electronic design automation); Mathematics; Supply chain","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.0003382768,0.0001639419,0.0002118974,0.0002708528,0.0000746466,0.00007061762,0.0008655276,0.00009505131,0.00009092474],"category_scores_gemma":[0.0001990949,0.0001156776,0.0000504484,0.0001295084,0.0001073642,0.0003346152,0.0001245291,0.0005433133,0.00004176368],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000177301,"about_ca_system_score_gemma":0.00002482017,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005719829,"about_ca_topic_score_gemma":0.000001948315,"domain_scores_codex":[0.9988397,0.0000270123,0.0004463664,0.0001164107,0.0003178041,0.0002527165],"domain_scores_gemma":[0.9989539,0.0001669088,0.0003117355,0.0002242487,0.0002996325,0.00004360292],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00001537905,0.0000125102,0.0001679388,0.000007805673,0.0001242171,0.00002109145,0.0000960297,0.9325021,0.03995627,0.0001813957,0.0001991122,0.02671619],"study_design_scores_gemma":[0.002354607,0.0002875407,0.001393371,0.0005854458,0.00007842204,0.001449223,0.0006603535,0.2896481,0.6827132,0.01536104,0.004855351,0.0006134144],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7545553,0.0001278144,0.2401036,0.00320783,0.0005467639,0.0002425331,0.000002240313,0.0004092341,0.0008047],"genre_scores_gemma":[0.8674528,0.00007050105,0.1320887,0.00009450193,0.0001239992,0.000008383644,0.000001050336,0.00003941952,0.0001206646],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.642854,"threshold_uncertainty_score":0.4717196,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008513473753236417,"score_gpt":0.2283969953747722,"score_spread":0.2198835216215358,"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."}}