Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
420090 | Discrete Applied Mathematics | 2012 | 14 Pages |
Abstract
The capacitated mm-ring–star problem is a variant of the classical one-depot capacitated vehicle routing problem in which a customer is either on a route or is connected to another customer or to some Steiner point present in a route. We develop a new exact algorithm for this problem using a branch-and-cut-and-price approach and compare its performance with that of a branch-and-cut algorithm proposed earlier in the literature. Computational results show that the new algorithm outperforms the branch-and-cut one in many instance classes.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Edna A. Hoshino, Cid C. de Souza,