Algorithm for solving the bi-level decision making problem with continuous variables in the upper level based on genetic algorithm

Based on genetic algorithms, a solution algorithm is presented for the bi-level decision making problem with continuous variables in the upper level in accordance with the bi-level decision making principle. The algorithm is compared with Monte Carlo simulated annealing algorithm, and its feasibility and effectiveness are verified with two calculating examples.

A Dynamic Programming Algorithm on Project- Gang Investment Decision Making

The investment decision making of Project Gang, the projects that are associated with one another on economy and technique, is studied. In order to find out the best Scheme that can make the maximum profit, a dynamic programming algorithm on the investment decision making of Project Gang is brought forward, and this algorithm can find out the best Scheme of distributing the m resources to the n Items in the time of O(m 2 n).

Intervention decision-making in MAV/UAV cooperative engagement based on human factors engineering

Aiming at the intervention decision-making problem in manned/unmanned aerial vehicle（MAV/UAV） cooperative engagement, this paper carries out a research on allocation strategy of emergency discretion based on human factors engineering（HFE）.Firstly, based on the brief review of research status of HFE, it gives structural description to emergency in the process of cooperative engagement and analyzes intervention of commanders. After that,constraint conditions of intervention decision-making of commanders based on HFE（IDMCBHFE） are given, and the mathematical model, which takes the overall efficiency value of handling emergencies as the objective function, is established. Then, through combining K-best and variable neighborhood search（VNS） algorithm, a K-best optimization variable neighborhood search mixed algorithm（KBOVNSMA） is designed to solve the model. Finally,through three groups of simulation experiments, effectiveness and superiority of the proposed algorithm are verified.

A New Kind of Generalized Pythagorean Fuzzy Soft Set and Its Application in Decision-Making

The aim of this paper is to introduce the concept of a generalized Pythagorean fuzzy soft set(GPFSS),which is a combination of the generalized fuzzy soft sets and Pythagorean fuzzy sets.Several of important operations of GPFSS including complement,restricted union,and extended intersection are discussed.The basic properties of GPFSS are presented.Further,an algorithm of GPFSSs is given to solve the fuzzy soft decision-making.Finally,a comparative analysis between the GPFSS approach and some existing approaches is provided to show their reliability over them.

A Multi-Criteria Decision Making for the Unrelated Parallel Machines Scheduling Problem

In this paper, we propose a multi-criteria machine-schedules decision making method that can be applied to a produc-tion environment involving several unrelated parallel machines and we will focus on three objectives: minimizing makespan, total flow time, and total number of tardy jobs. The decision making method consists of three phases. In the first phase, a mathematical model of a single machine scheduling problem, of which the objective is a weighted sum of the three objectives, is constructed. Such a model will be repeatedly solved by the CPLEX in the proposed Multi-Objective Simulated Annealing (MOSA) algorithm. In the second phase, the MOSA that integrates job clustering method, job group scheduling method, and job group – machine assignment method, is employed to obtain a set of non-dominated group schedules. During this phase, CPLEX software and the bipartite weighted matching algorithm are used repeatedly as parts of the MOSA algorithm. In the last phase, the technique of data envelopment analysis is applied to determine the most preferable schedule. A practical example is then presented in order to demonstrate the applicability of the proposed decision making method.

Application of PPC Model Based on RAGA in Real Estate Investment Decision-Making

According to the size of the projector function to evaluate the merits of the program, Projection Pursuit method is applied to real estate investment decision-making by using the real coding based on Accelerating Genetic Algorithm (RAGA) to optimize the Projection Pursuit Classification (PPC) process and a wide range of indicators value was projected linearly. The results are reasonable and verified with an example. At the same time, the subjective of the target weight can be avoided. It provides decision-makers with comprehensive information on all the indicators of new ideas and new

Image Processing Tool Promoting Decision-Making in Liver Surgery of Patients with Chronic Kidney Disease

