A coupled topology and domain shape optimization framework is presented that is based on incorporating the shape design variables of the design domain in the Solid Isotropic Material with Penalization topology optimization method. The shape and topology design variables are incrementally updated in a sequential fashion, using a staggered numerical update scheme. Non-Uniform Rational B-Splines are employed

In this study we present an optimization problem where machine scheduling and personnel allocation decisions are solved simultaneously. The machine scheduling consists of solving a variant of the job shop problem where jobs are allocated in batches and multitasking is allowed. On the other hand, the personnel allocation problem searches for the optimal allocation of human resources to support the facility

Storage planning and utilization are among the most important considerations of practical batch process scheduling. Modeling the available storage options appropriately can be crucial in order to find practically applicable solutions with the best objective value. In general, there are two main limitations on storage: capacity and time. This paper focuses on the latter and investigates different techniques

The present paper addresses the robustness and convergence behavior of the direct limit analysis (LA) based methodology developed for the topology design of continuum structures subject to prescribed statically and plastically admissible loads. The design methodology, based on a direct method formulation of the static LA problem, has recently been proposed for continuous topology optimization and its

This paper aims to obtain a strong convergence result for a Douglas–Rachford splitting method with inertial extrapolation step for finding a zero of the sum of two set-valued maximal monotone operators without any further assumption of uniform monotonicity on any of the involved maximal monotone operators. Furthermore, our proposed method is easy to implement and the inertial factor in our proposed

One crucial advantage of additive manufacturing regarding the optimization of lattice structures is that there is a reduction in manufacturing constraints compared to classical manufacturing methods. To make full use of these advantages and to exploit the resulting potential, it is necessary that lattice structures are designed using optimization. Against this backdrop, two mixed integer programs are

We present a convection–diffusion inverse problem that aims to identify an unknown number of sources and their locations. We model the sources using a binary function, and we show that the inverse problem can be formulated as a large-scale mixed-integer nonlinear optimization problem. We show empirically that current state-of-the-art mixed-integer solvers cannot solve this problem and that applying

The assessment of the ecological impact of different powertrain concepts is of increasing relevance considering the enormous efforts necessary to limit the global warming effect due to the man-made climate change. Within this contribution, we adopt existing methods for the optimization of electric and hybrid electric powertrains using a vehicle simulation environment and derive a method to identify

The paper concerns with the two numerical methods for approximating solutions of a monotone and Lipschitz variational inequality problem in a Hilbert space. We here describe how to incorporate regularization terms in the projection method, and then establish the strong convergence of the resulting methods under certain conditions imposed on regularization parameters. The new methods work in both cases

We present a novel parameter space exploration algorithm for three classes of multiparametric problems, namely linear (mpLP), quadratic (mpQP), and mixed-integer linear (mpMILP). We construct subsets of the parameter space in the form of simplices through Delaunay triangulation to facilitate identification of the optimal partitions that describe the solution space. The presented exploration strategy

In this paper, we focus on multiobjective two-level simple recourse programming problems, in which multiple objective functions are involved in each level, shortages and excesses arising from the violation of the constraints with discrete random variables are penalized, and the sum of the objective function and the expectation of the amount of the penalties is minimized. To deal with such problems

We propose a semismooth Newton-type method for nonsmooth optimal control problems. Its particular feature is the combination of a quasi-Newton method with a semismooth Newton method. This reduces the computational costs in comparison to semismooth Newton methods while maintaining local superlinear convergence. The method applies to Hilbert space problems whose objective is the sum of a smooth function

The employment of industrial robot systems especially in the automotive industry noticeably changed the view of production plants and led to a tremendous increase in productivity. Nonetheless, rising technological complexity, the parallelization of production processes, as well as the crucial need for respecting specific safety issues pose new challenges for man and machine. Our goal is to develop

The objective of this research is to efficiently solve complicated high dimensional optimization problems by using machine learning technologies. Recently, major optimization targets have been changed to more complicated ones such as discontinuous and high dimensional optimization problems. It is necessary to solve the high-dimensional optimization problems to obtain an innovate design from topology

Particle swarm optimization (PSO) is one of the most commonly used stochastic optimization algorithms for many researchers and scientists of the last two decades, and the pattern search (PS) method is one of the most important local optimization algorithms. In this paper, we test three methods of hybridizing PSO and PS to improve the global minima and robustness. All methods let PSO run first followed

The synthesis of energy systems is a two-stage optimization problem where design decisions have to be implemented here-and-now (first stage), while for the operation of installed components, we can wait-and-see (second stage). To identify a sustainable design, we need to account for both economical and environmental criteria leading to multi-objective optimization problems. However, multi-objective

