检索结果-内蒙古大学图书馆

On the optimal control of manufacturing and remanufacturing activities with a single shared server

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2014年第1期234卷 86-98页

作者： Flapper, Simme Douwe Gayon, Jean-Philippe Lim, Lam Laurent Grenoble INP UJF Grenoble 1 CNRS G SCOP UMR5272 F-38031 Grenoble France Tech Univ Eindhoven NL-5600 MB Eindhoven Netherlands

We consider a single-product make-to-stock manufacturing-remanufacturing system. Returned products require remanufacturing before they can be sold. The manufacturing and remanufacturing operations are executed by the same single server, where switching from one activity to another does not involve time or cost and can be done at an arbitrary moment in time. Customer demand can be fulfilled by either newly manufactured or remanufactured products. The times for manufacturing and remanufacturing a product are exponentially distributed. Demand and used products arrive via mutually independent Poisson processes. Disposal of products is not allowed and all used products that are returned have to be accepted. Using Markov decision processes, we investigate the optimal manufacture-remanufacture policy that minimizes holding, backorder, manufacturing and remanufacturing costs per unit of time over an infinite horizon. For a subset of system parameter values we are able to completely characterize the optimal continuous-review dynamic preemptive policy. We provide an efficient algorithm based on quasi-birth-death processes to compute the optimal policy parameter values. For other sets of system parameter values, we present some structural properties and insights related to the optimal policy and the performance of some simple threshold policies. (C) 2013 Elsevier B.V. All rights reserved.

关键词： Manufacturing Remanufacturing Shared server Inventory control stochastic dynamic programming

来源：评论

学校读者我要写书评

暂无评论

A decision support system for mean-variance analysis in multi-period inventory control

引用

DECISION SUPPORT SYSTEMS 2014年第0期57卷 285-295页

作者： Basu, Preetam Nair, Suresh K. Indian Inst Management Calcutta Operat Management Grp Kolkata 700104 India Univ Connecticut Sch Business Operat & Informat Management Dept Storrs CT 06269 USA

Traditionally inventory management models have focused on risk-neutral decision making with the objective of maximizing the expected rewards or minimizing costs over a specified time horizon. However, for items marked by high demand volatility such as fashion goods and technology products, this objective needs to be balanced against the risk associated with the decision. Depending on how the product performs vis-a-vis the seller's original forecast, the seller could end up with losses due to either short or surplus supply. Unfortunately, traditional models do not address this issue. stochastic dynamic programming models have been extensively used for sequential derision making in the context of multi-period inventory management, but in the traditional way where one either minimizes costs or maximizes profits. Risk is implicitly considered by accounting for stock-out costs. Considering risk and reward simultaneously and explicitly in a stochastic dynamic setting is a cumbersome task and often difficult to implement for practical purposes, since dynamic programming is designed to optimize on one variable, not two. In this paper we develop an algorithm, Variance-Retentive stochastic dynamic programming that tracks variance as well as expected reward in a stochastic dynamic programming model for inventory control. We use the mean-variance solutions in a heuristic. RiskTrackr, to construct efficient frontiers which could be an ideal derision support tool for risk-reward analysis. (C) 2013 Elsevier B.V. All rights reserved.

关键词： stochastic dynamic programming Risk-reward heuristic Mean-variance analysis Efficient frontier analysis Inventory management

来源：评论

学校读者我要写书评

暂无评论

Generation Expansion Planning Considering Mass Penetration of Renewable Energy Generation and Supply Reliability

引用

ELECTRICAL ENGINEERING IN JAPAN 2014年第3期189卷 1-12页

作者： Manabe, Yusuke Hara, Ryoichi Kita, Hiroyuki Hokkaido Univ Sapporo Hokkaido 060 Japan Hokkaido Univ Grad Sch Informat Sci & Technol Sapporo Hokkaido 060 Japan Hokkaido Univ Grad Sch Engn Sapporo Hokkaido 060 Japan

In the future, renewable energy (RE) generation systems will be constructed and interconnected to the power system by nonutility entities such as generation companies and residential customers. Therefore, generation expansion planning (GEP) should consider the effects of RE generation. The purpose of this paper is to discuss the best GEP from the economic, supply reliability, and environmental aspects considering the penetration of RE generation. For this purpose, this paper proposes a model of a utility's GEP process considering RE generation. The proposed method is based on stochastic dynamic programming (SDP) in which long-term uncertainties are modeled by geometric Brownian motion (GBM) and the binomial lattice process. The variation of RE generation output due to the weather conditions (short-term uncertainty) is also considered in the proposed method by means of the net load curve.

关键词： generation expansion planning renewable energy reliability assessment uncertainty stochastic dynamic programming

来源：评论

学校读者我要写书评

暂无评论

Maximizing a new quantity in sequential reserve selection

引用

ENVIRONMENTAL CONSERVATION 2014年第2期41卷 198-205页

作者： Schapaugh, Adam W. Tyre, Andrew J. Univ Nebraska Sch Nat Resources Lincoln NE 68510 USA

