An efficient approach for the S‐shaped penalty function

Interval goal programming (IGP) with a marginal penalty function (PF) was first proposed by Charnes and Collomb in 1972, and further improved by Kvanli and other researchers. Recently, Lu and Chen proposed an efficient logarithmic method to formulate IGP with an S‐shaped PF. However, their method requires adding many binary variables when the problem size becomes large, which increases the computational burden in the solution process. This study proposes an efficient approach for the S‐shaped PF. The arbitrary PF frequently appears in the fields of business and industry. However, none of the previous approaches have addressed arbitrary PFs without adding binary variables. The proposed approach can be easily extended to formulate an arbitrary PF in which binary variables are no longer required, regardless of the number of break points. The proposed method can improve the efficiency of IGP for solving large size management and decision problems in considering PFs. In order to demonstrate the correctness, usefulness of the proposed model, illustrative examples are provided.     

Ant colony approaches for multiobjective structural optimization problems with a cardinality constraint

Two Ant Colony Optimization algorithms are proposed to tackle multiobjective structural optimization problems with an additional constraint. A cardinality constraint is introduced in order to limit the number of distinct values of the design variables appearing in any candidate solution. Such constraint is directly enforced when an ant builds a candidate solution, while the other mechanical constraints are handled by means of an adaptive penalty method (APM). The test-problems are composed by structural optimization problems with discrete design variables, and the objectives are to minimize both the structure’s weight and its maximum nodal displacement. The Pareto sets generated in the computational experiments are evaluated by means of performance metrics, and the obtained designs are also compared with solutions available from single-objective studies in the literature.     

带延迟索赔和随机收入的离散风险模型的Gerber-Shiu分析（英）

破产理论是保险数学中的重要问题，它可以为保险公司决策者提供一个非常有用的早期风险预警手段．本文研究了一个带潜在延迟索赔和随机保费收入的复合二项风险模型．利用矩母函数的技巧，得到了 Gerber-Shiu 期望折罚函数的递推公式．特别地，还得到了贴现因子为 1 的特殊情形下的 Gerber-Shiu 期望折罚函数的解析表达式．最后还得到了实际应用中的一些重要的破产特征量，包括破产概率，破产时赤字的密度函数，破产前盈余与破产时赤字的联合密度函数，以及导致破产的索赔密度函数等．     

正确行使煤矿安全监察行政处罚权

本文论述了煤矿安全监察机构在行使行政处罚权时应遵循的原则、程序以及行政处罚的种类、适用范围.     

一种增广拉格朗日优化方案及其非连续变形分析实现

接触力计算精度是关乎非连续变形分析结果有效性的关键因素之一。经典非连续变形分析法(DDA)采用罚法施加块体间的接触约束,实现简单,但合理的罚值选取困难。因此,提出了一种增广拉格朗日优化算法,改进DDA中接触约束的处理。通过结合开闭迭代算法和自适应罚值更新方案等,提出并实现了多面体DDA增广拉格朗日算法及其优化方案。最后,设计了2个经典数值算例,计算结果表明:改进后的三维DDA提高了计算精度且保证了计算效率,可用于复杂多面体块体系统的非连续力学行为分析,如大型节理岩体工程稳定性分析。     

基于区块链技术的电力行业碳减排奖惩及碳交易匹配模型

电力行业作为中国优先纳入碳交易体系的行业,已成为实现碳减排的重要主体。区块链作为一种新兴的分布式账本技术能够有效解决碳交易体系中的数据安全、运行效率等问题。基于区块链技术,文中在构建电力行业碳交易体系整体框架的基础上,构建了碳配额成本决策模型、碳减排奖惩模型和碳交易匹配模型,并引入减排努力值指标,作为上述3个模型子系统的流程推进与联系桥梁,以实现安全、高效的碳交易。通过算例分析验证了该碳交易体系的有效性,并给出仿真设计,说明采用区块链组织碳交易体系能够节约成本、提高效率、增加效益。     

计及UPFC的电力系统多阶段多目标无功优化算法

统一潮流控制器(UPFC)并联侧连续的无功调节能力为电力系统无功优化提供了新的控制手段。基于此,首先建立适用于新型UPFC拓扑的UPFC稳态模型;然后考虑无功设备动作次数的约束,明确多目标无功优化问题的目标函数和约束条件,建立计及UPFC的多目标无功优化模型;接着,提出一种多阶段方法对其进行求解,其中,第一阶段将原问题进行松弛并采取归一化的方法统一多个目标的量纲,第二阶段基于规格化平面约束法获取松弛问题的Pareto最优候选解集,并给出折衷解的选取方法,第三阶段基于三角罚函数法对折衷解中的整数变量进行归整,获取原问题的最优折衷整数解。最后,对南京西环网实际等值系统进行算例测试,验证了算法的有效性及UPFC在无功优化问题中的应用前景。     

基于粒子群TOA室内定位的系统误差修正

到达时间（time of arrival,TOA）的测距易受多径干扰的影响而产生较大的系统误差,造成室内定位时精度变差。针对上述问题,首先分析了TOA定位中系统误差的产生及特点,而后提出一种基于粒子群优化的定位算法。算法利用测距值与所求解位置的空间约束关系建立求解域,而后应用粒子群算法求解,并通过建立关于系统误差的罚函数和适应度函数实现误差修正,并减小粒子搜索空间,加快算法收敛速度。实验表明,利用本文描述的定位算法,可以有效抑制室内定位中测距产生的系统误差,定位精度得到明显提高。