Real-time and short-term prediction of river flow is essential for efficient flood management. To obtain accurate flow predictions, a reliable rainfall-runoff model must be used. This study proposes the application of two evolutionary algorithms, particle swarm optimization (PSO) and genetic algorithm (GA), to train the artificial neural network (ANN) parameters in order to overcome the ANN drawbacks

The scheduling of drilling and hydraulic fracturing of wells in an unconventional oil field plays an important role in the profitability of the field. A key challenge arising in this problem is the requirement that neither drilling nor oil production can be done at wells within a specified neighborhood of a well being fractured. We propose a novel mixed-integer linear programming (MILP) formulation

Most parallel surrogate-based optimization algorithms focus only on the mechanisms for generating multiple updating points in each cycle, and rather less attention has been paid to producing them through the cooperation of several algorithms. For this purpose, a surrogate-based cooperative optimization framework is here proposed. Firstly, a class of parallel surrogate-based optimization algorithms

Within the framework of complex system design, it is often necessary to solve mixed variable optimization problems, in which the objective and constraint functions can depend simultaneously on continuous and discrete variables. Additionally, complex system design problems occasionally present a variable-size design space. This results in an optimization problem for which the search space varies dynamically

In this paper, we present a new approach to solve multi-attribute decision making (MADM) problems considering subjective preferences and non-preferences of the decision maker in the form of triangular fuzzy preference relations and triangular fuzzy non-preference relations, respectively. Some important characteristics of these relations are used to form non-linear programming problems corresponding

It is now generally accepted that Euclidean-based metrics may not always adequately represent the subjective judgement of a human observer. As a result, many image processing methodologies have been recently extended to take advantage of alternative visual quality measures, the most prominent of which is the Structural Similarity Index Measure (SSIM). The superiority of the latter over Euclidean-based

Lion and Man problems are classical examples of pursuit and evasion games. However, the traditional analytic methods and indirect numerical methods only can handle the generalization of Lion and Man problems in games with small scales and simple scenarios. In this study, we first extend the original Lion and Man problems to a more complicated and time-varying game environment. Then we propose the simultaneous

In this paper, an interior point method (IPM) based on a new kernel function for solving linearly constrained convex optimization problems is presented. So, firstly a survey on several trigonometric kernel functions defined in literature is done and some properties of them are studied. Then some common characteristics of these functions which help us to define a new trigonometric kernel function are

In this paper, we combine the subgradient extragradient method and the hybrid method with inertial extrapolation step to introduce two strongly convergent methods for solving variational inequalities for which the underlying cost function is a pseudo-monotone operator in real Hilbert spaces. The first proposed method involves step-sizes bounded by the inverse of the Lipschitz constant of the cost function

Bayesian Optimization using Gaussian Processes is a popular approach to deal with optimization involving expensive black-box functions. However, because of the assumption on the stationarity of the covariance function defined in classic Gaussian Processes, this method may not be adapted for non-stationary functions involved in the optimization problem. To overcome this issue, Deep Gaussian Processes

We consider the problem of devising optimal price-offers (bids) for an energy producer participating in a multi-period day-ahead electricity market which exhibits non-convexities due to the discrete nature of the generation units’ commitments and quantities. The problem definition assumes perfect knowledge of the market’s technical characteristics, as well as of the bidding offers of the remaining

As indicated in the recent studies about primal-dual interior-point methods (IPMs) based on kernel functions, a kernel function not only serves to determine the search direction and measure the distance of the current iteration point to the \(\mu \)-center, but also affects the iteration complexity and the practical computational efficiency of the algorithm. In this paper, we propose a new IPM for

In order to increase the driving range of battery electric vehicles, while maintaining a high level of thermal comfort inside the passenger cabin, it is necessary to design an energy management system which optimally synthesizes multiple control actions of heating, ventilation and air-conditioning (HVAC) system. To gain an insight into optimal control actions and set a control benchmark, the paper

In this paper, a new class of kernel functions is introduced. We show that most existing kernel functions belong to this class. All functions in the new class are eligible in the sense of Bai et al. (SIAM J Optim 15(1):101–128, 2004), and hence the analysis of the resulting interior-point methods can follow the scheme proposed in Bai et al. (2004). We introduce five new kernel functions and by using

We define a regularized variant of the dual dynamic programming algorithm called DDP-REG to solve nonlinear dynamic programming equations. We extend the algorithm to solve nonlinear stochastic dynamic programming equations. The corresponding algorithm, called SDDP-REG, can be seen as an extension of a regularization of the stochastic dual dynamic programming (SDDP) algorithm recently introduced which

