{"id":"W2588539916","doi":"10.1016/j.ejor.2017.01.045","title":"A routing and scheduling approach to rail transportation of hazardous materials with demand due dates","year":2017,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Risk and Safety Analysis","field":"Decision Sciences","cited_by":42,"is_retracted":false,"has_abstract":false,"ca_institutions":"McMaster University; Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Tardiness; Scheduling (production processes); Integer programming; Hazardous waste; Computer science; Operations research; Routing (electronic design automation); Job shop scheduling; Train; Heuristic; Mathematical optimization; Transport engineering; Engineering; Mathematics; Computer network; 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.0021388,0.00160524,0.002694181,0.002246297,0.001595577,0.003074221,0.003684301,0.002572234,0.007031671],"category_scores_gemma":[0.003760685,0.002238479,0.002437683,0.003141271,0.001482278,0.002182108,0.001576565,0.001897552,0.0006237966],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003914788,"about_ca_system_score_gemma":0.004011695,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.03970893,"about_ca_topic_score_gemma":0.02637205,"domain_scores_codex":[0.9987807,0.0004186484,0.00006121268,0.0002855512,0.0002221556,0.0002317265],"domain_scores_gemma":[0.99821,0.001111652,0.0001982058,0.00007344686,0.0002321137,0.0001745922],"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.00004497558,0.00004928243,0.0001611722,0.00003880156,0.0000346608,0.00006869825,0.00003569263,0.9845669,0.0005382746,0.007124299,0.0004854038,0.006851861],"study_design_scores_gemma":[0.00001323866,0.00002509457,0.00005941123,0.000002748885,0.00001417811,0.00001033296,0.00001583631,0.9956535,0.00008444731,0.003846545,0.0002676333,0.000006966438],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03837053,0.0003218768,0.9545116,0.0006088862,0.0002030785,0.0003203487,0.0002742524,0.0002839239,0.005105533],"genre_scores_gemma":[0.5338612,0.0007494802,0.4495504,0.000207276,0.0003422289,0.0004337415,0.0004744205,0.0003023891,0.01407887],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03970893,"threshold_uncertainty_score":0.07895565,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2134669345494748,"score_gpt":0.4330628127785226,"score_spread":0.2195958782290478,"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."}}