Conditional Preference Networks with User's Genuine Decisions

User's choices involve habitual behavior and genuine decision. Habitual behavior is often expressed using preferences. In a multiattribute case, the Conditional Preference Network (CP-net) is a graphical model to represent user's conditional ceteris paribus (all else being equal) preference statements. Indeed, the CP-net induces a strict partial order over the outcomes. By contrast, we argue that genuine decisions are environmentally influenced and introduce the notion of “comfort” to represent this type of choices. In this article, we propose an extension of the CP-net model that we call the CP-net with Comfort (CPC-net) to represent a user's comfort with preferences. Given that preference and comfort might be two conflicting objectives, we define the Pareto optimality of outcomes when achieving outcome optimization with respect to a given CPC-net. Then, we propose a backtrack search algorithm to find the Pareto optimal outcomes. On the other hand, two outcomes can stand in one of six possible relations with respect to a CPC-net. The exact relation can be obtained by performing dominance testing in the corresponding CP-net and comparing the numeric comforts.     

ICT and cities revisited

This paper tests whether or not adoption of information and communication technologies (ICT) has offset agglomeration benefits and led to more dispersed spatial structures worldwide. The paper returns to Ioannides et al. (2008) and confirms, first by relying on the Pareto (Zipf) coefficient of the city size distribution as a proxy of spatial dispersion, that the diffusion of fixed telephony has caused more dispersed urban structures worldwide, in other words, greater urban decentralization. Similar causal effects are established for mobile telephony, which are novel, and the internet, which extend previous research. They are confirmed for such alternative measures of dispersion as the Gini coefficient, the Herfindahl index, and the coefficient of variation.     

Multi-objective optimization of shield construction parameters based on random forests and NSGA-II

Metro shield construction will inevitably cause changes in the stress and strain state of the surrounding soil, resulting in stratum deformation and surface settlement (SS), which will seriously endanger the safety of nearby buildings, roads and underground pipe networks. Therefore, in the design and construction stage, optimizing the shield construction parameters (SCP) is the key to reducing the SS rate and increasing the safe driving speed (DS). However, optimization of existing SCP are challenged by the need to construct a unified multiobjective model for optimization that are efficient, convenient, and widely applicable. This paper innovatively proposes a hybrid intelligence framework that combines random forest (RF) and non-dominant classification genetic algorithm II (NSGA-II), which overcomes the shortcomings of time-consuming and high cost for the establishment and verification of traditional prediction models. First, RF is used to rank the importance of 10 influencing factors, and the nonlinear mapping relationship between the main SCP and the two objectives is constructed as the fitness function of the NSGA-II algorithm. Second, a multiobjective optimization framework for RF-NSGA-II is established, based on which the optimal Pareto front is calculated, and reasonable optimized control ranges for the SCP are obtained. Finally, a case study in the Wuhan Rail Transit Line 6 project is examined. The results show that the SS is reduced by 12.5% and the DS is increased by 2.5% with the proposed framework. Meanwhile, the prediction results are compared with the back-propagation neural network (BPNN), support vector machine (SVM), and gradient boosting decision tree (GBDT). The findings indicate that the RF-NSGA-II framework can not only meet the requirements of SS and DS calculation, but also used as a support tool for real-time optimization and control of SCP.     

岩体随机不连续面产状数据划分方法研究

动态聚类算法从本质上讲是单目标组合优化算法,一般需要事先给定目标分类数和初始聚类中心,且初始聚类中心的选择对数据划分结果影响较大。为了解决该问题,提出将产状数据的划分问题转化为多目标优化问题,并采用小生境Pareto遗传算法进行求解。针对聚类问题的特殊性,采用基于链表的编码方案,并建议相应的遗传操作算子;通过引入小生境技术和Pareto支配集理论,仅通过一次求解可由Pareto支配集给出对应于不同目标组数的最优分组结果,而且不用事先给定目标组数以及初始聚类中心。最后,将算法应用于三峡船闸高边坡岩体实测不连续面产状数据的划分,得到较为符合实际的优势结构面分组。     

基于小生境粒子群算法的公差多目标优化设计

为解决产品设计中的公差优化问题,提出一种基于小生境粒子群算法的公差多目标优化方法。以加工成本、质量损失成本和公差敏感性为优化目标,以装配功能要求和加工能力为约束条件,建立了公差多目标优化模型。对标准粒子群算法进行改进,根据小生境数和Pareto优劣性确定孤立粒子,并通过个体历史最优粒子与孤立粒子的变异、选择操作更新粒子的个体历史最优位置;利用Pareto支配数排序更新粒子群的全局最优位置。利用改进的粒子群算法对公差多目标优化模型进行求解,得到分布均匀的Pareto前沿。设计并开发了原型系统,通过实例验证了该方法的有效性。     