The testing and verification of a complex hardware or software system, such as modern integrated circuits found in everything from smartphones to servers, can be a difficult process. One of the most difficult and time-consuming tasks a verification team faces is reaching coverage closure, or hitting all events in the coverage space. Coverage-directed-generation (CDG), or the automatic generation of

In this work, a design optimisation strategy is presented for expensive and uncertain single- and multi-objective problems. Computationally expensive design fitness evaluations prohibit the application of standard optimisation techniques and the direct calculation of risk measures. Therefore, a surrogate-assisted optimisation framework is presented. The computational budget limits the number of high-fidelity

Given an infeasible, unbounded, or pathological convex optimization problem, a natural question to ask is: what is the smallest change we can make to the problem’s parameters such that the problem becomes solvable? In this paper, we address this question by posing it as an optimization problem involving the minimization of a convex regularization function of the parameters, subject to the constraint

Energy management can play a significant role in energy savings and temperature control of buildings, which consume a major share of energy resources worldwide. Model predictive control (MPC) has become a popular technique for energy management, arguably for its ability to cope with complex dynamics and system constraints. The MPC algorithms found in the literature are mostly centralized, with a single

The advantages of multidisciplinary design are well understood, but not yet fully adopted by the industry where methods should be both fast and reliable. For such problems, minimum computational cost while providing global optimality and extensive design information at an early conceptual stage is desired. However, such a complex problem consisting of various objectives and interacting disciplines

When solving for optimal strategies, a financial engineer needs to take into consideration of preferences heterogeneities, which involve not only present bias, but also future-focused preferences. We provide a reusable tool (i.e. algorithm) for explicitly solving optimal strategy in the presence of preferences variation over time, decision-makers and goods. In this framework, a new discount function

The IAPWS-IF97 (Wagner et al. (2000) J Eng Gas Turbines Power 122:150) is the state-of-the-art model for the thermodynamic properties of water and steam for industrial applications and is routinely used for simulations of steam power cycles and utility systems. Its use in optimization-based design, however, has been limited because of its complexity. In particular, deterministic global optimization

In this paper, we propose a new iterative method for finding an element of the solution set of a split variational inclusion problem in real Hilbert spaces. The iterative scheme is based on a well-known Mann-type method to obtain strong convergence and an inertial method to speed up the convergence rate. We also apply the proposed algorithm to studying the split feasibility problem. Finally, we give

Hard-capacitated k-means (HCKM) is one of the fundamental problems remaining open in combinatorial optimization and engineering. In HCKM, one is required to partition a given n-point set into k disjoint clusters with known capacity so as to minimize the sum of within-cluster variances. It is known to be at least APX-hard, and most of the work on it has been done from a meta heuristic or bi-criteria

The physical and virtual connectivity of systems via flows of energy, material, information, etc., steadily increases. This paper deals with systems of sub-systems that are connected by networks of shared resources that have to be balanced. For the optimal operation of the overall system, the couplings between the sub-systems must be taken into account, and the overall optimum will usually deviate

Wastewater treatment process design involves the optimization of multiple conflicting objectives. The detection of different equivalent solutions in terms of objective values is crucial for designers in order to efficiently switch to the new optimal operation policies if changes in the process conditions or new constraints occur. In this work, the dynamic multi-objective optimization of a municipal

A fin serves as an extended surface to enhance the heat transfer from a larger heated mass to which it is attached. We use a multiobjective optimization (MO) approach for a fin in steady-state to analyze the dynamics of effectiveness and efficiency simultaneously. Our approach is based on a piecewise linear approximation of the design. We use the \(\epsilon\)-constraint method of MO to identify Pareto

In this paper we consider optimal control of nonlinear time-dependent fluid structure interactions. To determine a time-dependent control variable a BFGS algorithm is used, whereby gradient information is computed via a dual problem. To solve the resulting ill conditioned linear problems occurring in every time step of state and dual equation, we develop a highly efficient monolithic solver that is

Mine operations are supported by a short-term production schedule, which defines where and when mining activities are performed. However, deviations can be observed in this short-term production schedule because of several sources of uncertainty and their inherent complexity. Therefore, schedules that are more likely to be reproduced in reality should be generated so that they will have a high adherence

This article presents a novel stochastic optimization model that simultaneously optimizes the short-term extraction sequence, shovel relocation, scheduling of a heterogeneous hauling fleet, and downstream allocation of extracted materials in open-pit mining complexes. The proposed stochastic optimization formulation considers geological uncertainty in addition to uncertainty related to equipment performances

