4.6 Article

A new mixed integer linear model for a rich vehicle routing problem with docking constraints

期刊

ANNALS OF OPERATIONS RESEARCH
卷 181, 期 1, 页码 337-358

出版社

SPRINGER
DOI: 10.1007/s10479-010-0748-4

关键词

Vehicle routing; Simultaneous delivery and pick-up; Docking constraints; Mixed integer linear programming

向作者/读者索取更多资源

In this paper we address a rich vehicle routing problem that arises in real-life applications. Among other aspects we consider time windows, simultaneous delivery and pick-up at customer locations and multiple use of vehicles. To guarantee a coordinated material flow at the depot, we include the timed allocation of vehicles to loading bays at which the loading and unloading activities can occur. The resulting vehicle routing problem is formulated as a two-index vehicle-flow model which integrates the routing under real-life conditions and the assignment of vehicles to loading bays at the depot. We use CPLEX 11.0 to solve medium-sized instances that are derived from the extended Solomon test set. The selective implementation of preprocessing techniques and cutting planes improves the solver performance significantly.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.6
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据