{"id":"W2899109642","doi":"10.1155/2018/1904340","title":"A Synchronous Optimization Model for Multiship Shuttle Tanker Fleet Design and Scheduling Considering Hard Time Window Constraint","year":2018,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Ningbo University; National Natural Science Foundation of China","keywords":"Column generation; Scheduling (production processes); Integer programming; Job shop scheduling; Mathematical optimization; Computer science; Vehicle routing problem; Fleet management; Constraint programming; Engineering; Real-time computing; Routing (electronic design automation); Stochastic programming; Algorithm; Embedded system; Mathematics","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000765927,0.001218231,0.0009346646,0.0004882912,0.0004569605,0.001130683,0.001181832,0.0009656321,0.004089316],"category_scores_gemma":[0.0008409691,0.000618543,0.0009793801,0.0008840287,0.0004481318,0.001078422,0.0006365651,0.001005524,0.0003654296],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009811476,"about_ca_system_score_gemma":0.002006459,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009337051,"about_ca_topic_score_gemma":0.008793398,"domain_scores_codex":[0.9996283,0.0001055671,0.00001394055,0.00009379556,0.00009026805,0.00006804486],"domain_scores_gemma":[0.9996829,0.0001530808,0.00005876697,0.000017804,0.00005336789,0.00003408972],"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.0000137194,0.00001058757,0.00009156385,0.0000272654,0.000006633774,0.00002676002,0.000007873205,0.9924577,0.0005566285,0.00390803,0.0002344511,0.002658777],"study_design_scores_gemma":[0.000003371914,0.00001228492,0.00002827513,0.000001088422,0.000002683962,0.000003052299,0.000003778461,0.9988829,0.00009130467,0.0008038103,0.0001658576,0.000001480539],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01309969,0.0001741924,0.9824686,0.0001214493,0.00003860501,0.00005104324,0.0001298702,0.0001070967,0.003809368],"genre_scores_gemma":[0.7701522,0.0008452059,0.2165279,0.0001060685,0.00006394278,0.0005037035,0.0004678794,0.0001270389,0.01120615],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009337051,"threshold_uncertainty_score":0.01856536,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02364987430930877,"score_gpt":0.2664668767632441,"score_spread":0.2428170024539353,"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."}}