Title of article :
Exploiting sparsityinpricingroutinesforthecapacitatedarcroutingproblem
Author/Authors :
Adam N.Letchford، نويسنده , , AmarOukil، نويسنده ,
Issue Information :
ماهنامه با شماره پیاپی سال 2009
Abstract :
The capacitated arcroutingproblem (CARP) isawell-knownandfundamentalvehicleroutingproblem.A
promising exactsolutionapproachtotheCARPistomodelitasasetcoveringproblemandsolveitvia
branch-cut-and-price. Thebottleneckinthisapproachisthepricing(columngeneration)routine.Inthis
paper, wenotethatmostCARPinstancesarisinginpracticalapplicationsaredefinedon sparse graphs. We
show howtoexploitthissparsitytoyieldfasterpricingroutines.Extensivecomputationalresultsaregiven.
Keywords :
Arc routing , Column generation , Branch-cut-and-price
Journal title :
Computers and Operations Research
Journal title :
Computers and Operations Research