JADE平台粒子群算法在环境经济调度中的应用

在环境经济调度模型中,为同时降低火电机组的燃料成本和污染气体排放量进行多目标优化,模型引入阀点效应并考虑网损,在满足功率平衡和出力限制的前提下,采用一种基于JADE平台下的粒子群多目标优化算法对模型进行求解。算法吸收了粒子群算法的进化机制,将Pareto占优策略和拥挤距离相结合并应用在粒子群算法中,添加了动态惯性权重特性和小概率变异,提高了算法全局搜索能力。在JADE平台下搭建算法模型,并运用IEEE-30节点6机组和IEEE-118节点40机组的标准测试系统进行仿真,结果表明该算法提高了系统的计算速度,改进了算法的并行性,更适合求解大规模复杂系统。     

Multi-objective Phasor Measurement Unit Placement in Electric Power Networks: Integer Linear Programming Formulation

A multi-objective optimal phasor measurement unit placement model using integer linear programming is presented in this article. The proposed model simultaneously optimizes two objectives, i.e., minimization of phasor measurement unit numbers and maximization of measurement redundancy. To calculate the redundancy criteria, the single-line outage and the phasor measurement unit loss are considered simultaneously. A linear formulation is presented for both objective functions. Also herein, to address conflicting attributes and identify Pareto optimal solutions of the multi-objective optimal phasor measurement unit placement problem, a new multi-objective mathematical programming method is proposed. Finally, a new index, i.e., minimum distance to utopia point, is implemented to select the most preferred solution among the available Pareto front based options on the goal to achieve judicious decision makers. Two test systems, i.e., a modified 9-bus and an IEEE 118-bus test systems, are used to illustrate the effectiveness of the proposed framework.     

Kriging Surrogate Based Multi-objective Optimization of Bulk Vinyl Acetate Polymerization with Branching

Despite the established superiority in finding the global as well as well-spread Pareto optimal (PO) points, the need of more numbers of function evaluations for population based evolutionary optimization techniques leads to a computationally demanding proposal. The case becomes more miserable if the function evaluations are carried out using a first principle based computationally expensive model, making the proposal not fit for online usage of the application. In this work, a Kriging based surrogate model has been proposed to replace a computationally expensive model to save execution time while performing an optimization task. A multi-objective optimization study has been carried out for the bulk vinyl acetate polymerization with long-chain branching using these surrogate as well as expensive models and Kriging PO solutions similar to those found by the first principle models are obtained with a close to 85% savings in function evaluations.     

基于多目标决策方法的反应离子刻蚀机约束环优化设计研究

从反应离子刻蚀设备腔室内部结构细节角度出发,研究腔室约束环对以450 mm为代表大晶圆尺寸刻蚀机流场影响。与同类研究相比,本文旨在突出研讨仿真模型的精确性与边界条件比较设置准则的重要性。本文首先介绍刻蚀机腔室约束环的结构及其功能并提出高精度粘度修正的实现方法并计算腔室流体气压分布。提出了腔室气压分布的多目标问题,采用遗传算法求解,并通过多目标决策对优化结果进行评价和排序,得到最适合的优化结果。最后,给出约束环设计结果并得出约束环可以优化腔室内气流分布轮廓的结论。     

Network morphospace

The structure of complex networks has attracted much attention in recent years. It has been noted that many real-world examples of networked systems share a set of common architectural features. This raises important questions about their origin, for example whether such network attributes reflect common design principles or constraints imposed by selectional forces that have shaped the evolution of network topology. Is it possible to place the many patterns and forms of complex networks into a common space that reveals their relations, and what are the main rules and driving forces that determine which positions in such a space are occupied by systems that have actually evolved? We suggest that these questions can be addressed by combining concepts from two currently relatively unconnected fields. One is theoretical morphology, which has conceptualized the relations between morphological traits defined by mathematical models of biological form. The second is network science, which provides numerous quantitative tools to measure and classify different patterns of local and global network architecture across disparate types of systems. Here, we explore a new theoretical concept that lies at the intersection between both fields, the ‘network morphospace’. Defined by axes that represent specific network traits, each point within such a space represents a location occupied by networks that share a set of common ‘morphological’ characteristics related to aspects of their connectivity. Mapping a network morphospace reveals the extent to which the space is filled by existing networks, thus allowing a distinction between actual and impossible designs and highlighting the generative potential of rules and constraints that pervade the evolution of complex systems.