Preoperative assessment of the liver volume and function of the remnant liver is a mandatory prerequisite before performing major hepatectomy. The aim of this work is to develop and test a software application for evaluation of the residual function of the liver prior to the intervention of the surgeons. For this purpose, a complete software platform consisting of three basic modules: liver volume segmentation, visualization, and virtual cutting, was developed and tested. Liver volume segmentation is based on a patient examination with non-contrast abdominal Computed Tomography (CT). The basis of the segmentation is a multiple seeded region growing algorithm adapted for use with CT images without contrast-enhancement. Virtual tumor resection is performed interactively by outlining the liver region on the CT images. The software application then processes the results to produce a three-dimensional (3D) image of the “resected” region. Finally, 3D rendering module provides possibility for easy and fast interpretation of the segmentation results. The visual outputs are accompanied with quantitative measures that further provide estimation of the residual liver function and based on them the surgeons could make a better decision. The developed system was tested and verified with twenty abdominal CT patient sets consisting of different numbers of tomographic images. Volumes, obtained by manual tracing of two surgeon experts, showed a mean relative difference of 4.5%. The application was used in a study that demonstrates the need and the added value of such a tool in practice and in education.

A conceptual evolutionary aseismic decision support framework for hospitals

In this paper, aconceptual evolutionary framework for aseismic decision support for hospitalsthat attempts to integrate a range of engineering and sociotechnical models is presented. Genetic algorithms are applied to find the optimal decision sets. A case study is completed to demonstrate how the frameworkmay applytoa specific hospital.The simulations show that the proposed evolutionary decision support framework is able to discover robust policy sets in either uncertain or fixed environments. The framework also qualitatively identifies some of the characteristicbehavior of the critical care organization. Thus, by utilizing the proposedframework, the decision makers are able to make more informed decisions, especially toenhance the seismic safety of the hospitals.

A UAV collaborative defense scheme driven by DDPG algorithm

The deep deterministic policy gradient(DDPG)algo-rithm is an off-policy method that combines two mainstream reinforcement learning methods based on value iteration and policy iteration.Using the DDPG algorithm,agents can explore and summarize the environment to achieve autonomous deci-sions in the continuous state space and action space.In this paper,a cooperative defense with DDPG via swarms of unmanned aerial vehicle(UAV)is developed and validated,which has shown promising practical value in the effect of defending.We solve the sparse rewards problem of reinforcement learning pair in a long-term task by building the reward function of UAV swarms and optimizing the learning process of artificial neural network based on the DDPG algorithm to reduce the vibration in the learning process.The experimental results show that the DDPG algorithm can guide the UAVs swarm to perform the defense task efficiently,meeting the requirements of a UAV swarm for non-centralization,autonomy,and promoting the intelligent development of UAVs swarm as well as the decision-making process.

An efficient and impartial online algorithm for kidney assignment network

An online algorithm balancing the efficiency and equity principles is proposed for the kidney resource assignment when only the current patient and resource information is known to the assignment network. In the algorithm, the assignment is made according to the priority, which is calculated according to the efficiency principle and the equity principle. The efficiency principle is concerned with the post-transplantation immunity spending caused by the possible post-operation immunity rejection and patient’s mental depression due to the HLA mismatch. The equity principle is concerned with three other factors, namely the treatment spending incurred starting from the day of registering with the kidney assignment network, the post-operation immunity spending and the negative effects of waiting for kidney resources on the clinical efficiency. The competitive analysis conducted through computer simulation indicates that the efficiency competitive ratio is between 6.29 and 10.43 and the equity competitive ratio is between 1.31 and 5.21, demonstrating that the online algorithm is of great significance in application.

合理字典序的构造及其在R＆D项目选择中的应用

本文讨论了合理字典序的构造及其应用问题，首先分析了构造合理字典序的假设条件，在此基础上构造了一种满足单调性假设的字典序≥￣ｌ，并对≥￣ｌ的性质进行分析和讨论，最后将≥￣ｌ应用于实际的Ｒ＆Ｄ项目选择问题。

