A branch-and-cut-and-price approach for the capacitated m-ring-star problem

dc.creatorHoshino, EA
dc.creatorde Souza, CC
dc.date2012
dc.dateDEC
dc.date2014-07-30T13:39:06Z
dc.date2015-11-26T16:02:15Z
dc.date2014-07-30T13:39:06Z
dc.date2015-11-26T16:02:15Z
dc.date.accessioned2018-03-28T22:51:41Z
dc.date.available2018-03-28T22:51:41Z
dc.identifierDiscrete Applied Mathematics. Elsevier Science Bv, v. 160, n. 18, n. 2728, n. 2741, 2012.
dc.identifier0166-218X
dc.identifierWOS:000310667700023
dc.identifier10.1016/j.dam.2011.11.029
dc.identifierhttp://www.repositorio.unicamp.br/jspui/handle/REPOSIP/52773
dc.identifierhttp://repositorio.unicamp.br/jspui/handle/REPOSIP/52773
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/1265020
dc.descriptionCoordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
dc.descriptionConselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
dc.descriptionThe 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.
dc.description160
dc.description18
dc.descriptionSI
dc.description2728
dc.description2741
dc.descriptionCoordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
dc.descriptionConselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
dc.descriptionCoordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
dc.descriptionConselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
dc.descriptionCNPq [301732/2007-8, 472504/2007-0]
dc.languageen
dc.publisherElsevier Science Bv
dc.publisherAmsterdam
dc.publisherHolanda
dc.relationDiscrete Applied Mathematics
dc.relationDiscret Appl. Math.
dc.rightsfechado
dc.rightshttp://www.elsevier.com/about/open-access/open-access-policies/article-posting-policy
dc.sourceWeb of Science
dc.subjectRing-star
dc.subjectBranch-and-cut-and-price
dc.subjectInteger programming
dc.subjectCombinatorial optimization
dc.subjectVehicle-routing Problem
dc.titleA branch-and-cut-and-price approach for the capacitated m-ring-star problem
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución