Search results for " optimization."
showing 10 items of 2333 documents
Optimization of the objective function –surface quality by end-milling dimensional machining of some aluminum alloys
2019
Abstract In the aerospace industry, the milling of aluminum alloy parts is a machining process with the primary purpose of removing high volumes of material. Aluminum alloys are materials that have relatively good machinability, which helps the process because many of the components of the aircraft are of high dimensions. These parts have many pockets more or less deep, and the removal by cutting off about 90% of the initial volume of the workpiece is a matter of consideration. The manufacturing process is protracted and involves long semi-finishing and finishing operations, so it is recommended that any researcher who begins and finishes an experimental study should do it base on a specifi…
Necessary conditions for extremality and separation theorems with applications to multiobjective optimization
1998
The aim of this paper is to give necessary conditions for extremality in terms of an abstract subdifferential and to obtain general separation theorems including both finite and infinite classical separation theorems. This approach, which is mainly based on Ekeland's variational principle and the concept of locally weak-star compact cones, can be considered as a generalization f the notions of optima in problems of scalar or vector optimization with and without constraints. The results obtained are applied to derive new necessary optimality conditions for Pareto local minimum and weak Pareto minimum of nonsmooth multlobjectivep rogramming problems.
ε-Regularized two-level optimization problems: Approximation and existence results
2006
The purpose of this work is to improve some results given in [12], relating to approximate solutions for two-level optimization problems. By considering an e-regularized problem, we get new properties, under convexity assumptions in the lower level problems. In particular, we prove existence results for the solutions to the e-regularized problem, whereas the initial two-level optimization problem may fail to have a solution. Finally, as an example, we consider an approximation method with interior penalty functions.
Bayesian model averaging and weighted-average least squares: Equivariance, stability, and numerical issues
2011
In this article, we describe the estimation of linear regression models with uncertainty about the choice of the explanatory variables. We introduce the Stata commands bma and wals, which implement, respectively, the exact Bayesian model-averaging estimator and the weighted-average least-squares estimator developed by Magnus, Powell, and Prüfer (2010, Journal of Econometrics 154: 139–153). Unlike standard pretest estimators that are based on some preliminary diagnostic test, these model-averaging estimators provide a coherent way of making inference on the regression parameters of interest by taking into account the uncertainty due to both the estimation and the model selection steps. Spec…
Wideband impedance matrix representation of passive waveguide components based on cascaded planar junctions
2009
[1] A very efficient technique for the full-wave analysis of passive waveguide components, composed of the cascade connection of planar junctions, is presented. This novel technique provides the wideband generalized impedance matrix representation of the whole structure in the form of pole expansions, thus extracting the most expensive computations from the frequency loop. For this purpose, the structure is segmented into planar junctions and uniform waveguide sections, which are characterized in terms of wideband impedance matrices. Then, an efficient iterative algorithm for combining such matrices, and finally providing the wideband generalized impedance matrix of the complete structure, …
An alternative and easy approach to fixed point results via simulation functions
2017
Abstract We discuss, extend, improve and enrich results on simulation functions established by several authors. Furthermore, by using Lemma 2.1 of Radenovic et al. [Bull. Iran. Math. Soc., 2012, 38, 625],we get much shorter and nicer proofs than the corresponding ones in the existing literature.
Decision-aid for discrete multiple criteria decision making problems with imprecise data
1999
Abstract We describe ways of aiding decision making with a discrete set of alternatives. In many decision situations, it is not possible to obtain explicit preference information from the decision makers. Instead, useful decision-aid can be provided to the decision makers by describing what kind of weighting of the criteria result in certain choices of the alternatives. The suggested treatment is based on the basic ideas of the ELECTRE III method. The modelling of the preferences by pseudo-criteria is especially helpful in case the data, that is, the criterion values are imprecise. Unlike ELECTRE III, no ranking of the alternatives is produced. Based on a minimum-procedure in the exploitati…
Assessing energy forecasting inaccuracy by simultaneously considering temporal and absolute errors
2017
Abstract Recent years have seen a growing trend in wind and solar energy generation globally and it is expected that an important percentage of total energy production comes from these energy sources. However, they present inherent variability that implies fluctuations in energy generation that are difficult to forecast. Thus, forecasting errors have a considerable role in the impacts and costs of renewable energy integration, management, and commercialization. This study presents an important advance in the task of analyzing prediction models, in particular, in the timing component of prediction error, which improves previous pioneering results. A new method to match time series is defined…
Integer Preemption Problems
2014
A fundamental assumption in the basic RCPSP is that activities in progress are non-preemptable. Some papers reveal the potential benefits of allowing activity interruptions in the schedule when the objective is the makespan minimization. In this chapter we consider the Maxnint_PRCPSP in which it is assumed that activities can be interrupted at any integer time instant with no cost incurred, that each activity can be split into a maximum number of parts, and that each part has a minimum duration established. We show how some procedures developed for the RCPSP can be adapted to work with the Maxnint_PRCPSP and we introduce some procedures specifically designed for this problem. Furthermore, p…
Selecting Genetic Operators to Maximise Preference Satisfaction in a Workforce Scheduling and Routing Problem
2017
The Workforce Scheduling and Routing Problem (WSRP) is a combinatorial optimisation problem that involves scheduling and routing of workforce. Tackling this type of problem often requires handling a considerable number of requirements, including customers and workers preferences while minimising both operational costs and travelling distance. This study seeks to determine effective combinations of genetic operators combined with heuristics that help to find good solutions for this constrained combinatorial optimisation problem. In particular, it aims to identify the best set of operators that help to maximise customers and workers preferences satisfaction. This paper advances the understand…