Search results for "021103 operations research"
showing 10 items of 289 documents
Fitting random cash management models to data
2019
Abstract Organizations use cash management models to control balances to both avoid overdrafts and obtain a profit from short-term investments. Most management models are based on control bounds which are derived from the assumption of a particular cash flow probability distribution. In this paper, we relax this strong assumption to fit cash management models to data by means of stochastic and linear programming. We also introduce ensembles of random cash management models which are built by randomly selecting a subsequence of the original cash flow data set. We illustrate our approach by means of a real case study showing that a small random sample of data is enough to fit sufficiently goo…
ANOVA-MOP: ANOVA Decomposition for Multiobjective Optimization
2018
Real-world optimization problems may involve a number of computationally expensive functions with a large number of input variables. Metamodel-based optimization methods can reduce the computational costs of evaluating expensive functions, but this does not reduce the dimension of the search domain nor mitigate the curse of dimensionality effects. The dimension of the search domain can be reduced by functional anova decomposition involving Sobol' sensitivity indices. This approach allows one to rank decision variables according to their impact on the objective function values. On the basis of the sparsity of effects principle, typically only a small number of decision variables significantl…
NAUTILUS framework : towards trade-off-free interaction in multiobjective optimization
2016
In this paper, we present a framework of different interactive NAUTILUS methods for multiobjective optimization. In interactive methods, the decision maker iteratively sees solution alternatives and provides one’s preferences in order to find the most preferred solution. We question the widely used setting that the solutions shown to the decision maker should all be Pareto optimal which implies that improvement in any objective function necessitates allowing impairment in some others. Instead, in NAUTILUS we enable the decision maker to make a free search without having to trade-off by starting from an inferior solution and iteratively approaching the Pareto optimal set by allowing all obje…
Interactive Nonlinear Multiobjective Optimization Methods
2016
An overview of interactive methods for solving nonlinear multiobjective optimization problems is given. In interactive methods, the decision maker progressively provides preference information so that the most satisfactory Pareto optimal solution can be found for her or his. The basic features of several methods are introduced and some theoretical results are provided. In addition, references to modifications and applications as well as to other methods are indicated. As the role of the decision maker is very important in interactive methods, methods presented are classified according to the type of preference information that the decision maker is assumed to provide. peerReviewed
Surrogate-assisted evolutionary biobjective optimization for objectives with non-uniform latencies
2018
We consider multiobjective optimization problems where objective functions have different (or heterogeneous) evaluation times or latencies. This is of great relevance for (computationally) expensive multiobjective optimization as there is no reason to assume that all objective functions should take an equal amount of time to be evaluated (particularly when objectives are evaluated separately). To cope with such problems, we propose a variation of the Kriging-assisted reference vector guided evolutionary algorithm (K-RVEA) called heterogeneous K-RVEA (short HK-RVEA). This algorithm is a merger of two main concepts designed to account for different latencies: A single-objective evolutionary a…
Models and solution methods for the uncapacitatedr-allocationp-hub equitable center problem
2017
Hub networks are commonly used in telecommunications and logistics to connect origins to destinations in situations where a direct connection between each origin–destination (o-d) pair is impractical or too costly. Hubs serve as switching points to consolidate and route traffic in order to realize economies of scale. The main decisions associated with hub-network problems include (1) determining the number of hubs (p), (2) selecting the p-nodes in the network that will serve as hubs, (3) allocating non-hub nodes (terminals) to up to r-hubs, and (4) routing the pairwise o-d traffic. Typically, hub location problems include all four decisions while hub allocation problems assume that the valu…
Pragmatism in Decision Support System Research
2018
Decision making on relief distribution is a complex multidisciplinary task in humanitarian logistics. It incorporates decision makers from different but related problem areas. The failure to perform assigned decision-making tasks in any area makes the entire system unstable and delays the relief distribution process. An organized, well-planned, and practical decision support system (DSS) can assist practitioners in making rapid decisions on delivering relief items. Hence, DSS researchers in humanitarian logistics require rigorous thinking, close and critical analysis, and the identification of challenges to conduct research or validate the generated knowledge properly. To perform such compl…
phi-Best proximity point theorems and applications to variational inequality problems
2017
The main concern of this study is to introduce the notion of $$\varphi $$ -best proximity points and establish the existence and uniqueness of $$\varphi $$ -best proximity point for non-self mappings satisfying $$(F,\varphi )$$ -proximal and $$(F,\varphi )$$ -weak proximal contraction conditions in the context of complete metric spaces. Some examples are supplied to support the usability of our results. As applications of the obtained results, some new best proximity point results in partial metric spaces are presented. Furthermore, sufficient conditions to ensure the existence of a unique solution for a variational inequality problem are also discussed.
Some overdetermined problems related to the anisotropic capacity
2018
Abstract We characterize the Wulff shape of an anisotropic norm in terms of solutions to overdetermined problems for the Finsler p-capacity of a convex set Ω ⊂ R N , with 1 p N . In particular we show that if the Finsler p-capacitary potential u associated to Ω has two homothetic level sets then Ω is Wulff shape. Moreover, we show that the concavity exponent of u is q = − ( p − 1 ) / ( N − p ) if and only if Ω is Wulff shape.
The class of F-contraction mappings with a measure of noncompactness
2017
In this chapter we review a class of contraction conditions, which are largely used to obtain interesting generalizations of the Banach fixed-point theorem in various abstract settings. We also present a new fixed-point existence result obtained by considering such a kind of contraction condition and a measure of noncompactness. Moreover, we show the applicability of these results in the theory of functional equations.