A partial robust optimization approach to inventory management for the offline-to-online problem under different selling prices

This study examines an optimal inventory strategy when a retailer markets a product at different selling prices through a dual-channel supply chain, comprising an online channel and an offline channel. Using the operating pattern of the offline-to-online (O2O) business model, we develop a partial robust optimization (PRO) model. Then, we provide a closed-form solution when only the mean and standard deviation of the online channel demand distribution is known and the offline channel demand follows a uniform distribution (partial robust). Specifically, owing to the good structural properties of the solution, we obtain a heuristic ordering formula for the general distribution case (i.e., the offline channel demand follows a general distribution). In addition, a series of numerical experiments prove the rationality of our conjecture. Moreover, after comparing our solution with other possible policies, we conclude that the PRO approach improves the performance of incorporating the internet into an existing supply chain and, thus, is able to adjust the level of conservativeness of the solution. Finally, in a degenerated situation, we compare our PRO approach with a combination of information approach. The results show that the PRO approach has more “robust” performance. As a result, a reasonable trade-off between robustness and performance is achieved.     

A differential game model for a developing and a developed country

A differential game (DG) model for a developing and a developed country is considered. Each player makes decisions about how much resource to be used to restrict the opponent's development so as to maximize his weighted sum of current consumption and final output. Current consumption is assumed to be preferred to final output for both players. The developing country is assumed to have a higher economic growth rate and a higher preference to final output, whereas the developed country is assumed to have a higher initial income and a higher efficiency in restricting his opponent. This problem is investigated under three kinds of information structures, i.e., a zerosum, a nonzero-sum, and a Stackelberg game. Open-loop equilibrium solutions are obtained for all the three cases. Economic implications of the result are provided. The research is supported by the National Natural Science Foundation of China under Grant Nos. 70771118 and 70371030 and the Scientific Research Foundation for the Returned Overseas Chinese Scholars, State Education Ministry under Grant No. 2006.331.     

基于扩展量测的球坐标系中水下目标跟踪算法的研究

基于自适应高斯模型，提出了球坐标系中扩展量测的水下目标跟踪，导出了目标模型和目标运动状态的坐标转换公式，推导了基于扩展量测的球坐标系目标跟踪算法，给出了Monte carlo仿真结果。结果表明：本文提出的跟踪算法不但能够提高目标距离的稳态跟踪精度，而且能够提高目标方位角和俯仰角的稳态跟踪精度，改善系统的动态收敛特性。     

基于改进PID神经网络算法的AUV垂直面控制

针对一类小型低速自主水下航行器(AUV)的垂直面运动控制问题,设计了一种改进的PID神经网络控制器,实现对水下航行器在垂直面内深度和俯仰角的全局控制。利用REMUS水下航行器模型搭建了Simulink下AUV垂直面仿真控制系统,仿真结果表明,改进的控制方法克服了原方法中饱和区过大的问题,具有良好的动态性能同时能够适应不同的学习速率和网络初始权重,对水下航行器的工程实际应用具有一定参考价值。     

考虑避灾心理和灾害影响的疏散仿真方法

在在灾害发生时,安全高效的疏散人群是提高公共安全的重要保障。因此有效可行的疏散仿真方法具有深刻的理论和现实意义。当前主流方法较少考虑与疏散相关的灾害动态演化,为此提出了DERR(Dynamic Evacuation Route Replanning Based on Psychology)方法。DERR方法围绕人群的避灾心理参数进行相关研究,利用A*寻路算法,实时根据灾害区的变化对人群的疏散路径重新规划和优化,以达到更加安全疏散的目的。通过仿真实验展示了本方法在灾害演化下的疏散模拟过程,同时心理避灾参数的加入也使得仿真结果更加贴合现实。     

GROUP SIZE AND PARALLELISM EFFECTS IN TASKS WITHHETEROGENEOUS LEVELS OF DIFFICULTY：A STOCHASTIC ORDER APPROACH

We consider tasks where in order to perform them it is sufficient that one member of a group will know how to do it. We are interested in the effect of task difficulty, and variability of that difficulty, on group performance, and in particular on the marginal contribution of an additional number to the performance of groups of different size. We explore the implications of various stochastic orders over task difficulty and variability. Some intuitive conjectures are shown to be false.     

GROUP-BUYING ONLINE AUCTION AND OPTIMAL INVENTORY POLICY IN UNCERTAIN MARKET

In this paper we consider a group-buying online auction (GBA) model for a monopolistic manufacturer selling novel products in the uncertain market. Firstly, we introduce the bidder's dominant strategy, after which we optimize the GBA price curve and the production volume together. Finally, we compare the GBA with the traditional posted pricing mechanism and find that the GBA is highly probable to be advantageous over the posted pricing mechanism in some appropriate market environments.     

AUTOMATIC DECISION-MAKING： NEURAL FIRING AND RESPONSE

1. Introduction This is the fourth exposition on theAnalytic Hierarchy Process. It is true thatmany decisions we make subconsciously ariseout of our physical and biological needs andderive from the pressure to survive physically.We also make subconsciou…     

THE PERIODIC CAPACITATED ARC ROUTING PROBLEM LINEAR PROGRAMMING MODEL, METAHEURISTIC AND LOWER BOUNDS

1. Introduction The Capacitated Arc Routing Problem(CARP) is defined on an undirected network inwhich a fleet of identical vehicles with limitedcapacity is based at a depot node. Each edge hasa non-negative traversal cost and can betraversed any number…     

STUDIES ON HORIZONTAL COMPETITION AMONG HOMOGENOUS RETAILERS THROUGH AGENT-BASED SIMULATION

1. Introduction A supply chain is a network composed osuppliers, manufacturers, retailers, etc., whichcooperate to offer a kind of goods or servicesThese supply chain members cooperate andcompete with each other to maximize theiown profits. For example,…