{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004088439,0.0001260795,0.0001457102,0.0001935404,0.0001815948,0.0001032532,0.0003363293,0.00002560723,0.00005189676],"category_scores_gemma":[0.00006483386,0.0001036564,0.00008616971,0.0001627073,0.00003178623,0.0001142649,0.00004434275,0.0004484524,7.178421e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001630175,"about_ca_system_score_gemma":0.0001039088,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004085419,"about_ca_topic_score_gemma":3.410515e-7,"domain_scores_codex":[0.9989035,0.00001798968,0.000408115,0.00009108967,0.0004220401,0.0001573006],"domain_scores_gemma":[0.999088,0.0003719605,0.0001647535,0.00006436335,0.0002562635,0.00005467824],"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.0000336411,0.00003191337,0.00009929146,0.000005125445,0.0002811551,0.000009431123,0.000113437,0.9939606,0.00009646316,0.001441249,0.0007989281,0.003128745],"study_design_scores_gemma":[0.001314071,0.00007689105,0.00003575422,0.00004480693,0.00004053087,0.0004342411,0.00005563969,0.9962547,0.00007040835,0.0001126077,0.001438285,0.0001220616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01288198,0.0000678627,0.9847818,0.0003356525,0.001346368,0.0002902748,0.00007074078,0.00008786071,0.0001374907],"genre_scores_gemma":[0.9646357,0.000001274565,0.03479924,0.00003354602,0.0004098044,0.00003428897,0.00003956776,0.00003497168,0.00001164093],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9517537,"threshold_uncertainty_score":0.4226987,"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."}}