The fundamental goal of conservation planning is biodiversity persistence, yet most reserve selection methods prioritize sites using occurrence data. Numerous empirical studies support the notion that defining and measuring objectives in terms of species richness (where the value of a site is equal to the number of species it contains, or contributes to an existing reserve network) can be inadequate for maintaining biodiversity in the long-term. An existing site-assessment framework that implicitly maximized the persistence probability of multiple species was integrated with a dynamic optimization model. The problem of sequential reserve selection as a Markov decision process was combined with stochastic dynamic programming to find the optimal solution. The approach represents a compromise between representation-based approaches (maximizing occurrences) and more complex tools, like spatially-explicit population models. The method, the inherent problems and interesting conclusions are illustrated with a land acquisition case study on the central Platte River.

关键词： reserve selection Bayesian network Markov decision process stochastic dynamic programming reserve adequacy

来源：评论

学校读者我要写书评

暂无评论

Coordination of manufacturing, remanufacturing and returns acceptance in hybrid manufacturing/remanufacturing systems

引用

INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS 2014年 148卷 62-70页

作者： Vercraene, Samuel Gayon, Jean-Philippe Flapper, Simme Douwe Inst Natl Sci Appl DISP F-69621 Villeurbanne France Grenoble INP UJF Grenoble 1 CNRS G SCOP UMR5272 F-38031 Grenoble France Tech Univ Eindhoven NL-5600 MB Eindhoven Netherlands

This paper deals with the coordination of manufacturing, remanufacturing and returns acceptance control in a hybrid production-inventory system. We use a queuing control framework, where manufacturing and remanufacturing are modelled by single servers with exponentially distributed processing times. Customer demand and returned products arrive in the system according to independent Poisson processes. A returned product can be either accepted or rejected. When accepted, a return is placed in a remanufacturable product inventory. Customer demand can be satisfied as well by new and remanufactured products. The following costs are included: stock keeping, backorder, manufacturing, remanufacturing, acceptance and rejection costs. We show that the optimal policy is characterized by two state-dependent base-stock thresholds for manufacturing and remanufacturing and one state-dependent return acceptance threshold. We also derive monotonicity results for these thresholds. Based on these theoretical results, we introduce several relevant heuristic control rules for manufacturing, remanufacturing and returns acceptance. In an extensive numerical study we compare these policies with the optimal policy and provide several insights. (C) 2013 Elsevier B.V. All rights reserved.

关键词： Remanufacturing Manufacturing Returns acceptance control Inventory control stochastic dynamic programming Optimal policy Heuristic policies

来源：评论

学校读者我要写书评

暂无评论

Optimal charging of an electric vehicle using a Markov decision process

引用

APPLIED ENERGY 2014年 123卷 1-12页

作者： Iversen, Emil B. Morales, Juan M. Madsen, Henrik Tech Univ Denmark DTU Compute DK-2800 Lyngby Denmark

The combination of electric vehicles and renewable energy is taking shape as a potential driver for a future free of fossil fuels. However, the efficient management of the electric vehicle fleet is not exempt from challenges. It calls for the involvement of all actors directly or indirectly related to the energy and transportation sectors, ranging from governments, automakers and transmission system operators, to the ultimate beneficiary of the change: the end-user. An electric vehicle is primarily to be used to satisfy driving needs, and accordingly charging policies must be designed primarily for this purpose. The charging models presented in the technical literature, however, overlook the stochastic nature of driving patterns. Here we introduce an efficient stochastic dynamic programming model to optimally charge an electric vehicle while accounting for the uncertainty inherent to its use. With this aim in mind, driving patterns are described by an inhomogeneous Markov model that is fitted using data collected from the utilization of an electric vehicle. We show that the randomness intrinsic to driving needs has a substantial impact on the charging strategy to be implemented. (C) 2014 Elsevier Ltd. All rights reserved.

关键词： Electric vehicles Driving patterns Optimal charging Markov processes stochastic dynamic programming

来源：评论

学校读者我要写书评

暂无评论

Active Classification for POMDPs: A Kalman-Like State Estimator

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 2014年第23期62卷 6209-6224页

作者： Zois, Daphney-Stavroula Levorato, Marco Mitra, Urbashi Univ So Calif Dept Elect Engn Los Angeles CA 90089 USA Univ Calif Irvine Donald Bren Sch Informat & Comp Sci Dept Comp Sci Irvine CA 92697 USA

The problem of state tracking with active observation control is considered for a system modeled by a discrete-time, finite-state Markov chain observed through conditionally Gaussian measurement vectors. The measurement model statistics are shaped by the underlying state and an exogenous control input, which influence the observations' quality. Exploiting an innovations approach, an approximate minimum mean-squared error (MMSE) filter is derived to estimate the Markov chain system state. To optimize the control strategy, the associated mean-squared error is used as an optimization criterion in a partially observable Markov decision process formulation. A stochastic dynamic programming algorithm is proposed to solve for the optimal solution. To enhance the quality of system state estimates, approximate MMSE smoothing estimators are also derived. Finally, the performance of the proposed framework is illustrated on the problem of physical activity detection in wireless body sensing networks. The power of the proposed framework lies within its ability to accommodate a broad spectrum of active classification applications, including sensor management for object classification and tracking, estimation of sparse signals, and radar scheduling.

