期刊文献+
共找到3篇文章
< 1 >
每页显示 20 50 100
Robust Assignment of Airport Gates with Operational Safety Constraints 被引量:8
1
作者 Shuo Liu Wen-Hua Chen Jiyin Liu 《International Journal of Automation and computing》 EI CSCD 2016年第1期31-41,共11页
This paper reviews existing approaches to the airport gate assignment problem (AGAP) and presents an optimization model for the problem considering operational safety constraints. The main objective is to minimize t... This paper reviews existing approaches to the airport gate assignment problem (AGAP) and presents an optimization model for the problem considering operational safety constraints. The main objective is to minimize the dispersion of gate idle time periods (to get robust optimization) while ensuring appropriate matching between the size of each aircraft and its assigned gate type and avoiding the potential hazard caused by gate apron operational conflict. Genetic algorithm is adopted to solve the problem, An illustrative example is given to show the effectiveness and efficiency of the algorithm. The algorithm performance is further demonstrated using data of a terminal from Beijing Capital International Airport (PEK). 展开更多
关键词 Gate assignment problem operational safety constraints robust optimization conflict avoidance genetic algorithm.
原文传递
Optimality Condition for Infinite-dimensional Programming Problem with Operator and Bound Constraints
2
作者 李春发 冯恩民 《Journal of Mathematical Research and Exposition》 CSCD 北大核心 2004年第2期257-266,共10页
A first-order necessary condition for an infinite-dimensional nonlinear op-timization problem, which arises when the all-at-once method is employed to slove theoptimal control problems, is formulated and analyzed. Ope... A first-order necessary condition for an infinite-dimensional nonlinear op-timization problem, which arises when the all-at-once method is employed to slove theoptimal control problems, is formulated and analyzed. Operator constraint and simplebound on part of the variables are both considered. Based on this optimality condition,the trust-region subproblems are built, then the trust region method rnay be employedto deal with the optimizatiou problem in infinite-dimensional space. 展开更多
关键词 optimal control operator constraint trust-region method
下载PDF
THE OPTIMALITY CONDITIONS OF D-PSEUDOCONVEX PROGRAMMING WITH OPERATOR CONSTRAINTS
3
作者 ZHANG Huaxiao JIN Yuefeng HE Lunzhi 《Systems Science and Mathematical Sciences》 SCIE EI CSCD 1992年第2期111-120,共10页
The problem of D-pseudoconvex programming with operator con-straints is discussed in this paper.Some new optimality conditions are presentedand an error made by V.Barbu in [4] is pointed out.
关键词 D-pseudoconvex programming operator constraints
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部