Title of article
Lower boundsforthemixedcapacitatedarcroutingproblem
Author/Authors
Luis Gouveia، نويسنده , , MariaCândidaMour?ob، نويسنده , , LeonorSantiagoPintob، نويسنده , , d، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2010
Pages
8
From page
692
To page
699
Abstract
Capacitated arcroutingproblems(CARP)ariseindistributionorcollectingproblemswhereactivitiesare
performed byvehicles,withlimitedcapacity,andarecontinuouslydistributedalongsomepre-defined
links ofanetwork.TheCARPisdefinedeitherasanundirectedproblemorasadirectedproblemdepend-
ing onwhethertherequiredlinksareundirectedordirected.Themixedcapacitatedarcroutingproblem
(MCARP) modelsamorerealisticscenariosinceitconsidersdirectedaswellasundirectedrequiredlinks
in theassociatednetwork.WepresentacompactflowbasedmodelfortheMCARP.Duetoitslargenum-
ber ofvariablesandconstraints,wehavecreatedanaggregatedversionoftheoriginalmodel.Although
this modelisnolongervalid,weshowthatitprovidesthesamelinearprogrammingboundthanthe
original model.Differentsetsofvalidinequalitiesarealsoderived.Thequalityofthemodelsistestedon
benchmark instanceswithquitepromisingresults.
Keywords
Mixed capacitated arc routing , Formulations , Lower bounds
Journal title
Computers and Operations Research
Serial Year
2010
Journal title
Computers and Operations Research
Record number
927682
Link To Document