scholarly journals A Distributed Algorithm for Large-Scale Linearly Coupled Resource Allocation Problems with Selfish Agents

2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Dian Yu ◽  
Tongyao Wang
Keyword(s):  
Distributed Algorithm ◽  
Large Scale ◽  
Pareto Front ◽  
Optimization Problem ◽  
Computational Cost ◽  
Descent Method ◽  
Resource Optimization ◽  
Linearly Constrained ◽  
Objective Value ◽  
Selfish Agents

A decentralized randomized coordinate descent method is proposed to solve a large-scale linearly constrained, separable resource optimization problem with selfish agent. This method has a cheap computational cost and can guarantee an improvement of selected objective function without jeopardizing the others in each iteration. The convergence rate is obtained using an alternative gap benchmark of objective value. Numerical simulations suggest that the algorithm will converge to a random point on the Pareto front.

scholarly journals Sensor Selection for Decentralized Large-Scale Multi-Target Tracking Network

Sensors ◽  
2018 ◽  
Vol 18 (12) ◽  
pp. 4115 ◽  
Author(s):  
Feng Lian ◽  
Liming Hou ◽  
Bo Wei ◽  
Chongzhao Han
Keyword(s):  
Target Tracking ◽  
Large Scale ◽  
Sequential Monte Carlo ◽  
Signal To Noise Ratio ◽  
Computational Cost ◽  
Gaussian Mixture ◽  
Descent Method ◽  
Sensor Selection ◽  
Multi Target Tracking ◽  
Finite Set

A new optimization algorithm of sensor selection is proposed in this paper for decentralized large-scale multi-target tracking (MTT) network within a labeled random finite set (RFS) framework. The method is performed based on a marginalized δ-generalized labeled multi-Bernoulli RFS. The rule of weighted Kullback-Leibler average (KLA) is used to fuse local multi-target densities. A new metric, named as the label assignment (LA) metric, is proposed to measure the distance for two labeled sets. The lower bound of LA metric based mean square error between the labeled multi-target state set and its estimate is taken as the optimized objective function of sensor selection. The proposed bound is obtained by the information inequality to RFS measurement. Then, we present the sequential Monte Carlo and Gaussian mixture implementations for the bound. Another advantage of the bound is that it provides a basis for setting the weights of KLA. The coordinate descent method is proposed to compromise the computational cost of sensor selection and the accuracy of MTT. Simulations verify the effectiveness of our method under different signal-to- noise ratio scenarios.

Improved NSGAII with a New Distribution and its Application in Multi-Objective Reservoir Operation

2011 ◽  
Vol 90-93 ◽  
pp. 2734-2739
Author(s):  
Ruan Yun ◽  
Cui Song Yu
Keyword(s):  
Genetic Algorithms ◽  
Control Strategy ◽  
Reservoir Operation ◽  
Large Scale ◽  
Pareto Front ◽  
Optimization Problem ◽  
Shape Parameter ◽  
Multi Objective Optimization ◽  
Multi Objective ◽  
New Distribution

Non-dominated sorting genetic algorithms II (NSGAII) has been widely used for multi- objective optimizations. To overcome its premature shortcoming, an improved NSGAII with a new distribution was proposed in this paper. Comparative to NSGAII, improved NSGAII uses an elitist control strategy to protect its lateral diversity among current non-dominated fronts. To implement elitist control strategy, a new distribution (called dogmatic distribution) was proposed. For ordinary multi-objective optimization problem (MOP), an ordinary exploration ability of improved NSGAII should be maintained by using a larger shape parameter r; while for larger-scale complex MOP, a larger exploration ability of improved NSGAII should be maintained by using a less shape parameter r. The application of improved NSGAII in multi-objective operation of Wohu reservoir shows that improved NSGAII has advantages over NSGAII to get better Pareto front especially for large-scale complex multi-objective reservoir operation problems.

scholarly journals A modification of steepest descent method for solving large-scaled unconstrained optimization problems

