Title of article
Exploiting sparsityinpricingroutinesforthecapacitatedarcroutingproblem
Author/Authors
Adam N.Letchford، نويسنده , , AmarOukil، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2009
Pages
8
From page
2320
To page
2327
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
Serial Year
2009
Journal title
Computers and Operations Research
Record number
927616
Link To Document