A special class of quadratic programming (QP) problems is considered in this paper. This class emerges in simulation of assembly of large-scale compliant parts, which involves the formulation and solution of contact problems. The considered QP problems can have up to 20,000 unknowns, the Hessian matrix is fully populated and ill-conditioned, while the matrix of constraints is sparse. Variation analysis

We present a two-stage stochastic program with recourse to construct covered call portfolios. To maximize the expected utility of a covered call portfolio, the model selects equity positions and call option overwriting weights for varying strike prices and expiry dates. Since the model has linear constraints and risk-averse utility functions are concave, the optimization problem is convex. The model

The ideas in this paper are motivated by an increased need for systematic data-enabled resource management of large-scale electric energy systems. The basic control objective is to manage uncertain disturbances, power imbalances in particular, by optimizing available power resources. To that end, we start with a centralized optimal control problem formulation of system-level performance objective subject

Robust portfolio selection explicitly incorporates a model of parameter uncertainty in the problem formulation, and optimizes for the worst-case scenario. We consider robust mean–variance portfolio selection involving a trade-off between the worst-case utility and the worst-case regret, or the largest difference between the best utility achievable under the model and that achieved by a given portfolio

In this paper, we consider a nonlinear time-varying dynamical (NTVD) system with uncertain system parameters assigned to their nominal values in batch culture of glycerol bioconversion to 1,3-propanediol induced by Klebsiella pneumoniae. Some important properties of the NTVD system are discussed. Our goal is to choose a time-varying function for the NTVD system. Thus, an optimal control problem (OCP)

We present a mixed-integer programming model for solving the long-term planning problem of an underground mine. This model, which establishes the sequence of mining for a horizon of 20 years, determines which lens of the geological model will be mined and in what order, while respecting the operational constraints. For each lens to be mined, a specific cut-off grade has to be selected to maximize the

We introduce a novel approach for robust principal component analysis (RPCA) for a partially observed data matrix. The aim is to recover the data matrix as a sum of a low-rank matrix and a sparse matrix so as to eliminate erratic noise (outliers). This problem is known to be NP-hard in general. A classical approach to solving RPCA is to consider convex relaxations. One such heuristic involves the minimization

Computer Aided Design (CAD) systems and tools are considered essential for industrial design. They construct and manipulate the geometry of a certain component with an arbitrary set of design parameters. However, it is a challenging task to incorporate the parametric definition in a gradient-based shape optimization loop, since the CAD libraries usually do not provide shape sensitivities w.r.t. the

We establish a new fractional squared least squares (FSLS) optimization model for the GPS localization problem. It provides more accurate solutions than the classical squared least squares model. We reformulate (FSLS) as a univariate optimization, where the functional evaluation corresponds to the generalized trust region subproblem. We employ the branch and bound algorithm to globally solve (FSLS)

This paper develops a hybrid optimization approach for multi-criteria optimal design of a compliant positioning platform for nanoindentation tester. The platform mimics the biomechanical behavior of beetle so as to allow a linear motion. Structure of the beetle-liked mechanism consists of six legs arranging in a symmetric topology. Amplification ratio and static characteristics of the platform are

Recovering the end-of-life (EOL) products helps companies reduce the purchasing cost for goods and materials that can be removed from EOL products and reused. This also contributes to the efforts aiming at reducing the environmental consequences of hazardous materials. Disassembly lines play a vital role in the disassembling process of EOL products. This research introduces the Type-E multi-manned

Concentrating solar power (CSP) tower technologies capture thermal radiation from the sun utilizing a field of solar-tracking heliostats. When paired with inexpensive thermal energy storage (TES), CSP technologies can dispatch electricity during peak-market-priced hours, day or night. The cost of utility-scale photovoltaic (PV) systems has dropped significantly in the last decade, resulting in inexpensive

Recently, Bouafia et al. (J Optim Theory Appl 170:528–545, 2016) investigated a new efficient kernel function that differs from self-regular kernel functions. The kernel function has a trigonometric barrier term. This paper introduces a new efficient twice parametric kernel function that combines the parametric classic function with the parametric kernel function trigonometric barrier term given by

The continuous adjoint method is formulated and utilized for the optimization of a static mixing device. The CFD tool used for the simulations is based on a two-phase model governing flows of two miscible fluids. The formulation of the corresponding continuous adjoint problem is presented and the computed gradients are utilized in an optimization loop. In specific, a multi-objective optimization problem