The trade-off between fixed vehicle costs and time-dependent arrival penalties in a routing problem
The trade-off between fixed vehicle costs and time-dependent arrival penalties in a routing problem
复制标题
DOI：
10.1016/j.tre.2013.12.003
复制
发表时间：
2014-02
影响因子：
10.6
通讯作者：
Narath Bhusiri;A. Qureshi;E. Taniguchi
中科院分区：
文献类型：
--
作者：
Narath Bhusiri;A. Qureshi;E. Taniguchi
介绍了带软时间窗的车辆路径问题（VRPSTW），该问题的定义不同于以往文献中的定义。分支和价格的方法，导致一个集划分主问题和它的新的子问题。因此，开发新的技术来解决这个新的子问题。实验结果报告这些解决方案的技术下的分支和价格框架的比较。VRPSTW的解决方案已被进一步比较，以国家的最先进的文献，标志着VRPSTW在这个问题上的优越性。
This paper introduces the vehicle routing problem with soft time windows (VRPSTW) in which problem definition differs from ones previously defined in literature. Branch-and-price approach is employed, resulting in a set partitioning master problem and its new subproblem. Novel techniques are consequently developed to solve this new subproblem. Experimental results report the comparisons of these solution techniques under the branch-and-price framework. The VRPSTW solutions have further been compared to the state-of-the-art literature, signifying the superiority of the VRPSTW on this issue.