{"id":"W2120035164","doi":"10.1504/ijise.2012.048861","title":"A heuristic method for solving reverse logistics vehicle routing problems with time windows","year":2012,"lang":"en","type":"article","venue":"International Journal of Industrial and Systems Engineering","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vehicle routing problem; Reverse logistics; Heuristic; Computer science; City logistics; Routing (electronic design automation); Transport engineering; Business; Engineering; Supply chain; Embedded system; Artificial intelligence; Marketing","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.0007519277,0.001086016,0.001234714,0.001015654,0.0005002553,0.0006507294,0.001234703,0.001058593,0.002581175],"category_scores_gemma":[0.001151724,0.0005776579,0.001248416,0.001105547,0.0004749134,0.0007911707,0.0006126153,0.001201285,0.000518535],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005410108,"about_ca_system_score_gemma":0.001134145,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002991439,"about_ca_topic_score_gemma":0.002675934,"domain_scores_codex":[0.9995924,0.0001515254,0.00002080586,0.00005749796,0.0001248917,0.00005284946],"domain_scores_gemma":[0.999478,0.0003315874,0.00006912598,0.00002937283,0.00006546003,0.000026476],"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.00009529501,0.0001246944,0.0002204189,0.0002177382,0.00007962986,0.0001154254,0.00006273443,0.868123,0.004959088,0.01426814,0.001507317,0.1102265],"study_design_scores_gemma":[0.00003571602,0.0000779589,0.00006266451,0.00001630704,0.00001984352,0.00005145157,0.00001464451,0.9932319,0.001036406,0.003378845,0.002062081,0.00001218066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005352585,0.0004652884,0.9915643,0.00005336426,0.00007732258,0.00009727926,0.00003303507,0.0001974931,0.00215931],"genre_scores_gemma":[0.1219169,0.0007904142,0.8737594,0.00008800111,0.00007463268,0.0004973609,0.0001405948,0.00008388745,0.002648653],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002991439,"threshold_uncertainty_score":0.008634925,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04019467145360096,"score_gpt":0.2700177521787467,"score_spread":0.2298230807251457,"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."}}