{"id":"W4285286335","doi":"10.5267/j.ijiec.2022.1.002","title":"A hybrid matheuristic approach for the vehicle routing problem with three-dimensional loading constraints","year":2022,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Vehicle routing problem; Column generation; Mathematical optimization; GRASP; Benchmark (surveying); Set (abstract data type); Bin packing problem; Heuristic; Computer science; Greedy algorithm; Packing problems; Greedy randomized adaptive search procedure; Heuristics; Set packing; Path (computing); Constructive; Container (type theory); Routing (electronic design automation); Mathematics; Algorithm; Process (computing); Bin; Engineering","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.0006393462,0.0009419624,0.000710862,0.0009238766,0.0005615301,0.001076577,0.001623683,0.0009614982,0.003577255],"category_scores_gemma":[0.001047693,0.00045402,0.0009358436,0.0007760795,0.000713523,0.0007997733,0.0009946579,0.00112713,0.0007160362],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009965707,"about_ca_system_score_gemma":0.001540309,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003771514,"about_ca_topic_score_gemma":0.004529429,"domain_scores_codex":[0.9995827,0.0001168362,0.00001737541,0.00007167025,0.0001617935,0.00004958174],"domain_scores_gemma":[0.9996111,0.0002061745,0.00004737163,0.00003888172,0.00007324183,0.0000231395],"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.00003833787,0.00006278419,0.0002731466,0.00009576185,0.00003294219,0.00007212192,0.00004862073,0.9154164,0.003219317,0.02254679,0.001175969,0.0570178],"study_design_scores_gemma":[0.00001005582,0.0000283337,0.00003629476,0.000005630164,0.000004447485,0.00002655658,0.000007757854,0.9948008,0.0005130304,0.003328733,0.001233166,0.000005282165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004886568,0.00007215848,0.9907016,0.00008886994,0.00002139973,0.00005389443,0.00002846727,0.000236204,0.003910802],"genre_scores_gemma":[0.1311058,0.0002027432,0.8649588,0.0001827313,0.0000471708,0.0002928254,0.0001655137,0.0001223371,0.002922137],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003771514,"threshold_uncertainty_score":0.01196712,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02662123543359013,"score_gpt":0.229159430377857,"score_spread":0.2025381949442668,"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."}}