4.4 Article

Branch-and-price algorithms for the Two-Echelon Capacitated Vehicle Routing Problem

期刊

OPTIMIZATION LETTERS
卷 7, 期 7, 页码 1537-1547

出版社

SPRINGER HEIDELBERG
DOI: 10.1007/s11590-012-0568-3

关键词

Two-Echelon systems; Vehicle Routing Problem; Branch-and-price

资金

  1. CNPq
  2. FAPEMIG

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

In this paper, we propose an Integer Programming formulation and two branch-and-price implementations for the Two-Echelon Capacitated Vehicle Routing Problem. One algorithm considers routes that satisfy the elementarity condition, while the other relaxes such constraint when pricing routes. For instances that could not be solved to proven optimality within a given time limit, our computational experience suggests that the former provides sharper upper bounds while the latter offers tighter lower bounds. As a by-product, ten new best upper bounds and two new optimality certificates are provided here.

作者

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

评论

主要评分

4.4
评分不足

次要评分

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

推荐

暂无数据
暂无数据