Letchford, A N and Eglese, R W and Lysgaard, J (2004) A new branch-and-cut algorithm for the capacitated vehicle routing problem. Mathematical Programming, 100 (2). pp. 423-445. ISSN 0025-5610Full text not available from this repository.
We present a new branch-and-cut algorithm for the capacitated vehicle routing problem (CVRP). The algorithm uses a variety of cutting planes, including capacity, framed capacity, generalized capacity, strengthened comb, multistar, partial multistar, extended hypotour inequalities, and classical Gomory mixed-integer cuts. For each of these classes of inequalities we describe our separation algorithms in detail. Also we describe the other important ingredients of our branch-and-cut algorithm, such as the branching rules, the node selection strategy, and the cut pool management. Computational results, for a large number of instances, show that the new algorithm is competitive. In particular, we solve three instances (B-n50-k8, B-n66-k9 and B-n78-k10) of Augerat to optimality for the first time.
|Journal or Publication Title:||Mathematical Programming|
|Uncontrolled Keywords:||vehicle routing ; branch-and-cut ; combinatorial optimisation|
|Subjects:||H Social Sciences > HB Economic Theory|
|Departments:||Lancaster University Management School > Management Science|
|Deposited On:||11 Jul 2011 19:04|
|Last Modified:||04 Nov 2015 03:23|
Actions (login required)