Periodic Storage Control Problem
نویسندگان
چکیده
Considering a reservoir with periodic states and different cost functions with penalty, its release rules can be modeled as a periodic Markov decision process (PMDP). First, we prove that policyiteration algorithm also works for the PMDP. Then, with policyiteration algorithm, we obtain the optimal policies for a special aperiodic reservoir model with two cost functions under large penalty and give a discussion when the penalty is small. keywords—periodic Markov decision process, periodic state, policy-iteration algorithm.
منابع مشابه
A Multi-Periodic Multi-Product Inventory Control Problem with Discount: GA Optimization Algorithm
In this article, a finite horizon, multi product and multi period economic order quantity like seasonal items is considered where demand rate is deterministic and known but variable in each period. The order quantities of items come in batch sizes and the end of the period order quantity and, consequently, demand of customers are zero. In addition, storage space is constrained and the problem...
متن کاملDesign of noise and period-time robust high-order repetitive control, with application to optical storage
Repetitive control is useful if periodic disturbances or setpoints act on a control system. Perfect (asymptotic) disturbance rejection is achieved if the period time is exactly known. The improved disturbance rejection at the periodic frequency and its harmonics is achieved at the expense of a degraded system sensitivity at intermediate frequencies. A convex optimization problem is defined for ...
متن کاملPole Assignment Of Linear Discrete-Time Periodic Systems In Specified Discs Through State Feedback
The problem of pole assignment, also known as an eigenvalue assignment, in linear discrete-time periodic systems in discs was solved by a novel method which employs elementary similarity operations. The former methods tried to assign the points inside the unit circle while preserving the stability of the discrete time periodic system. Nevertheless, now we can obtain the location of eigenvalues ...
متن کاملEfficient Method for Periodic Task Scheduling with Storage Requirement Minimization
In this paper, we study an efficient approximate integer linear programming formulation of the general problem of one-dimensional periodic task scheduling under storage requirement, irrespective of machine constraints. We have already presented in [8] a theoretical framework that allows an optimal optimization of periodic storage requirement in a periodic schedule. This problem is used to optim...
متن کاملA particle swarm optimization method for periodic vehicle routing problem with pickup and delivery in transportation
In this article, multiple-product PVRP with pickup and delivery that is used widely in goods distribution or other service companies, especially by railways, was introduced. A mathematical formulation was provided for this problem. Each product had a set of vehicles which could carry the product and pickup and delivery could simultaneously occur. To solve the problem, two meta-heuristic methods...
متن کامل