2018 ◽  
Vol 7 (3.28) ◽  
pp. 72
Author(s):  
Siti Farhana Husin ◽  
Mustafa Mamat ◽  
Mohd Asrul Hery Ibrahim ◽  
Mohd Rivaie
Keyword(s):  
Unconstrained Optimization ◽  
Large Scale ◽  
Optimization Problem ◽  
Optimization Problems ◽  
Descent Method ◽  
Steepest Descent ◽  
Steepest Descent Method ◽  
Search Direction ◽  
Exact Line Search ◽  
Scale Optimization

In this paper, we develop a new search direction for Steepest Descent (SD) method by replacing previous search direction from Conjugate Gradient (CG) method, , with gradient from the previous step,  for solving large-scale optimization problem. We also used one of the conjugate coefficient as a coefficient for matrix . Under some reasonable assumptions, we prove that the proposed method with exact line search satisfies descent property and possesses the globally convergent. Further, the numerical results on some unconstrained optimization problem show that the proposed algorithm is promising. 

scholarly journals Multicompare Tests of the Performance of Different Metaheuristics in EEG Dipole Source Localization

2014 ◽  
Vol 2014 ◽  
pp. 1-9
Author(s):  
Diana Irazú Escalona-Vargas ◽  
Ivan Lopez-Arevalo ◽  
David Gutiérrez
Keyword(s):  
Source Localization ◽  
Large Scale ◽  
Optimization Problem ◽  
Statistical Tests ◽  
Computational Cost ◽  
Fixed Number ◽  
Dipole Source ◽  
Operational Parameters ◽  
Metaheuristic Methods ◽  
Eeg Source Localization

We study the use of nonparametric multicompare statistical tests on the performance of simulated annealing (SA), genetic algorithm (GA), particle swarm optimization (PSO), and differential evolution (DE), when used for electroencephalographic (EEG) source localization. Such task can be posed as an optimization problem for which the referred metaheuristic methods are well suited. Hence, we evaluate the localization’s performance in terms of metaheuristics’ operational parameters and for a fixed number of evaluations of the objective function. In this way, we are able to link the efficiency of the metaheuristics with a common measure of computational cost. Our results did not show significant differences in the metaheuristics’ performance for the case of single source localization. In case of localizing two correlated sources, we found that PSO (ring and tree topologies) and DE performed the worst, then they should not be considered in large-scale EEG source localization problems. Overall, the multicompare tests allowed to demonstrate the little effect that the selection of a particular metaheuristic and the variations in their operational parameters have in this optimization problem.

An Efficient Framework Using Normalized Dominance Operator for Multi-Objective Evolutionary Algorithms

2019 ◽  
Vol 10 (1) ◽  
pp. 15-37 ◽  
Author(s):  
Muneendra Ojha ◽  
Krishna Pratap Singh ◽  
Pavan Chakraborty ◽  
Shekhar Verma
Keyword(s):  
Evolutionary Algorithms ◽  
Pareto Front ◽  
Optimization Problem ◽  
Computational Cost ◽  
Optimization Methods ◽  
Objective Test ◽  
Test Problems ◽  
Multi Objective Optimization ◽  
Pareto Dominance ◽  
Multi Objective

Multi-objective optimization algorithms using evolutionary optimization methods have shown strength in solving various problems using several techniques for producing uniformly distributed set of solutions. In this article, a framework is presented to solve the multi-objective optimization problem which implements a novel normalized dominance operator (ND) with the Pareto dominance concept. The proposed method has a lesser computational cost as compared to crowding-distance-based algorithms and better convergence. A parallel external elitist archive is used which enhances spread of solutions across the Pareto front. The proposed algorithm is applied to a number of benchmark multi-objective test problems with up to 10 objectives and compared with widely accepted aggregation-based techniques. Experiments produce a consistently good performance when applied to different recombination operators. Results have further been compared with other established methods to prove effective convergence and scalability.

scholarly journals A Distributed Quantum-Behaved Particle Swarm Optimization Using Opposition-Based Learning on Spark for Large-Scale Optimization Problem

