一类汽车运输问题的分支-价格算法
Branch-and-price algorithm for an auto-carrier transportation problem
摘要：
原始设备制造商（OEM）制造、库存和运输新车给特许经销商。这些特许经销商库存并向最终用户销售新车。原始设备制造商依赖物流公司使用一种特殊类型的卡车（称为自动运输车）将车辆运输到经销商处。车辆分配过程面临着共同的挑战。在本文中，我们提出了一个启发式算法来确定每个自动承运人的路线的基础上，经销商的位置，随后，分支和价格算法来获得最优解的基础上生成的路线的装载问题。装载问题考虑了车辆的实际尺寸，以及车辆制造商和政府机构对装载过程的限制。我们进行了大量的计算实验的加载问题，使用现实世界的实例，我们的结果是基准与整体模型，以证实所提出的方法的有效性。对于最大的实例，包括600辆车，所提出的方法计算的最优解的装载问题在规定的运行时间。
英文摘要：
Original equipment manufacturers (OEMs) manufacture, inventory and transport new vehicles to franchised dealers. These franchised dealers inventory and sell new vehicles to end users. OEMs rely on logistics companies with a special type of truck called an auto-carrier to transport the vehicles to the dealers. The process of vehicle distribution has a common challenge. This challenge involves determining routes, and the way to load the vehicles onto each auto-carrier.In this paper, we present a heuristic to determine the route for each auto-carrier based on the dealers' locations, and subsequently, a branch-and-price algorithm to obtain optimal solutions to the loading problem based on the generated route. The loading problem considers the actual dimensions of the vehicles, and the restrictions imposed by vehicle manufacturers and governmental agencies on the loading process. We perform extensive computational experiments for the loading problem using real-world instances, and our results are benchmarked with a holistic model to corroborate the effectiveness of the proposed method. For the largest instance comprising of 600 vehicles, the proposed method computes an optimal solution for the loading problem within a stipulated runtime.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
