基于集对分析与NSGA-Ⅱ的生产作业多目标优化

针对生产过程中生产作业的优化调度问题,以生产质量、效率和成本阈值为约束条件,基于集对分析建立了的生产质量—效率—成本控制的生产作业多目标优化模型;利用快速非支配排序遗传算法（NSGA-Ⅱ）求解优化模型,得到相对确定条件下质量—效率—成本控制的Pareto最优解集。决策者依据实际生产过程需要,为各项生产作业从Pareto最优解集中筛选最合理的调度方案。最后,通过算例仿真验证了结合集对分析与NSGA-Ⅱ的方法解决生产作业多目标优化问题的准确性、有效性和实用性。     

Generating Web Traffic Based on User Behavioral Model

Generating web traffic is of great importance to analyze performance of new designed network, test new equipment, and verify new protocols, etc.. However, most existing traffic generation systems tend to simulate the overall characteristics of network traffic, while neglecting of the behavior of the individual users. Nevertheless, in principle, the emerged characteristics of overall traffic originate from the aggregation of individual users＇ access behavior. In this paper, we propose an innovative web traffic generating method based on user browsing behavior. Our method simulates the real users＇ accessing behavior, and visits the real web servers. Then, we design and develop a web traffic generating system. Because our system accesses the real websites, it can produce almost the real network traffic. The test results show that the traffic generated by our system has characteristics of burstiness and self-similarity, which are widely found and characterized in many real networks. In addition, our system can better reflect real user＇s web browsing behavior.     

A multiobjective hybrid ant colony optimization approach applied to the assignment and scheduling problem

The assignment and scheduling problem is inherently multiobjective. It generally involves multiple conflicting objectives and large and highly complex search spaces. The problem allows the determination of an efficient allocation of a set of limited and shared resources to perform tasks, and an efficient arrangement scheme of a set of tasks over time, while fulfilling spatiotemporal constraints. The main objective is to minimize the project makespan as well as the total cost. Finding a good approximation set is the result of trade‐offs between diversity of solutions and convergence toward the Pareto‐optimal front. It is difficult to achieve such a balance with NP‐hard problems. In this respect, and in order to efficiently explore the search space, a hybrid bidirectional ant‐based approach is proposed in this paper, which is an improvement of a bi‐colony ant‐based approach. Its main characteristic is that it combines a solution construction developed for a more complicated problem with a Pareto‐guided local search engine.     

几种特殊矩阵的Pareto特征值问题

Pareto特征值问题是定义在正卦限上一类锥约束问题,在许多领域有着深厚的背景。将讨论Pareto特征值的一些理论性质,包括给定矩阵Pareto特征值范围及个数上界。引进了一类新矩阵,讨论并给出它的部分理论性质,可直接计算其最大Pareto特征值。     

基于满意度和GA的区间系数多目标规划求解*

在缺乏先验知识的前提下,提出了约束条件的一种满意度,按照遗传算法求解多目标问题的步骤,求出非劣解集;然后根据适应度大小选出最优解;最后算例证明了该算法的有效性和可行性。     

基于多目标优化的多源组播网络编码的构造

在基于单目标优化构造网络编码的基础上,提出了基于多目标优化的网络编码的构造方法。把多源组播网络划分成多个单源组播网络,各单源组播网络的组播容量互相制约,为了使各单源组播网络的组播容量达到最大,采用粒子群优化算法进行子图划分,动态求解包含各子图组播容量的Pareto解集。用户可以优先考虑某个子图的组播容量,选择相应的解向量进行线性网络编码构造。仿真测试结果表明,本方法是可行的。     

基于约束满足的多目标双足机器人动态步态参数优化*

目前的步态优化算法仅仅实现了对单一目标的优化,把双足机器人步态优化看做是多目标优化问题,构建了衡量稳定性、能量消耗、步行速度三个目标评价函数。考虑到直接对多个目标加权求和的方法不能很好地处理多目标问题,提出一种新的基于约束满足的多目标步态参数优化算法,其思想是把基于惩罚函数的SPEA2(strength Pareto evolutionary algorithm2 )应用到多目标双足机器人动态步态参数优化问题上,规划出了同时满足这三个目标的动态优化步态。通过仿真实验表明了算法的有效性。     

大型复杂跨流域调水工程电站-水库-泵站群多目标优化调度

考虑调水量、发电最大和耗能最小3个目标,建立电站-水库-泵站群多目标优化调度模型。基于参数调整策略、邻域变异和加速策略,提出了求解多目标优化调度模型的综合改进布谷鸟新算法并求解模型,获得了发电、调水、泵站耗能多目标Pareto解集。以引汉济渭大型复杂跨流域调水工程为实例,将该模型与模拟调度模型和NSGA-Ⅱ算法多目标优化调度模型的结果进行比较,结果表明,该优化调度模型的发电、调水、耗能、弃水等各项指标合理,具有相对优势。     

企业社会责任激励制度研究——基于新制度经济学企业理论

企业在承担社会责任时由于存在"搭便车"问题,缺乏主动承担社会责任的动力,运用新制度经济学企业理论分析了其原因。而且,为了解决这一问题,设计了一种制度以激励企业能够积极主动地承担起社会责任,同时证明了在确定性环境和不确定性环境下这种制度的纳什均衡都可以实现帕累托最优。     

A suboptimal joint bandwidth and power allocation for cooperative relay networks＂ a cooperative game theoretic approach

In commercial networks, user nodes operating on batteries are assumed to be selfish to consume their resources (i.e., bandwidth and power) solely maximizing their own benefits (e.g., the received signal-to-noise ratios (SNRs) and datarates). In this paper, a cooperative game theoretical framework is proposed to jointly perform the bandwidth and power allocation for selfish cooperative relay networks. To ensure a fair and efficient resource sharing between two selfish user nodes, we assume that either node can act as a source as well as a potential relay for each other and either node is willing to seek cooperative relaying only if the datarate achieved through cooperation is not lower than that achieved through noncooperation (i.e., direct transmission) by consuming the same amount of bandwidth and power resource. Define the cooperative strategy of a node as the number of bandwidth and power that it is willing to contribute for relaying purpose. The two node joint bandwidth and power allocation (JBPA) problem can then be formulated as a cooperative game. Since the Nash bargaining solution (NBS) to the JBPA game (JBPAG) is computationally difficult to obtain, we divide it into two subgames, i.e., the bandwidth allocation game (BAG) and the power allocation game (PAG). We prove that both the subgames have unique NBS. And then the suboptimal NBS to the JBPAG can be achieved by solving the BAG and PAG sequentially. Simulation results show that the proposed cooperative game scheme is efficient in that the performance loss of the NBS result to that of the maximal overall data-rate scheme is small while the maximal-rate scheme is unfair. The simulation results also show that the NBS result is fair in that both nodes could experience better performance than they work independently and the degree of cooperation of a node only depends on how much contribution its partner can make to improve its own performance.