科研之友
微信
新浪微博
Facebook
分享链接
摘要
In this article, we address a variant of the vehicle routing problem which occurs in real-life applications, called the clustered vehicle routing problem. The clustered vehicle routing problem (CluVRP) looks for an optimal collection of routes, with respect to cost minimization, for a fleet of vehicles, fulfilling all customers' requirements which have a particular structure being divided into clusters, the capacity constraints of the vehicles and with the additional constraint that all the customers belonging to the same cluster must be visited consecutively before leaving the cluster. We propose a novel approach for solving the problem using a decomposition-based method which splits the CluVRP into two easier subproblems. The results of the computational experiments on three sets of benchmark instances from the literature show that our approach is competitive in comparison with the known solution approaches published to date.
- 出版日期2018-2
