{"id":"W3122956505","doi":"10.1002/net.20177","title":"Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows","year":2007,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":310,"is_retracted":false,"has_abstract":true,"ca_institutions":"HEC Montréal","funders":"","keywords":"Pickup; Computer science; Branch and cut; Vehicle routing problem; Set (abstract data type); Mathematical optimization; Limit (mathematics); Algorithm; Time limit; Running time; Integer programming; Mathematics; Routing (electronic design automation); Computer network; Engineering; Artificial intelligence","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004200549,0.0001339094,0.0001621408,0.00004323646,0.00007361988,0.00004594747,0.00003721015,0.0001157976,0.000003018215],"category_scores_gemma":[0.000005907091,0.000124383,0.00001230796,0.00009506296,0.0000418133,0.0001413663,0.00002296474,0.000125194,3.661185e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001449382,"about_ca_system_score_gemma":0.00000501518,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005689141,"about_ca_topic_score_gemma":0.00001126962,"domain_scores_codex":[0.9993294,0.00001431153,0.0001488838,0.0001797449,0.00006632401,0.0002613632],"domain_scores_gemma":[0.9995797,0.0001678992,0.00002573227,0.00009508422,0.00003733944,0.00009423259],"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.00001771915,0.000003441802,0.0004586689,0.00003696135,0.00002571896,9.607946e-7,0.0001787444,0.9220534,0.00005122831,0.00004854455,0.00009655994,0.07702807],"study_design_scores_gemma":[0.0006792974,0.00005263753,0.0005760846,0.00005076668,0.00002384202,0.00002196384,0.00000919026,0.997842,0.00004786065,0.0002255902,0.0003079682,0.0001627767],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05054317,0.001567201,0.9468042,0.00001882629,0.00005270404,0.0003347335,0.000002561524,0.0001634142,0.0005131664],"genre_scores_gemma":[0.6592078,0.000394867,0.3397602,0.00009284737,0.0002406924,0.00002513463,0.00001118296,0.00007446707,0.000192811],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6086646,"threshold_uncertainty_score":0.5072193,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01662834278793372,"score_gpt":0.2314751382640148,"score_spread":0.2148467954760811,"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."}}