Synergetic Optimization of Missile Shapes for Aerodynamic and Radar Cross-Section Performance Based on Multi-objective Evolutionary Algorithm

A multiple-objective evolutionary algorithm (MOEA) with a new Decision Making (DM) scheme for MOD of conceptual missile shapes was presented, which is contrived to determine suitable tradeoffs from Pareto optimal set using interactive preference articulation. There are two objective functions, to maximize ratio of lift to drag and to minimize radar cross-section (RCS) value. 3D computational electromagnetic solver was used to evaluate RCS, electromagnetic performance. 3D Navier-Stokes flow solver was adopted to evaluate aerodynamic performance. A flight mechanics solver was used to analyze the stability of the missile. Based on the MOEA, a synergetic optimization of missile shapes for aerodynamic and radar cross-section performance is completed. The results show that the proposed approach can be used in more complex optimization case of flight vehicles.

A scenario relaxation algorithm for finite scenario based robust assembly line balancing

A balancing problem for a mixed model assembly line with uncertain task processmg Ume anO daily model mixed changes is considered, and the objective is to minimize the work variances between stations in the line. For the balancing problem for the scenario-based robust assembly line with a finitely large number of potential scenarios, the direct solution methodology considering all potential scenarios is quite time-consuming. A scenario relaxation algorithm that embeds genetic al- gorithm is developed. This new algorithm guarantees termination at an optimal robust solution with relatively short running time, and makes it possible to solve robust problems with large quantities of potential scenarios. Extensive computational results are reported to show the efficiency and effectiveness of the proposed algorithm.

An Evolutionary Algorithm Coupled to an Outranking Method for the Multicriteria Shortest Paths Problem

In this article, we are interested in solving a combinatorial optimization problem, the shortest path problem in a multi-attribute graph, by the out-ranking methods. A multi-attribute graph has simultaneously qualitative and quantitative criteria. This situation gives rise to incomparable paths thus forming the Pareto front. Outranking methods in Multi-criteria Decision Making (MCDM) are the only methods that can take into account this situation (incomparability of actions). After presenting the categories of Multi-criteria Decision Making (MCDM) and the difficulties related to the problems of the shortest paths, we propose an evolutionary algorithm based on the outranking methods to solve the problem of finding “best” paths in a multi-attribute graph with non-additive criteria. Our approach is based on the exploration of induced subgraphs of the outranking graph. Properties have been established to serve as algorithmic basis. Numerical experiments have been carried out and the results presented in this article.

Generalized Algorithms of Discrete Optimization and Their Power Engineering Applications

Generalized algorithms for solving problems of discrete, integer, and Boolean programming are discussed. These algorithms are associated with the method of normalized functions and are based on a combination of formal and heuristic procedures. This allows one to obtain quasi-optimal solutions after a small number of steps, overcoming the NP-completeness of discrete optimization problems. Questions of constructing so-called “duplicate” algorithms are considered to improve the quality of discrete problem solutions. An approach to solving discrete problems with fuzzy coefficients in objective functions and constraints on the basis of modifying the generalized algorithms is considered. Questions of applying the generalized algorithms to solve multicriteria discrete problems are also discussed. The results of the paper are of a universal character and can be applied to the design, planning, operation, and control of systems and processes of different purposes. The results of the paper are already being used to solve power engineering problems.

Simulation Model Using Meta Heuristic Algorithms for Achieving Optimal Arrangement of Storage Bins in a Sawmill Yard

Bin planning (arrangements) is a key factor in the timber industry. Improper planning of the storage bins may lead to inefficient transportation of resources, which threaten the overall efficiency and thereby limit the profit margins of sawmills. To address this challenge, a simulation model has been developed. However, as numerous alternatives are available for arranging bins, simulating all possibilities will take an enormous amount of time and it is computationally infeasible. A discrete-event simulation model incorporating meta-heuristic algorithms has therefore been investigated in this study. Preliminary investigations indicate that the results achieved by GA based simulation model are promising and better than the other meta-heuristic algorithm. Further, a sensitivity analysis has been done on the GA based optimal arrangement which contributes to gaining insights and knowledge about the real system that ultimately leads to improved and enhanced efficiency in sawmill yards. It is expected that the results achieved in the work will support timber industries in making optimal decisions with respect to arrangement of storage bins in a sawmill yard.

