Optimal Solutions for the Moving Target Vehicle Routing Problem with Obstacles via Lazy Branch and Price
带障碍物的移动目标车辆路径问题的最优解:懒惰分支定价法
机构 * Robotics Institute at Carnegie Mellon University(卡内基梅隆大学机器人学院) ; Mechanical and Aerospace Engineering at Michigan Technological University(密歇根理工大学机械与航空航天工程系) ; Robotics and AI Institute(机器人与人工智能研究所) ; UM-SJTU Joint Institute and Department of Automation at Shanghai Jiao Tong University(上海交通大学与美国密歇根大学联合研究所及自动化系) ; Department of Mechanical Engineering and Department of Computer Science and Engineering at Texas A&M University(德克萨斯农工大学机械工程系和计算机科学与工程系)
AI总结 针对带障碍物的移动目标车辆路径问题(MT-VRP-O),提出懒惰分支定价法(Lazy BPRC),通过松弛连续性约束的延迟成本计算和凸集图搜索,实现最优解并显著加速。