On distributed solving of the capacitated vehicle routing problem with branch-and-cut algorithms

被引：0

作者：

Botincan, M ^{[1
]}

Nogo, G ^{[1
]}

机构：

[1] Univ Zagreb, Dept Math, Zagreb 41000, Croatia

来源：

SOR 05 Proceedings | 2005年

关键词：

vehicle routing problem; branch-and-cut; distributed computing; experimental evaluation;

D O I：

暂无

中图分类号：

F [经济];

学科分类号：

02 ;

摘要：

In this paper, we describe theoretical and implementation issues concerning solving the capacitated vehicle routing problem with branch-and-cut algorithms. A distributed solver for the capacitated vehicle routing problem has been implemented within the branch-and-cut framework SYMPHONY. We present results obtained during experimental evaluation of the solver on a cluster of computers and analyze its scalability.

引用

页码：345 / 350

页数：6