Optimization of QoS Parameters in Cognitive Radio Using Combination of Two Crossover Methods in Genetic Algorithm

Radio Cognitive (RC) is the new concept introduced to improve spectrum utilization in wireless communication and present important research field to resolve the spectrum scarcity problem. The powerful ability of CR to change and adapt its transmit parameters according to environmental sensed parameters, makes CR as the leading technology to manage spectrum allocation and respond to QoS provisioning. In this paper, we assume that the radio environment has been sensed and that the SU specifies QoS requirements of the wireless application. We use genetic algorithm (GA) and propose crossover method called Combined Single-Heuristic Crossover. The weighted sum multi-objective approach is used to combine performance objectives functions discussed in this paper and BER approximate formula is considered.

Two-stage Multi-objective Optimization and Decision-making Method for Integrated Energy System Under Wind Generation Disturbances

Although integrated energy systems(IES)are currently modest in size,their scheduling faces strong challenges,stemming from both wind generation disturbances and the system’s complexity,including intrinsic heterogeneity and pronounced non-linearity.For this reason,a two-stage algorithm called the Multi-Objective Group Search Optimizer with Pre-Exploration(MOGSOPE)is proposed to efficiently achieve the optimal solution under wind generation disturbances.The optimizer has an embedded trainable surrogate model,Deep Neural Networks(DNNs),to explore the common features of the multiscenario search space in advance,guiding the population toward a more efficient search in each scenario.Furthermore,a multiscenario Multi-Attribute Decision Making(MADM)approach is proposed to make the final decision from all alternatives in different wind scenarios.It reflects not only the decisionmaker’s(DM)interests in other indicators of IES but also their risk preference for wind generation disturbances.A case study conducted in Barry Island shows the superior convergence and diversity of MOGSOPE in comparison to other optimization algorithms.With respect to numerical performance metrics HV,IGD,and SI,the proposed optimizer exhibits improvements of 3.1036%,4.8740%,and 4.2443%over MOGSO,and 4.2435%,6.2479%,and 52.9230%over NSGAII,respectively.What’s more,the effectiveness of the multi-scenario MADM in making final decisions under uncertainty is demonstrated,particularly in optimal scheduling of IES under wind generation disturbances.

基于改进Dijkstra算法的机场抢修决策模型研究

机场抢修决策模型是实现机场道面快速抢修的核心环节,传统的机场抢修决策模型普遍存在模型假设脱离实际、计算结果在实际中难以应用等缺点。文中将GIS技术应用于机场抢修决策,提出基于限制区域的Dijkstra改进算法的最优路径模型,在此基础上,探讨"单对单"、"多对单"和"多对多"3种模式下机场抢修决策模型的建立方法。

基于PCR-DSmT的序列帧融合景像匹配算法

针对INS/SMNS组合导航系统中,单帧景像匹配难以判断匹配结果是否正确并给出准确的匹配置信度的情况,提出一种基于PCR-DSmT的序列帧融合景像匹配算法。算法分为单帧粗匹配和序列帧融合精匹配两步:首先提取图像的相位一致性特征并采用快速归一化互相关算法初步匹配;然后建立序列帧时空约束关系,利用相关阵中极大峰构建辨识框架,采用层次分析法自适应计算置信指派并利用适配因子进行折扣运算,最后采用证据推理组合规则融合并根据判决准则输出匹配位置及置信度或对错误匹配结果报警。针对Dempster组合规则在高冲突序列帧融合时出现错误以及DSmT组合规则在多证据融合时正确位置置信指派难以增大并收敛的问题,提出一种PCR-DSmT组合规则。采用真实航拍图像和对应的Google earth卫星基准图像的仿真实验验证了匹配算法的有效性。