Search results for "optimointi"

Time-Dependent Multiple Depot Vehicle Routing Problem on Megapolis Network under Wardrop's Traffic Flow Assignment

2018

In this work multiple depot vehicle routing problem is considered in case of variable travel times between nodes on a metropolis network. This variant of the classic multiple depot vehicle routing problem is motivated by the fact that in urban contexts variable traffic conditions play an essential role and can not be ignored in order to perform a realistic optimization. Time-travel matrices corresponding to each period of planning horizon were formed by solving the traffic assignment problem in conjunction with shortest path problem. Routing problem instances include from 20 to 100 customers randomly chosen from a road network of Saint-Petersburg. The results demonstrate that taking into ac…

Sub-Finsler Geodesics on the Cartan Group

2018

This paper is a continuation of the work by the same authors on the Cartan group equipped with the sub-Finsler $\ell_\infty$ norm. We start by giving a detailed presentation of the structure of bang-bang extremal trajectories. Then we prove upper bounds on the number of switchings on bang-bang minimizers. We prove that any normal extremal is either bang-bang, or singular, or mixed. Consequently, we study mixed extremals. In particular, we prove that every two points can be connected by a piecewise smooth minimizer, and we give a uniform bound on the number of such pieces.

On deterministic solutions for multi-marginal optimal transport with Coulomb cost

2022

In this paper we study the three-marginal optimal mass transportation problem for the Coulomb cost on the plane $\R^2$. The key question is the optimality of the so-called Seidl map, first disproved by Colombo and Stra. We generalize the partial positive result obtained by Colombo and Stra and give a necessary and sufficient condition for the radial Coulomb cost to coincide with a much simpler cost that corresponds to the situation where all three particles are aligned. Moreover, we produce an infinite class of regular counterexamples to the optimality of this family of maps.

Demonstrating the Applicability of PAINT to Computationally Expensive Real-life Multiobjective Optimization

2011

We demonstrate the applicability of a new PAINT method to speed up iterations of interactive methods in multiobjective optimization. As our test case, we solve a computationally expensive non-linear, five-objective problem of designing and operating a wastewater treatment plant. The PAINT method interpolates between a given set of Pareto optimal outcomes and constructs a computationally inexpensive mixed integer linear surrogate problem for the original problem. We develop an IND-NIMBUS R PAINT module to combine the interactive NIMBUS method and the PAINT method and to find a preferred solution to the original problem. With the PAINT method, the solution process with the NIMBUS method take …

Interactive Multiobjective Optimization in Lot Sizing with Safety Stock and Safety Lead Time

2021

In this paper, we integrate a lot sizing problem with the problem of determining optimal values of safety stock and safety lead time. We propose a probability of product availability formula to assess the quality of safety lead time and a multiobjective optimization model as an integrated lot sizing problem. In the proposed model, we optimize six objectives simultaneously: minimizing purchasing cost, ordering cost, holding cost and, at the same time, maximizing cycle service level, probability of product availability and inventory turnover. To present the applicability of the proposed model, we consider a real case study with data from a manufacturing company and apply the interactive NAUTI…

Distributed multi-objective optimization methods for shape design using evolutionary algorithms and game strategies

2012

Adapting Downlink Power in Fronthaul-Constrained Hierarchical Software-Defined RANs

2017

Abstract The proof-of-concept software-defined radio access network (RAN) is not flexible enough due to the inherent delay and the necessity of high-capacity fronthaul links. We are hence motivated to propose a hierarchical software-defined RAN architecture, over which the base stations (BSs) are abstracted into multiple virtual local controllers while these local controllers are administered by a high-level controller. Under such a hierarchical network architecture, we particularly investigate in this paper how to adapt the BS transmit power over a long term according to the network dynamics under the constraints of mobile user queue stability and limited fronthaul capacity. We first formu…

A Computationally Inexpensive Approach in Multiobjective Heat Exchanger Network Synthesis

2010

We consider a heat exchanger network synthesis problem formulated as a multiobjective optimization problem. The Pareto front of this problem is approximated with a new approximation approach and the preferred point on the approximation is found with the interactive multiobjective optimization method NIMBUS. Using the approximation makes the solution process computationally inexpensive. Finally, the preferred outcome on the Pareto front approximation is projected on the actual Pareto front. peerReviewed

Existence for shape optimization problems in arbitrary dimension

2002

We discuss some existence results for optimal design problems governed by second order elliptic equations with the homogeneous Neumann boundary conditions or with the interior transmission conditions. We show that our continuity hypotheses for the unknown boundaries yield the compactness of the associated characteristic functions, which, in turn, guarantees convergence of any minimizing sequences for the first problem. In the second case, weaker assumptions of measurability type are shown to be sufficient for the existence of the optimal material distribution. We impose no restriction on the dimension of the underlying Euclidean space.

Fixed domain approaches in shape optimization problems with Dirichlet boundary conditions

2009

Fixed domain methods have well-known advantages in the solution of variable domain problems including inverse interface problems. This paper examines two new control approaches to optimal design problems governed by general elliptic boundary value problems with Dirichlet boundary conditions. Numerical experiments are also included peerReviewed