-
作者：Ban, Gah-Yi; Rudin, Cynthia
作者单位：University of London; London Business School; Duke University
摘要：We investigate the data-driven newsvendor problem when one has n observations of p features related to the demand as well as historical demand data. Rather than a two-step process of first estimating a demand distribution then optimizing for the optimal order quantity, we propose solving the big data newsvendor problem via singlestep machine-learning algorithms. Specifically, we propose algorithms based on the empirical risk minimization (ERM) principle, with and without regularization, and an...
-
作者：Bensoussan, Alain; Chevalier-Roignant, Benoit
作者单位：University of Texas System; University of Texas Dallas; City University of Hong Kong; University of London; King's College London
摘要：This paper considers a firm's capacity expansion decisions under uncertainty. The firm has leeway in timing investments and in choosing how much capacity to install at each investment time. We model this problem as the sequential exercising of compound capacity expansion options with embedded optimal capacity choices. We employ the impulse control methodology and obtain a quasi-variational inequality that involves two state variables: an exogenous, stochastic price process and a controlled cap...
-
作者：Farahat, Amr; Huh, Woonghee Tim; Li, Hongmin
作者单位：Washington University (WUSTL); University of British Columbia; Arizona State University; Arizona State University-Tempe
摘要：We study a two-stage deterministic differentiated-product oligopoly competition game, called the quantity precommitment game, in which firms compete on quantity in the first stage and then compete on price in the second stage. We compare this game with a single-stage Cournot game, in which firms compete on quantity only and prices are set to clear the market. We show that any equilibrium of the quantity precommitment game is an equilibrium of the Cournot game under certain conditions that allo...
-
作者：Whitt, Ward; Zhang, Xiaopei
作者单位：Columbia University
摘要：Motivated by our recent study of patient flow data from an Israeli emergency department (ED), we establish a sample path periodic Little's law (PLL), which extends the sample path Little's law (LL). The ED data analysis led us to propose a periodic stochastic process to represent the aggregate ED occupancy level, with the length of a periodic cycle being 1 week. Because we conducted the ED data analysis over successive hours, we construct our PLL in discrete time. The PLL helps explain the rem...
-
作者：Fare, Rolf; He, Xinju; Li, Sungko; Zelenyuk, Valentin
作者单位：Oregon State University; Hong Kong Baptist University; University of Queensland; University of Queensland
摘要：Measuring profit efficiency is a challenging task, and many different approaches have been suggested. This paper synthesizes existing approaches and develops a general Farrell-type approach of the profit efficiency measurement. Our derivations unveil new and useful relationships between existing measures and the proposed new Farrell-type measures. In addition, this helps us establish a generalized and unifying framework for studying efficiency behavior of firms, where the profit efficiency mea...
-
作者：Cruise, James; Flatley, Lisa; Gibbens, Richard; Zachary, Stan
作者单位：Heriot Watt University; University of Warwick; University of Cambridge
摘要：We study the control of large-scale energy storage operating in a market. Reoptimization of deterministic models is a common pragmatic approach when prices are stochastic. We apply Lagrangian theory to develop such a model and to establish decision and forecast horizons when storage trading affects these prices, an important aspect of some energy markets. The determination of these horizons also provides a simple and efficient algorithm for the determination of the optimal control. The forecas...
-
作者：Bertsimas, Dimitris; Jaillet, Patrick; Martin, Sebastien
作者单位：Massachusetts Institute of Technology (MIT)
摘要：With the emergence of ride-sharing companies that offer transportation on demand at a large scale and the increasing availability of corresponding demand data sets, new challenges arise to develop routing optimization algorithms that can solve massive problems in real time. In this paper, we develop an optimization framework, coupled with a novel and generalizable backbone algorithm, that allows us to dispatch in real time thousands of taxis serving more than 25,000 customers per hour. We prov...
-
作者：Ryzhov, Ilya O.; Mes, Martijn R. K.; Powell, Warren B.; van den Berg, Gerald
作者单位：University System of Maryland; University of Maryland College Park; University System of Maryland; University of Maryland College Park; University of Twente; Princeton University
摘要：Approximate dynamic programming (ADP) is a general methodological framework for multistage stochastic optimization problems in transportation, finance, energy, and other domains. We propose a new approach to the exploration/exploitation dilemma in ADP that leverages two important concepts from the optimal learning literature: first, we show how a Bayesian belief structure can be used to express uncertainty about the value function in ADP; second, we develop a new exploration strategy based on ...
-
作者：Eisenhandler, Ohad; Tzur, Michal
作者单位：Tel Aviv University
摘要：Food rescue-the collection of perishable products from food suppliers who are willing to make donations, and their distribution to welfare agencies that serve individuals in need-has become increasingly widespread in recent years. This phenomenon is a result of economic crises, but it is also encouraged by the tax and good image it provides to donor companies. The problem we study in this paper focuses on the logistic challenges of a food bank that on a daily basis uses vehicles of limited cap...
-
作者：Bolandnazar, Mohammadreza; Huh, Woonghee Tim; McCormick, S. Thomas; Murota, Kazuo
作者单位：Columbia University; University of British Columbia; Tokyo Metropolitan University
摘要：One of the main results of Order-Based Cost Optimization in Assemble-toOrder Systems [Lu Y, Song J-S (2005) Order-based cost optimization in assemble-to-order systems. Oper. Res. 53(1):151-169] is proposition 1(c), which states that the cost function of an assemble-to-order inventory system satisfies a discrete convexity property called L-(sic)-convexity. We construct a counterexample showing that this result is incorrect, and hence their proposed steepest decent algorithm may not work.
