文件名称:Enhanced Branch and Price and Cut for Vehicle Routing with Split Deliveries and Time Windows
-
所属分类:
- 标签属性:
- 上传时间:2019-10-21
-
文件大小:266.42kb
-
已下载:0次
-
提 供 者:
-
相关连接:无下载说明:别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容来自于网络,使用问题请自行百度
In this paper, we study the split delivery vehicle routing problem with time windows (SDVRPTW) that is a variant of the well-known vehicle routing problem with time windows (VRPTW), where each customer can be served by more than one vehicle. We propose enhancement procedures for the exact branch-and-price- and-cut algorithm that was recently developed for the SDVRPTW. In particular, we introduce a tabu search algorithm to solve the column-generation subproblem, extensions of several classes of valid inequalities, and a new separation algorithm for the k-path inequalities. Computational results show the effectiveness of the proposed enhancements.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
压缩包 : TW67TS2011_Enhanced Branch and Price and Cut for Vehicle Routing with Split Deliveries and Time Wind 列表
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.