Search results for " Opera"
showing 10 items of 3606 documents
On the Extension of the DIRECT Algorithm to Multiple Objectives
2020
AbstractDeterministic global optimization algorithms like Piyavskii–Shubert, direct, ego and many more, have a recognized standing, for problems with many local optima. Although many single objective optimization algorithms have been extended to multiple objectives, completely deterministic algorithms for nonlinear problems with guarantees of convergence to global Pareto optimality are still missing. For instance, deterministic algorithms usually make use of some form of scalarization, which may lead to incomplete representations of the Pareto optimal set. Thus, all global Pareto optima may not be obtained, especially in nonconvex cases. On the other hand, algorithms attempting to produce r…
LR-NIMBUS : an interactive algorithm for uncertain multiobjective optimization with lightly robust efficient solutions
2022
In this paper, we develop an interactive algorithm to support a decision maker to find a most preferred lightly robust efficient solution when solving uncertain multiobjective optimization problems. It extends the interactive NIMBUS method. The main idea underlying the designed algorithm, called LR-NIMBUS, is to ask the decision maker for a most acceptable (typical) scenario, find an efficient solution for this scenario satisfying the decision maker, and then apply the derived efficient solution to generate a lightly robust efficient solution. The preferences of the decision maker are incorporated through classifying the objective functions. A lightly robust efficient solution is generated …
Heuristic algorithms for a storage location assignment problem in a chaotic warehouse
2014
The extensive application of emerging technologies is revolutionizing warehouse management. These technologies facilitate working with complex and powerful warehouse management models in which products do not have assigned fixed locations (random storage). Random storage allows the utilization of the available space to be optimized. In this context, and motivated by a real problem, this article presents a model that looks for the optimal allocation of goods in order to maximize the storage space availability within the restrictions of the warehouse. For the proposed model a construction method, a local search algorithm and different metaheuristics have been developed. The introduced algorit…
Optimal Starting Conditions for the Rendezvous Maneuver, Part 1: Optimal Control Approach
2008
We consider the three-dimensional rendezvous between two spacecraft: a target spacecraft on a circular orbit around the Earth and a chaser spacecraft initially on some elliptical orbit yet to be determined. The chaser spacecraft has variable mass, limited thrust, and its trajectory is governed by three controls, one determining the thrust magnitude and two determining the thrust direction. We seek the time history of the controls in such a way that the propellant mass required to execute the rendezvous maneuver is minimized. Two cases are considered: (i) time-to-rendezvous free and (ii) time-to-rendezvous given, respectively equivalent to (i) free angular travel and (ii) fixed angular trave…
Strict quasi-concavity and the differential barrier property of gauges in linear programming
2014
Concave gauge functions were introduced to give an analytical representation of cones. In particular, they give a simple and a practical representation of the positive orthant. There is a wide choice of concave gauge functions with interesting properties, representing the same cone. Besides the fact that a concave gauge cannot be identically zero on a cone(), it may be continuous, differentiable and even on its interior. The purpose of the present paper is to present another approach to penalizing the positivity constraints of a linear programme using an arbitrary strictly quasi-concave gauge representation. Throughout the paper, we generalize the concept of the central path and the analyti…
A Simple Operating Strategy of Small-Scale Battery Energy Storages for Energy Arbitrage under Dynamic Pricing Tariffs
2015
Price arbitrage involves taking advantage of an electricity price difference, storing electricity during low-prices times, and selling it back to the grid during high-prices periods. This strategy can be exploited by customers in presence of dynamic pricing schemes, such as hourly electricity prices, where the customer electricity cost may vary at any hour of day, and power consumption can be managed in a more flexible and economical manner, taking advantage of the price differential. Instead of modifying their energy consumption, customers can install storage systems to reduce their electricity bill, shifting the energy consumption from on-peak to off-peak hours. This paper develops a deta…
Methodologies for the Exploitation of Existing Energy Corridors. GIS Analysis and DTR Applications
2018
The exploitation of power lines currently in operation has now become a common practice among electric system operators. The construction of new power lines requires taking economic, political and social problems into consideration. This paper considers two methodologies adopted by the Italian Transmission System Operator (TSO), Terna S.p.A.: Dynamic Thermal Rating (DTR) and Laser Imaging Detection and Ranging-Geographic Information System (L-GIS). DTR systems dynamically calculate the real transport capacity of a power line. The L-GIS system allows, after the geo-referencing of the power line, the management of any interference between the line and the nearby obstacles, permitting the opti…
Computing Euclidean Steiner trees over segments
2020
In the classical Euclidean Steiner minimum tree (SMT) problem, we are given a set of points in the Euclidean plane and we are supposed to find the minimum length tree that connects all these points, allowing the addition of arbitrary additional points. We investigate the variant of the problem where the input is a set of line segments. We allow these segments to have length 0, i.e., they are points and hence we generalize the classical problem. Furthermore, they are allowed to intersect such that we can model polygonal input. As in the GeoSteiner approach of Juhl et al. (Math Program Comput 10(2):487–532, 2018) for the classical case, we use a two-phase approach where we construct a superse…
Sustainable Management of Tourist Flow Networks: A Mean Field Model
2023
In this article, we propose a mean field game approach for modeling the flows of excursionists within a network of tourist attractions. We prove the existence of an equilibrium within the network using a balance ordinary differential equation together with optimality conditions in terms of the value function. We also propose a bi-level formulation of the problem where we aim at achieving a sustainable-oriented control strategy in the upper level and at maximizing excursionists’ satisfaction in the lower level. Our proposed model may provide an effective management tool for local authorities who deal with the challenging problem of finding an optimal control policy to the often conflicting o…
Guidance Trajectories for Spacecraft Rendezvous
2007
In a previous paper of Miele et al. (J. Optim. Theory Appl. 132(1), 2007), we employed the single-subarc sequential gradient-restoration algorithm to optimize the three-dimensional rendezvous between a target spacecraft in a planar circular orbit and a chaser spacecraft with an initial separation distance and separation velocity. The achieved continuous solutions are characterized by two, three, or four subarcs depending on the performance index (time, fuel) and the constraints. In this paper, based on the solutions in Miele et al. (J. Optim. Theory Appl. 132(1), 2007), we employ the multiple-subarc sequential gradient-restoration algorithm to produce pieced guidance trajectories implementa…