摘要
Adiscretedifferentialevolutionalgorithmcombinedwiththebranchandboundmethodisdevelopedtosolvetheintegerlinearbilevelprogrammingproblems,inwhichbothupperlevelandlowerlevelvariablesareforcedtobeinteger.Anintegercodingforupperlevelvariablesisadopted,andthenadiscretedifferentialevolutionalgorithmwithanimprovedfeasibility-basedcomparisonisdevelopedtodirectlyexploretheintegersolutionattheupperlevel.Foragivenupperlevelintegervariable,thelowerlevelintegerprogrammingproblemissolvedbytheexistingbranchandboundalgorithmtoobtaintheoptimalintegersolutionatthelowerlevel.Inthesameframeworkofthealgorithm,twootherconstrainthandlingmethods,i.e.thepenaltyfunctionmethodandthefeasibility-basedcomparisonmethodarealsotested.Theexperimentalresultsdemonstratethatthediscretedifferentialevolutionalgorithmwithdifferentconstrainthandlingmethodsiseffectiveinfindingtheglobaloptimalintegersolutions,buttheimprovedconstrainthandlingmethodperformsbetterthantwocomparedconstrainthandlingmethods.
出版日期
2016年04月14日（中国期刊网平台首次上网日期，不代表论文的发表时间）
