Search results for "optimization"
showing 10 items of 2824 documents
Heuristics for a Real-World Mail Delivery Problem
2011
We are solving a mail delivery problem by combining exact and heuristic methods. The problem is a tactical routing problem as routes for all postpersons have to be planned in advance for a period of several months. As for many other routing problems, the task is to construct a set of feasible routes serving each customer exactly once at minimum cost. Four different modes (car, moped, bicycle, and walking) are available, but not all customers are accessible by all modes. Thus, the problem is characterized by three interdependent decisions: the clustering of customers into districts, the choice of a mode for each district, and the routing of the postperson through its district. We present a t…
A New Dynamic Model for Anticipatory Adaptive Control of Airline Seat Reservation via Order Statistics of Cumulative Customer Demand
2017
This paper deals with dynamic anticipatory adaptive control of airline seat reservation for the stochastic customer demand that occurs over time T before the flight is scheduled to depart. It is assumed that time T is divided into m periods, namely a full fare period and m−1 discounted fare periods. The fare structure is given. An airplane has a seat capacity of U. For the sake of simplicity, but without loss of generality, we consider (for illustration) the case of nonstop flight with two fare classes (business and economy). The proposed policies of the airline seat inventory control are based on the use of order statistics of cumulative customer demand, which have such properties as bivar…
Cooperative Inventory control
2005
In multi-retailer inventory control the possibility of sharing setup costs motivates communication and coordination among the retailers. We solve the problem of finding suboptimal distributed reordering policies that minimize setup, ordering, storage, and shortage costs incurred by the retailers over a finite horizon. Neuro-dynamic programming (NDP) reduces the computational complexity of the solution algorithm from exponential to polynomial on the number of retailers.
Boolean-controlled systems via receding horizon and linear programing
2009
We consider dynamic systems controlled by boolean signals or decisions. We show that in a number of cases, the receding horizon formulation of the control problem can be solved via linear programing by relaxing the binary constraints on the control. The idea behind our approach is conceptually easy: a feasible control can be forced by imposing that the boolean signal is set to one at least one time over the horizon. We translate this idea into constraints on the controls and analyze the polyhedron of all feasible controls. We specialize the approach to the stabilizability of switched and impulsively controlled systems.
Robust optimality of linear saturated control in uncertain linear network flows
2008
We propose a novel approach that, given a linear saturated feedback control policy, asks for the objective function that makes robust optimal such a policy. The approach is specialized to a linear network flow system with unknown but bounded demand and politopic bounds on controlled flows. All results are derived via the Hamilton-Jacobi-Isaacs and viscosity theory.
ROBUST CONTROL STRATEGIES FOR MULTI—INVENTORY SYSTEMS WITH AVERAGE FLOW CONSTRAINTS
2006
Abstract In this paper we consider multi—inventory systems in presence of uncertain demand. We assume that i) demand is unknown but bounded in an assigned compact set and ii) the control inputs (controlled flows) are subject to assigned constraints. Given a long—term average demand, we select a nominal flow that feeds such a demand. In this context, we are interested in a control strategy that meets at each time all possible current demands and achieves the nominal flow in the average. We provide necessary and sufficient conditions for such a strategy to exist and we characterize the set of achievable flows. Such conditions are based on linear programming and thus they are constructive. In …
Improvement of Inventory Control under Parametric Uncertainty and Constraints
2011
The aim of the present paper is to show how the statistical inference equivalence principle (SIEP), the idea of which belongs to the authors, may be employed in the particular case of finding the effective statistical decisions for the multi-product inventory problems with constraints. To our knowledge, no analytical or efficient numerical method for finding the optimal policies under parametric uncertainty for the multi-product inventory problems with constraints has been reported in the literature. Using the (equivalent) predictive distributions, this paper represents an extension of analytical results obtained for unconstrained optimization under parametric uncertainty to the case of con…
Formulations for an inventory routing problem
2014
In this paper, we present and compare formulations for the inventory routing problem (IRP) where the demand of customers has to be served, over a discrete time horizon, by capacitated vehicles starting and ending their routes at a depot. The objective of the IRP is the minimization of the sum of inventory and transportation costs. The formulations include known and new mathematical programming formulations. Valid inequalities are also presented. The formulations are tested on a large set of benchmark instances. One of the most significant conclusions is that the formulations that use vehicle-indexed variables are superior to the more compact, aggregate formulations.
The inverse eigenvalue problem for a Hermitian reflexive matrix and the optimization problem
2016
The inverse eigenvalue problem and the associated optimal approximation problem for Hermitian reflexive matrices with respect to a normal {k+1}-potent matrix are considered. First, we study the existence of the solutions of the associated inverse eigenvalue problem and present an explicit form for them. Then, when such a solution exists, an expression for the solution to the corresponding optimal approximation problem is obtained.
Advanced techniques for solving groundwater and surface water problems in the context of inverse methods and climate change.
2021
[ES] El tema de la investigación se centra en técnicas avanzadas para manejar problemas de aguas subterráneas y superficiales relacionados con métodos inversos y cambio climático. Los filtros de Kalman, con especial atención en Ensemble Smoother with Multiple Data Assimilation (ES-MDA), se analizan y mejoran para la solución de diferentes tipos de problemas inversos. En particular, la principal novedad es la aplicación de estos métodos para la identificación de series temporales. La primera parte de la tesis, luego de la descripción del método, presenta el desarrollo de un software escrito en Python para la aplicación de la metodología propuesta. El software cuenta con un flujo de trabajo f…