Please use this identifier to cite or link to this item:
Type: Artigo de periódico
Title: A branch-and-cut-and-price approach for the capacitated m-ring-star problem
Author: Hoshino, EA
de Souza, CC
Abstract: The capacitated m-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. (C) 2011 Elsevier B.V. All rights reserved.
Subject: Ring-star
Integer programming
Combinatorial optimization
Country: Holanda
Editor: Elsevier Science Bv
Rights: fechado
Identifier DOI: 10.1016/j.dam.2011.11.029
Date Issue: 2012
Appears in Collections:Artigos e Materiais de Revistas Científicas - Unicamp

Files in This Item:
File Description SizeFormat 
WOS000310667700023.pdf378.65 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.