科研之友
微信
新浪微博
Facebook
分享链接
摘要
We introduce a new vehicle routing problem class in which customers are divided into a number of customer zones defined through geographical or timing characteristics. The customers of each of these zones must be serviced within time windows by dedicated routes originating at associated supply points characterized by hard time windows and very limited waiting facilities, if any. A key feature of the problem is that a vehicle can be used to cover routes in different zones at different times. The objective is to minimize the total transportation cost to ensure that the customers are serviced on time and that vehicles arrive at the next customer zone just in time for the next assignment. The problem is addressed by a decomposition-based heuristic. Lower-bound procedures and benchmark problem instances are introduced, highlighting the satisfactory performance of the heuristic. Finally, a wide range of sensitivity analyses on several key parameters reveal interesting facets of the behavior of this new problem class.
- 出版日期2015-5
