Pickup and delivery of automobiles from warehouses to dealers
Pickup and delivery of automobiles from warehouses to dealers
复制标题
将汽车从仓库提货并运送至经销商
DOI：
10.1016/j.trb.2018.08.011
复制
发表时间：
2018-11
期刊：
影响因子：
--
通讯作者：
Chen Zhi Long
中科院分区：
文献类型：
--
作者：
Wang Yu;Chen Feng;Chen Zhi Long
本文考虑汽车出库物流中的卡车装载和路线问题。每天，第三方物流 (3PL) 公司都会收到来自多家汽车制造商的大量订单，需要将订单分配给可用的卡车，卡车从存放订单的仓库提取订单并将其交付给经销商。每个订单对应于给定经销商所需的特定汽车，并与价值和小型、中型或大型三种汽车类型之一相关联。订单的价值取决于它是否是紧急订单以及等待分配给卡车的天数。每辆送货卡车都可以访问预先指定的城市子集，并与特定的容量配置相关联，该配置指定三种车辆类型中每种车辆的可用槽位数量。问题是将订单的子集分配给可用卡车，并为每辆卡车创建一条路线，以最大化分配订单的总奖励，定义为给定重量乘以分配订单的总价值减去所产生的总运输成本，但受到许多约束。开发了基于列生成的启发式算法，其中问题的 LP 松弛被分解为由 LP 求解器求解的主问题和由基于动态规划的算法求解的多个子问题。通过将其解与上限进行比较来评估所提出的算法，并证明该算法能够在合理的计算时间内为实际规模的问题生成接近最优的解。该算法还与基于 3PL 公司真实数据集的实践中使用的基于规则的贪婪方法进行了比较，结果显示其性能大幅优于贪婪方法。
This paper considers a truck loading and routing problem in automobile outbound logistics. Everyday, a third-party logistics (3PL) company receives a number of orders from several auto manufacturers and needs to assign the orders to available trucks which pick up the orders from the warehouses where the orders are kept and deliver them to dealers. Each order corresponds to a specific car required by a given dealer and is associated with a value and one of the three car types, small, medium or large. The value of an order is defined by whether it is an emergency order and how many days it has been waiting to be assigned to a truck. Each delivery truck is allowed to visit a pre-specified subset of cities, and is associated with a specific capacity configuration, which specifies the number of slots available for each of the three car types. The problem is to assign a subset of the orders to available trucks and create a route for each truck to maximize the total reward of the assigned orders, defined as a given weight times the total value of the assigned orders minus the total transportation cost incurred, subject to a number of constraints. A column generation based heuristic algorithm is developed where the LP relaxation of the problem is decomposed into a master problem solved by a LP solver and a number of subproblems solved by a dynamic programming based algorithm. The proposed algorithm is evaluated by comparing its solutions to upper bounds and shown to be capable of generating near-optimal solutions for practically sized problems in reasonable computational time. The algorithm is also compared to a rule-based greedy method used in practice based on real data sets from a 3PL company and shown to outperform the greedy method by a large margin.
登录
查看更多内容
影响因子：
2.4
作者：
Mingzhou Jin;S. Eksioglu;Burak Eksioglu;Haiyuan Wang
通讯作者：
Mingzhou Jin;S. Eksioglu;Burak Eksioglu;Haiyuan Wang
DOI：
10.1287/trsc.2013.0492
发表时间：
2015-05
期刊：
Transp. Sci.
影响因子：
--
作者：
M. dell’Amico;S. Falavigna;M. Iori
通讯作者：
M. dell’Amico;S. Falavigna;M. Iori
DOI：
10.1287/trsc.2015.0584
发表时间：
2014-01
期刊：
Transp. Sci.
影响因子：
--
作者：
Thibaut Vidal;N. Maculan;L. Ochi;P. Penna
通讯作者：
Thibaut Vidal;N. Maculan;L. Ochi;P. Penna
三维负载约束下最小化油耗的容量车辆路径问题的演化局部搜索
DOI：
10.1109/icnc.2014.6975835
发表时间：
2014-12
期刊：
Transportation Research Part B: Methodological
影响因子：
--
作者：
Zhenzhen Zhang;Lijun Wei;Andrew Lim
通讯作者：
Andrew Lim
DOI：
10.1016/j.cor.2014.07.007
发表时间：
2014-12
期刊：
Comput. Oper. Res.
影响因子：
--
作者：
Mouna Kchaou Boujelben;C. Gicquel;M. Minoux
通讯作者：
Mouna Kchaou Boujelben;C. Gicquel;M. Minoux