学科分类
/ 1
2 个结果
  • 简介:Thispaperaimsatprovidinganuncertainbilevelknapsackproblem(UBKP)model,whichisatypeofBKPsinvolvinguncertainvariables.AndthenanuncertainsolutionfortheUBKPisproposedbydefiningPENashequilibriumandPEStackelbergNashequilibrium.Inordertoimprovethecomputationalefficiencyoftheuncertainsolution,severaloperators(binarycodingdistance,inversionoperator,explosionoperatorandbinarybacklearningoperator)areappliedtothebasicfireworksalgorithmtodesignthebinarybackwardfireworksalgorithm(BBFWA),whichhasagoodperformanceinsolvingtheBKP.Asanillustration,acasestudyoftheUBKPmodelandthePEuncertainsolutionisappliedtoanarmamentstransportationproblem.

  • 标签: uncertainty bilevel PROGRAMMING KNAPSACK problem BINARY
  • 简介:Adiscretedifferentialevolutionalgorithmcombinedwiththebranchandboundmethodisdevelopedtosolvetheintegerlinearbilevelprogrammingproblems,inwhichbothupperlevelandlowerlevelvariablesareforcedtobeinteger.Anintegercodingforupperlevelvariablesisadopted,andthenadiscretedifferentialevolutionalgorithmwithanimprovedfeasibility-basedcomparisonisdevelopedtodirectlyexploretheintegersolutionattheupperlevel.Foragivenupperlevelintegervariable,thelowerlevelintegerprogrammingproblemissolvedbytheexistingbranchandboundalgorithmtoobtaintheoptimalintegersolutionatthelowerlevel.Inthesameframeworkofthealgorithm,twootherconstrainthandlingmethods,i.e.thepenaltyfunctionmethodandthefeasibility-basedcomparisonmethodarealsotested.Theexperimentalresultsdemonstratethatthediscretedifferentialevolutionalgorithmwithdifferentconstrainthandlingmethodsiseffectiveinfindingtheglobaloptimalintegersolutions,buttheimprovedconstrainthandlingmethodperformsbetterthantwocomparedconstrainthandlingmethods.

  • 标签: 差分进化算法 整数编码 规划问题 离散 线性 约束处理