25 research outputs found

    A neurodynamic approach for a class of pseudoconvex semivectorial bilevel optimization problem

    Full text link
    The article proposes an exact approach to find the global solution of a nonconvex semivectorial bilevel optimization problem, where the objective functions at each level are pseudoconvex, and the constraints are quasiconvex. Due to its non-convexity, this problem is challenging, but it attracts more and more interest because of its practical applications. The algorithm is developed based on monotonic optimization combined with a recent neurodynamic approach, where the solution set of the lower-level problem is inner approximated by copolyblocks in outcome space. From that, the upper-level problem is solved using the branch-and-bound method. Finding the bounds is converted to pseudoconvex programming problems, which are solved using the neurodynamic method. The algorithm's convergence is proved, and computational experiments are implemented to demonstrate the accuracy of the proposed approach

    A Framework for Controllable Pareto Front Learning with Completed Scalarization Functions and its Applications

    Full text link
    Pareto Front Learning (PFL) was recently introduced as an efficient method for approximating the entire Pareto front, the set of all optimal solutions to a Multi-Objective Optimization (MOO) problem. In the previous work, the mapping between a preference vector and a Pareto optimal solution is still ambiguous, rendering its results. This study demonstrates the convergence and completion aspects of solving MOO with pseudoconvex scalarization functions and combines them into Hypernetwork in order to offer a comprehensive framework for PFL, called Controllable Pareto Front Learning. Extensive experiments demonstrate that our approach is highly accurate and significantly less computationally expensive than prior methods in term of inference time.Comment: Under Review at Neural Networks Journa

    Pareto Optimal Solutions for Stochastic Dynamic Programming Problems via Monte Carlo Simulation

    Get PDF
    A heuristic algorithm is proposed for a class of stochastic discrete-time continuous-variable dynamic programming problems submitted to non-Gaussian disturbances. Instead of using the expected values of the objective function, the randomness nature of the decision variables is kept along the process, while Pareto fronts weighted by all quantiles of the objective function are determined. Thus, decision makers are able to choose any quantile they wish. This new idea is carried out by using Monte Carlo simulations embedded in an approximate algorithm proposed to deterministic dynamic programming problems. The new method is tested in instances of the classical inventory control problem. The results obtained attest for the efficiency and efficacy of the algorithm in solving these important stochastic optimization problems

    Operation and Planning of Energy Hubs Under Uncertainty - a Review of Mathematical Optimization Approaches

    Get PDF
    Co-designing energy systems across multiple energy carriers is increasingly attracting attention of researchers and policy makers, since it is a prominent means of increasing the overall efficiency of the energy sector. Special attention is attributed to the so-called energy hubs, i.e., clusters of energy communities featuring electricity, gas, heat, hydrogen, and also water generation and consumption facilities. Managing an energy hub entails dealing with multiple sources of uncertainty, such as renewable generation, energy demands, wholesale market prices, etc. Such uncertainties call for sophisticated decision-making techniques, with mathematical optimization being the predominant family of decision-making methods proposed in the literature of recent years. In this paper, we summarize, review, and categorize research studies that have applied mathematical optimization approaches towards making operational and planning decisions for energy hubs. Relevant methods include robust optimization, information gap decision theory, stochastic programming, and chance-constrained optimization. The results of the review indicate the increasing adoption of robust and, more recently, hybrid methods to deal with the multi-dimensional uncertainties of energy hubs

    Operation and planning of energy hubs under uncertainty - A review of mathematical optimization approaches

    Get PDF
    Co-designing energy systems across multiple energy carriers is increasingly attracting attention of researchers and policy makers, since it is a prominent means of increasing the overall efficiency of the energy sector. Special attention is attributed to the so-called energy hubs, i.e., clusters of energy communities featuring electricity, gas, heat, hydrogen, and also water generation and consumption facilities. Managing an energy hub entails dealing with multiple sources of uncertainty, such as renewable generation, energy demands, wholesale market prices, etc. Such uncertainties call for sophisticated decision-making techniques, with mathematical optimization being the predominant family of decision-making methods proposed in the literature of recent years. In this paper, we summarize, review, and categorize research studies that have applied mathematical optimization approaches towards making operational and planning decisions for energy hubs. Relevant methods include robust optimization, information gap decision theory, stochastic programming, and chance-constrained optimization. The results of the review indicate the increasing adoption of robust and, more recently, hybrid methods to deal with the multi-dimensional uncertainties of energy hubs.Web of Science117228720

    An intelligent novel tripartite - (PSO-GA-SA) optimization strategy

    Get PDF
    A solution approach for many challenging and non-differentiable optimization tasks in industries is the use of non-deterministic meta-heuristic methods. Some of these approaches include Particle Swarm Optimization (PSO), Genetic Algorithm (GA), and Simulated Annealing (SA). However, with the implementation usage of these robust and stochastic optimization approaches, there are still some predominant issues such as the problem of the potential solution being trapped in a local minima solution space. Other challenges include the untimely convergence and the slow rate of arriving at optimal solutions. In this research study, a tripartite version (PSO-GA-SA) is proposed to address these deficiencies. This algorithm is designed with the full exploration of all the capabilities of PSO, GA and SA functioning simultaneously with a high level of intelligent system techniques to exploit and exchange relevant population traits in real time without compromising the computational time. The design algorithm further incorporates a variable velocity component that introduces random intelligence depending on the fitness performance from one generation to the other. The robust design is validated with known mathematical test function models. There are substantial performance improvements when the novel PSO-GA-SA approach is subjected to three test functions used as case studies. The results obtained indicate that the new approach performs better than the individual methods from the fitness function deviation point of view and in terms of the total simulation time whilst operating with both a reduced number of generations and populations. Moreover, the new novel approach offers more beneficial trade-off between exploration and exploitation of PSO, GA and SA. This novel design is implemented using an object oriented programming approach and it is expected to be compatible with a variety of practical problems with specified input-output pairs coupled with constraints and limitations on the available resources

    A brief review of neural networks based learning and control and their applications for robots

    Get PDF
    As an imitation of the biological nervous systems, neural networks (NN), which are characterized with powerful learning ability, have been employed in a wide range of applications, such as control of complex nonlinear systems, optimization, system identification and patterns recognition etc. This article aims to bring a brief review of the state-of-art NN for the complex nonlinear systems. Recent progresses of NNs in both theoretical developments and practical applications are investigated and surveyed. Specifically, NN based robot learning and control applications were further reviewed, including NN based robot manipulator control, NN based human robot interaction and NN based behavior recognition and generation

    Central nervous system: overall considerations based on hardware realization of digital spiking silicon neurons (dssns) and synaptic coupling

    Get PDF
    The Central Nervous System (CNS) is the part of the nervous system including the brain and spinal cord. The CNS is so named because the brain integrates the received information and influences the activity of different sections of the bodies. The basic elements of this important organ are: neurons, synapses, and glias. Neuronal modeling approach and hardware realization design for the nervous system of the brain is an important issue in the case of reproducing the same biological neuronal behaviors. This work applies a quadratic-based modeling called Digital Spiking Silicon Neuron (DSSN) to propose a modified version of the neuronal model which is capable of imitating the basic behaviors of the original model. The proposed neuron is modeled based on the primary hyperbolic functions, which can be realized in high correlation state with the main model (original one). Really, if the high-cost terms of the original model, and its functions were removed, a low-error and high-performance (in case of frequency and speed-up) new model will be extracted compared to the original model. For testing and validating the new model in hardware state, Xilinx Spartan-3 FPGA board has been considered and used. Hardware results show the high-degree of similarity between the original and proposed models (in terms of neuronal behaviors) and also higher frequency and low-cost condition have been achieved. The implementation results show that the overall saving is more than other papers and also the original model. Moreover, frequency of the proposed neuronal model is about 168 MHz, which is significantly higher than the original model frequency, 63 MHz
    corecore