Mathematics ◽  
2020 ◽  
Vol 8 (11) ◽  
pp. 1860
Author(s):  
Zhaojuan Zhang ◽  
Wanliang Wang ◽  
Gaofeng Pan
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Algorithm ◽  
Large Scale ◽  
Optimization Problem ◽  
Computational Cost ◽  
Particle Swarm ◽  
Large Scale Optimization ◽  
Swarm Optimization ◽  
Opposition Based Learning ◽  
Scale Optimization

In the era of big data, the size and complexity of the data are increasing especially for those stored in remote locations, and whose difficulty is further increased by the ongoing rapid accumulation of data scale. Real-world optimization problems present new challenges to traditional intelligent optimization algorithms since the traditional serial optimization algorithm has a high computational cost or even cannot deal with it when faced with large-scale distributed data. Responding to these challenges, a distributed cooperative evolutionary algorithm framework using Spark (SDCEA) is first proposed. The SDCEA can be applied to address the challenge due to insufficient computing resources. Second, a distributed quantum-behaved particle swarm optimization algorithm (SDQPSO) based on the SDCEA is proposed, where the opposition-based learning scheme is incorporated to initialize the population, and a parallel search is conducted on distributed spaces. Finally, the performance of the proposed SDQPSO is tested. In comparison with SPSO, SCLPSO, and SALCPSO, SDQPSO can not only improve the search efficiency but also search for a better optimum with almost the same computational cost for the large-scale distributed optimization problem. In conclusion, the proposed SDQPSO based on the SDCEA framework has high scalability, which can be applied to solve the large-scale optimization problem.

Parameter study and optimization design of a hat oblique tunnel portal

2021 ◽  
pp. 095440972110140
Author(s):  
Zijian Guo ◽  
Tanghong Liu ◽  
Wenhui Li ◽  
Yutao Xia
Keyword(s):  
High Speed ◽  
Optimization Design ◽  
Pareto Front ◽  
Optimization Problem ◽  
Optimization Method ◽  
Design Parameters ◽  
Parameter Study ◽  
Buffer Structure ◽  
Tunnel Entrance ◽  
The Ideal

The present work focuses on the aerodynamic problems resulting from a high-speed train (HST) passing through a tunnel. Numerical simulations were employed to obtain the numerical results, and they were verified by a moving-model test. Two responses, [Formula: see text] (coefficient of the peak-to-peak pressure of a single fluctuation) and[Formula: see text] (pressure value of micro-pressure wave), were studied with regard to the three building parameters of the portal-hat buffer structure of the tunnel entrance and exit. The MOPSO (multi-objective particle swarm optimization) method was employed to solve the optimization problem in order to find the minimum [Formula: see text] and[Formula: see text]. Results showed that the effects of the three design parameters on [Formula: see text] were not monotonous, and the influences of[Formula: see text] (the oblique angle of the portal) and [Formula: see text] (the height of the hat structure) were more significant than that of[Formula: see text] (the angle between the vertical line of the portal and the hat). Monotonically decreasing responses were found in [Formula: see text] for [Formula: see text] and[Formula: see text]. The Pareto front of [Formula: see text] and[Formula: see text]was obtained. The ideal single-objective optimums for each response located at the ends of the Pareto front had values of 1.0560 for [Formula: see text] and 101.8 Pa for[Formula: see text].

scholarly journals Renormalization group theory of molecular dynamics

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Daiji Ichishima ◽  
Yuya Matsumura
Keyword(s):  
Molecular Dynamics ◽  
Renormalization Group ◽  
Critical Exponent ◽  
Computational Efficiency ◽  
Large Scale ◽  
Dissipative Particle Dynamics ◽  
Computational Cost ◽  
Coarse Graining ◽  
Spatial Dimension ◽  
Deborah Number