关键词： Active classification controlled sensing active state tracking partially observable Markov decision processes (POMDP) nonlinear POMDPs Kalman-like filter Kalman-like smoothers innovations approach approximate MMSE estimation stochastic dynamic programming discrete state Markov chains Martingale difference sequence body sensing network application

来源：评论

学校读者我要写书评

暂无评论

FULLY POLYNOMIAL TIME APPROXIMATION SCHEMES FOR stochastic dynamic PROGRAMS

引用

SIAM JOURNAL ON DISCRETE MATHEMATICS 2014年第4期28卷 1725-1796页

作者： Halman, Nir Klabjan, Diego Li, Chung-Lun Orlin, James Simchi-Levi, David Hebrew Univ Jerusalem Jerusalem Israel MIT Cambridge MA 02139 USA Northwestern Univ Evanston IL 60208 USA Hong Kong Polytech Univ Hong Kong Hong Kong Peoples R China

We present a framework for obtaining fully polynomial time approximation schemes (FPTASs) for stochastic univariate dynamic programs with either convex or monotone single-period cost functions. This framework is developed through the establishment of two sets of computational rules, namely, the calculus of K-approximation functions and the calculus of K-approximation sets. Using our framework, we provide the first FPTASs for several NP-hard problems in various fields of research such as knapsack models, logistics, operations management, economics, and mathematical finance. Extensions of our framework via the use of the newly established computational rules are also discussed.

关键词： fully polynomial time approximation schemes stochastic dynamic programming K-approximation

来源：评论

学校读者我要写书评

暂无评论

Optimal and robust strategies for freeway traffic management under demand and supply uncertainties: an overview and general theory

引用

TRANSPORTMETRICA A-TRANSPORT SCIENCE 2014年第10期10卷 849-877页

作者： Zhong, R. X. Sumalee, A. Pan, T. L. Lam, William H. K. Sun Yat Sen Univ Sch Engn Res Ctr Intelligent Transportat Guangzhou 510275 Guangdong Peoples R China Hong Kong Polytech Univ Dept Civil & Environm Engn Hong Kong Hong Kong Peoples R China King Mongkuts Inst Technol Ladkrabang Dept Civil Engn Bangkok Thailand Beijing Jiaotong Univ Sch Traff & Transportat Beijing Peoples R China

This paper investigates optimal decision-making for traffic management under demand and supply uncertainties by stochastic dynamic programming. Traffic flow dynamics under demand and supply uncertainties is described by a simplified version of the stochastic cell transmission model. Based on this model, the optimal traffic management problem is analysed wherein the existence of solution is guaranteed by verifying the well-posed condition. An analytical optimal control law is derived in terms of a set of coupled generalised recursive Riccati equations. As optimal control laws may be fragile with respect to model misspecification, a robust (optimal) decision-making law that aims to act robust with respect to the parameter misspecification in the traffic flow model (which can be originated from model calibration), and to attenuate the effect of disturbances in freeway networks (wherein demand uncertainty is usually regarded as a kind of disturbance) is proposed. Conventionally, network uncertainties have been considered to induce negative effects on traffic management in transportation literature. In contrast, the proposed methodology outlines an interesting issue that is to make benefit (or trade-off) from the inherent network uncertainties. Finally, some practical issues in traffic management that can be addressed by extending the current framework are briefly discussed.

关键词： optimal traffic management stochastic dynamic programming robustness approximate dynamic programming ramp metering dynamic pricing

来源：评论

学校读者我要写书评

暂无评论

Optimal management of DC pension plan in a stochastic interest rate and stochastic volatility framework

引用

INSURANCE MATHEMATICS & ECONOMICS 2014年第1期57卷 58-66页

作者： Guan, Guohui Liang, Zongxia Tsinghua Univ Dept Math Sci Beijing 100084 Peoples R China

This paper investigates an optimal investment strategy of DC pension plan in a stochastic interest rate and stochastic volatility framework. We apply an affine model including the Cox-Ingersoll-Ross (CIR) model and the Vasicek mode to characterize the interest rate while the stock price is given by the Heston's stochastic volatility (SV) model. The pension manager can invest in cash, bond and stock in the financial market. Thus, the wealth of the pension fund is influenced by the financial risks in the market and the stochastic contribution from the fund participant. The goal of the fund manager is, coping with the contribution rate, to maximize the expectation of the constant relative risk aversion (CRRA) utility of the terminal value of the pension fund over a guarantee which serves as an annuity after retirement. We first transform the problem into a single investment problem, then derive an explicit solution via the stochastic programming method. Finally, the numerical analysis is given to show the impact of financial parameters on the optimal strategies. (C) 2014 Elsevier B.V. All rights reserved.

关键词： Defined contribution pension plan CRRA utility stochastic dynamic programming stochastic interest rate stochastic volatility stochastic contribution rate Minimum guarantee

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：