Title of article :
A linearmodelforcompoundmulticommoditynetworkflowproblems
Author/Authors :
Catia M.S.Machado ، نويسنده , , SergioF.Mayerle، نويسنده , , VilmarTrevisan، نويسنده ,
Issue Information :
ماهنامه با شماره پیاپی سال 2010
Abstract :
This workproposesanetworkflowlinearprogrammodeltosolvetheproblemofminimizingcostsof
production anddistributionofcompoundmulticommodities.Inourproposedmodel,coupling
constraintsareconsideredinordertotreattheexistingproportionalityamongseveralflowsof
different commoditiesthatarenecessarytomixtureforcomposingnewcommodities.Thecoupling
constraintmatrixforthistypeofproblemisverylargeingeneral.Ourformulationreducesthenumber
of proportionalityconstraintsenablingtheuseofasolutiontechniquebasedonaspecializationofthe
primal-dualsimplexalgorithmappliedintwodistinctphases.Asinitialsolutionitisusedabasisbuilt
through theheuristicmethodthatallocatesflowsinlowcostlanes.Toperformthechangeofbasis
operation, theworkingmatrixisstoredasaproductformoftheinversetokeepconstantitsdimension
and topreservesparsity.Experimentalresultscontainingaround200,000constraintsand75,000arcs
applicabletothedistributionofmulticommoditiesofapetrochemicalindustrywereaccomplishedwith
success.Theresultsobtainedshowcomputerefficiencyofthedevelopedalgorithmandtheapplicability
of theformulatedmodel.
Keywords :
Linear programming , Partitioning , Compound multicommodities
Journal title :
Computers and Operations Research
Journal title :
Computers and Operations Research
