In this paper, we address a basic production planning problem with price dependent demand and stochastic yield of production. We use price and target quantity as decision variables to lower the risk of low yield. The ...In this paper, we address a basic production planning problem with price dependent demand and stochastic yield of production. We use price and target quantity as decision variables to lower the risk of low yield. The value of risk control becomes more important especially for products with short life cycle. This is because, the profit implications of low yield might be unbearable in the short run. We apply Conditional Value at Risk （CVaR） to model the, risk. CVaR measure is a coherent risk measure and thereby having nice conceptual and mathematical underpinnings. It is also widely used in practice. We consider the problem under general demand function and general distribution function of yield and find sufficient conditions under which the problem has a unique local maximum. We also both analytically and numerically analyze the impact of parameter change on the optimal solution. Among our results, we analytically show that with increasing risk aversion, the optimal price increases. This relation is opposite to that of in Newsvendor problem where the uncertainty lies in demand side.展开更多
Under the new situation of reform and opening up. new theory and practices ofurban planning are in urgent demand The contents and work focus in this regard shouldalso be changed respectively.Urban planning should pay ...Under the new situation of reform and opening up. new theory and practices ofurban planning are in urgent demand The contents and work focus in this regard shouldalso be changed respectively.Urban planning should pay more attention to economic de-velopment and cultivation of service awareness. Its administration should also be suited tothe characteristics of market展开更多
Traditionally, heuristic re-planning algorithms are used to tackle the problem of dynamic task planning for multiple satellites. However, the traditional heuristic strategies depend on the concrete tasks, which often ...Traditionally, heuristic re-planning algorithms are used to tackle the problem of dynamic task planning for multiple satellites. However, the traditional heuristic strategies depend on the concrete tasks, which often affect the result’s optimality. Noticing that the historical information of cooperative task planning will impact the latter planning results, we propose a hybrid learning algorithm for dynamic multi-satellite task planning, which is based on the multi-agent reinforcement learning of policy iteration and the transfer learning. The reinforcement learning strategy of each satellite is described with neural networks. The policy neural network individuals with the best topological structure and weights are found by applying co-evolutionary search iteratively. To avoid the failure of the historical learning caused by the randomly occurring observation requests, a novel approach is proposed to balance the quality and efficiency of the task planning, which converts the historical learning strategy to the current initial learning strategy by applying the transfer learning algorithm. The simulations and analysis show the feasibility and adaptability of the proposed approach especially for the situation with randomly occurring observation requests.展开更多
文摘In this paper, we address a basic production planning problem with price dependent demand and stochastic yield of production. We use price and target quantity as decision variables to lower the risk of low yield. The value of risk control becomes more important especially for products with short life cycle. This is because, the profit implications of low yield might be unbearable in the short run. We apply Conditional Value at Risk （CVaR） to model the, risk. CVaR measure is a coherent risk measure and thereby having nice conceptual and mathematical underpinnings. It is also widely used in practice. We consider the problem under general demand function and general distribution function of yield and find sufficient conditions under which the problem has a unique local maximum. We also both analytically and numerically analyze the impact of parameter change on the optimal solution. Among our results, we analytically show that with increasing risk aversion, the optimal price increases. This relation is opposite to that of in Newsvendor problem where the uncertainty lies in demand side.
文摘Under the new situation of reform and opening up. new theory and practices ofurban planning are in urgent demand The contents and work focus in this regard shouldalso be changed respectively.Urban planning should pay more attention to economic de-velopment and cultivation of service awareness. Its administration should also be suited tothe characteristics of market
文摘Traditionally, heuristic re-planning algorithms are used to tackle the problem of dynamic task planning for multiple satellites. However, the traditional heuristic strategies depend on the concrete tasks, which often affect the result’s optimality. Noticing that the historical information of cooperative task planning will impact the latter planning results, we propose a hybrid learning algorithm for dynamic multi-satellite task planning, which is based on the multi-agent reinforcement learning of policy iteration and the transfer learning. The reinforcement learning strategy of each satellite is described with neural networks. The policy neural network individuals with the best topological structure and weights are found by applying co-evolutionary search iteratively. To avoid the failure of the historical learning caused by the randomly occurring observation requests, a novel approach is proposed to balance the quality and efficiency of the task planning, which converts the historical learning strategy to the current initial learning strategy by applying the transfer learning algorithm. The simulations and analysis show the feasibility and adaptability of the proposed approach especially for the situation with randomly occurring observation requests.