AbstractLarge scale computation by molecular dynamics (MD) method is often challenging or even impractical due to its computational cost, in spite of its wide applications in a variety of fields. Although the recent advancement in parallel computing and introduction of coarse-graining methods have enabled large scale calculations, macroscopic analyses are still not realizable. Here, we present renormalized molecular dynamics (RMD), a renormalization group of MD in thermal equilibrium derived by using the Migdal–Kadanoff approximation. The RMD method improves the computational efficiency drastically while retaining the advantage of MD. The computational efficiency is improved by a factor of $$2^{n(D+1)}$$ 2 n ( D + 1 ) over conventional MD where D is the spatial dimension and n is the number of applied renormalization transforms. We verify RMD by conducting two simulations; melting of an aluminum slab and collision of aluminum spheres. Both problems show that the expectation values of physical quantities are in good agreement after the renormalization, whereas the consumption time is reduced as expected. To observe behavior of RMD near the critical point, the critical exponent of the Lennard-Jones potential is extracted by calculating specific heat on the mesoscale. The critical exponent is obtained as $$\nu =0.63\pm 0.01$$ ν = 0.63 ± 0.01 . In addition, the renormalization group of dissipative particle dynamics (DPD) is derived. Renormalized DPD is equivalent to RMD in isothermal systems under the condition such that Deborah number $$De\ll 1$$ D e ≪ 1 .

scholarly journals An Analytical Study in Multi-physics and Multi-criteria Shape Optimization

2021 ◽  
Author(s):  
Hanno Gottschalk ◽  
Marco Reese
Keyword(s):  
Shape Optimization ◽  
Physical System ◽  
Pareto Front ◽  
Optimization Problem ◽  
Analytical Study ◽  
Static Pressure ◽  
Hausdorff Metric ◽  
Objective Functions ◽  
Hölder Continuous ◽  
Turbine Vane

AbstractA simple multi-physical system for the potential flow of a fluid through a shroud, in which a mechanical component, like a turbine vane, is placed, is modeled mathematically. We then consider a multi-criteria shape optimization problem, where the shape of the component is allowed to vary under a certain set of second-order Hölder continuous differentiable transformations of a baseline shape with boundary of the same continuity class. As objective functions, we consider a simple loss model for the fluid dynamical efficiency and the probability of failure of the component due to repeated application of loads that stem from the fluid’s static pressure. For this multi-physical system, it is shown that, under certain conditions, the Pareto front is maximal in the sense that the Pareto front of the feasible set coincides with the Pareto front of its closure. We also show that the set of all optimal forms with respect to scalarization techniques deforms continuously (in the Hausdorff metric) with respect to preference parameters.

Dynamic output feedback control for nonlinear large-scale interconnected systems

2020 ◽  
Vol 39 (4) ◽  
pp. 801-821
Author(s):  
Ezzeddine Touti ◽  
Ali Sghaier Tlili ◽  
Muhannad Almutiry
Keyword(s):  
Decentralized Control ◽  
Output Feedback ◽  
Large Scale ◽  
Optimization Problem ◽  
Lyapunov Theory ◽  
Interconnected Systems ◽  
Dynamic Output Feedback ◽  
Content Type ◽  
Dynamic Output ◽  
Control Scheme

Purpose This paper aims to focus on the design of a decentralized observation and control method for a class of large-scale systems characterized by nonlinear interconnected functions that are assumed to be uncertain but quadratically bounded. Design/methodology/approach Sufficient conditions, under which the designed control scheme can achieve the asymptotic stabilization of the augmented system, are developed within the Lyapunov theory in the framework of linear matrix inequalities (LMIs). Findings The derived LMIs are formulated under the form of an optimization problem whose resolution allows the concurrent computation of the decentralized control and observation gains and the maximization of the nonlinearity coverage tolerated by the system without becoming unstable. The reliable performances of the designed control scheme, compared to a distinguished decentralized guaranteed cost control strategy issued from the literature, are demonstrated by numerical simulations on an extensive application of a three-generator infinite bus power system. Originality/value The developed optimization problem subject to LMI constraints is efficiently solved by a one-step procedure to analyze the asymptotic stability and to synthesize all the control and observation parameters. Therefore, such a procedure enables to cope with the conservatism and suboptimal solutions procreated by optimization problems based on iterative algorithms with multi-step procedures usually used in the problem of dynamic output feedback decentralized control of nonlinear interconnected systems.

Sign in / Sign up

Export Citation Format

Share Document