Simple Cell Mapping for Multi-Objective Bi-Level Optimization Problems

摘要：

　　Bi-level programming problems (BLPs) are a special class of optimization problems with two levels of optimization that appear e.g.in several practical problem solving tasks.BLPs are different from the common optimization problems,as they contain a nested optimization task within the constraints of another optimization problem.The nested structure of the overall problem requires that a solution to the upper level problem is feasible if and only if it is an optimal solution to the lower level problem.Here we make a first attempt to solve multi-objective BLPs (MOBLPs) numerically via simple cell mapping.

关键词： bi-level multi-objective optimization,simple cell mapping

作者: Jesús Fernández Cruz liver Schütze Jian-Qiao Sun

作者单位: Computer Science Department, CINVESTAV-IPN, Av. IPN 2508, C. P. 07360, Col.San Pedro Zacatenco, Mexi University of California Merced School of Engineering Merced, CA 95344, USA

会议类型: 国际会议

会议名称: Evolve International Conference-2014(2014年演变算法国际会议)

会议地点: 北京

会议语种:英文

页码: 1-4

在线出版日期: 2014-07-01（万方平台首次上网日期，不代表论文的发表时间）