简介:Inthispaper,weproposeanewartificialantalgorithmforsolvingconstrainedoptimizationproblemsingeneralcase.Numericalexamplesshowthatitiseffectiveandrobust.
简介:Abriefsummaryonandcomprehensiveunderstandingoffuzzyoptimizationispresented.Thissummaryismadeonaspectsoffuzzymodellingandfuzzyoptimization,classificationandformulationforthefuzzyoptimizationproblems,modelsandmethods.Theimportanceofinterpretationoftheproblemandformulationoftheoptimalsolutioninfuzzysenseareemphasizedinthesummaryofthefuzzyoptimization.
简介:Onthebasisofroughsettheory,thestrengthsofdynamicreductionareelaboratedcomparedwithtraditionalnon-dynamicmethods.Asystematicconceptofdynamicreductionfromsamplingprocesstothegenerationofthereductsetispresented.Anewmethodofsamplingiscreatedtoavoidthedefectsofbeingtoosubjective.Andinordertodealwiththeover-sizedtimeconsumingproblemintraditionaldynamicreductionprocess,aquickalgorithmisproposedwithintheconstraintconditions.Wehavealsoprovedthatdynamiccorepossessestheessentialcharacteristicsofareductioncoreonthebasisoftheformalizeddefinitionofthemulti-layereddynamiccore.
简介:ThedesignofanOLAPsystemforsupportingreal-timequeriesisoneofthemajorresearchissues.Oneapproachistousedatacubes,whicharepre-computedmultidimensionalviewsofdatainthedatawarehouse.Aninitialsetofdatacubescanbederived.fromwhichtheanswertoeachfrequentlyaskedquerycanberetrieveddirectly.However,therearetwopracticalproblemsconcerningthedesignofacubebasedsystem:1)themaintenancecostofthedatacubes,and2)thequerycosttoansweraselectedsetoffrequentlyaskedqueries.MaintainingadatacuberequiresdiskstorageandCPUcomputation,Sothemaintenancecostisrelatedtothetotalsizeofthedatacubesmaterialized,andthuskeepingalldatacubesisimpractical.Thetotalsizeofcubesmaybereducedbymergingsomecubes.However,theresultinglargercubeswillincreasethequerycostofansweringsomequeries.Iftheboundsonmaintenancecostandquerycostarestrict.someofthequeriesneedtobesacrificed.Anoptimizationproblemindatacubesystemdesignhasbeendefined.Withamaintenance-costboundandaquery-costboundgivenbytheuser,itisnecessarytoopti-mizetheinitialsetofdatacubessuchthatthesystemcanansweramaximumnumberofqueriesandsatisfythebounds.ThisisanNP-completeproblem.ApproximatealgorithmsGreedyRemoving(GR)and2-GreedyMergingwithMultiplepaths(2GGM)areproposed.Experimentshavebeendoneonacensusdatabaseandtheresultsshowthatourapproachinbotheffbctiveandefficient.
简介:Inthispaper,atrustregionmethodforequalityconstrainedoptlmizationbasedonnondiferentiableexactpenaltyisproposed.Inthisalgorithin,thetrailstepischaracterizedbycomputationofitsnormalcomponentbeingseparatedfromcomputationofitstangentialcomponent,i.e.,onlythetangentialcomponentofthetrailstepisconstrainedbytrustradiuswhilethenormalcomponentandtrailstepitselfhavenoconstraints.Theothermaincharacteristicofthealgorithmisthedecisionoftrustregionradius.Here,thedecisionoftrustregionradiususestheinformationofthegradientofobjectivefunctionandreducedHessian.However,Maratoseffectwilloccurwhenweusethenondifferentiableexactpenaltyfunctionasthemeritfunction.Inordertoobtainthesuperlinearconvergenceofthealgorithm,weusethetwiceordercorrectiontechnique.Becauseofthespecialityoftheadaptivetrustregionmethod,weusetwiceordercorrectionwhenp=0(thedefinitionisasinSection2)andthisisdifferentfromthetraditionaltrustregionmethodsforequalityconstrainedopthnization.Sothecomputationofthealgorithminthispaperisreduced.Whatismore,wecanprovethatthealgorithmisgloballyandsuperlinearlyconvergent.
简介:BasedondifferentequationofCobb-Douglasproductionfunction,themodelofregulatingregionaleconomyonthemultiobjectiveoptimizationofefficiencyandequityissetup,withthespatialdistributionstrategyofcapitalandlabourforceasthecontrollingvariable.Twobasicconclusionsdrawnfromthemodelarestrictlydemonstrated:①Acountry'seconomicdevelopmentisdecidedbytheconsistencybetweentheregionaldistributivestrategyofincrementinvestmentandtheregionaldifferenceinmarginalinvestmentrevenue.②Thecoupletargetsofefficiencyandequityarestrictlyinconflictwitheachother,ifandonlyifthemarginalinvestmentrevenueinthedevelopedregionsishigherthanintheundeveloped,otherwisethetargetsareconsistent.
简介:这份报纸处理当模特儿,分析和优化真实工业问题的一种特定的类型。问题的这个班作为周期在文学被知道升起安排问题(CHSP)。在问题的如此的班上,几个工作不得不根据一个订的洗澡序列通过一根生产线流动。CHSP在生产设备出现完成大量生产并且在行动的一个重复序列找hoist。在这份报纸,我们开发P时间的Petri网模型代表行为并且验证基本生产线的某些质的性质。后来,生产线的复杂配置被建模并且他们的性质象工作需要的reachability(周期的操作)那样,没有僵局,资源分享和管理被检查并且验证。数学分析和所有建议Petri网络模型的模拟研究用Petri网络和一个视觉对象网络++工具的数学臀部被执行。纸的第二部分处理线性编程建模优化每种线配置处理的一个混合整数的发展。有周期的处理序列的学习系统的最佳的生产计划被定义,每种配置的最佳的周期的安排的可行性被证明。
简介:1.IntroductionLetXbeavectorspace,Ybeatopologicalvectorspace,Zbealocallyconvexspace,andletthetopologicaldualspacesofYandZbedenotedbyY*andZ*,respectively.LetCbeapointedconvexconeinYandKbeaclosedconvexpointedconeinZ.ThedualconesofCandKaredefinedasrespec...
简介:Inthepalletpoolsystem,thedifferentiationofpalletizedfreightvolumesindifferentregionsandseasonaltransportofcertaingoodsleadtotheimbalanceofpalletsdistributionamongregions.Itisnecessarytoimprovetheutilizationofpalletsthroughdispatching.Thepaperanalyzesthefactorswhichaffectemptypalletsdispatching,itincludescarbonemission,transportationtimeandpallettypebasedonthepalletpoolmodeofenterprisealliance.Onthisbasis,theoptimizationmodelisestablishedwiththegoalofminimumtotaldispatchingcost.Then,accordingtothedifferentinfluencesofrailwayandhighwayintransportationcost,thedispatchingschemeisanalyzedandthetransportationmodeofemptypalletsdispatchingisdetermined.Consideringthecharacteristicsofmodel,Cplexisusedtosolveit.Finally,acaseisusedtoverifythefeasibilityandsuperiorityofreasonableemptypalletsdispatchingindifferenttransportationmodes,andthetransportcharacteristicsoftwotransportationmodesareanalyzed.Moreover,thecostsofpalletsleasinganddispatchingarecompared.