-
作者：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...
-
作者：Adelman, Daniel; Uckun, Canan
作者单位：University of Chicago; University of Illinois System; University of Illinois Chicago; University of Illinois Chicago Hospital
摘要：With the rapid growth in residential smart meters across the United States in recent years, most homes in the United States will soon be capable of moving to time-varying prices for electricity. We develop a methodology for studying the welfare impacts of different pricing strategies on an electricity market when homes deploy smart, price-responsive appliances with forward-looking capabilities. Without assuming any functional form for dynamic prices, we show conditions under which asymptotical...
-
作者：Lamorgese, Leonardo; Mannino, Carlo
作者单位：SINTEF; University of Oslo
摘要：A central problem in traffic management is that of scheduling the movements of vehicles so as to minimize the cost of the schedule. It arises in important applications such as train timetabling, rescheduling, delay and disruption management, airplane surface routing, runway scheduling, air-traffic control, and more. This problem can be modeled as a job-shop scheduling problem. We introduce a new mixed-integer linear program (MILP) formulation for job-shop scheduling, which is an alternative to...
-
作者：Agrawal, Shipra; Avadhanula, Vashist; Goyal, Vineet; Zeevi, Assaf
作者单位：Columbia University; Columbia University
摘要：We consider a dynamic assortment selection problem where in every round the retailer offers a subset (assortment) of N substitutable products to a consumer, who selects one of these products according to a multinomial logit (MNL) choice model. The retailer observes this choice, and the objective is to dynamically learn the model parameters while optimizing cumulative revenues over a selling horizon of length T. We refer to this exploration-exploitation formulation as the MNL-Bandit problem. Ex...
-
作者：Chen, Xi; Ma, Tengyu; Zhang, Jiawei; Zhou, Yuan
作者单位：New York University; Facebook Inc; New York University; New York University; NYU Shanghai; Indiana University System; Indiana University Bloomington; University of Illinois System; University of Illinois Urbana-Champaign
摘要：Process flexibility is widely adopted as an effective strategy for responding to uncertain demand. Many algorithms for constructing sparse flexibility designs with good theoretical guarantees have been developed for balanced and symmetrical production systems. These systems assume that the number of plants equals the number of products, that supplies have the same capacity, and that demands are independently and identically distributed. In this paper we relax these assumptions and consider a g...
-
作者：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...
-
作者：Chen, Yiwei; Shi, Cong
作者单位：University System of Ohio; University of Cincinnati; University of Michigan System; University of Michigan
摘要：We consider a model wherein the seller sells a product to customers over an infinite horizon. At each time, the seller decides a set of purchase options offered to customers and the inventory replenishment quantity. Each purchase option specifies a price and a product delivery time. Customers are infinitesimal and arrive to the system with a constant rate. Customer product valuations are heterogenous and follow a stationary distribution. Customers' arrival times and product valuations are thei...
-
作者：Luebbecke, Elisabeth; Luebbecke, Marco E.; Moehring, Rolf H.
作者单位：RWTH Aachen University; Technical University of Berlin; Beijing University of Technology
摘要：We introduce a hard practical optimization problem, the ship traffic control problem (STCP). We study it at the Kiel Canal, which is the most frequented artificial waterway in the world. The canal is operated bidirectionally, but large ships can pass each other only in sidings. Decisions must be made about who is waiting for whom, where, and for how long, subject to a multitude of operational constraints. The objective is to minimize the total waiting times of all ships. This problem generaliz...
-
作者：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 ...
-
作者：Lam, Henry
作者单位：Columbia University
摘要：We investigate the use of distributionally robust optimization (DRO) as a tractable tool to recover the asymptotic statistical guarantees provided by the central limit theorem, for maintaining the feasibility of an expected value constraint under ambiguous probability distributions. We show that using empirically defined Burg-entropy divergence balls to construct the DRO can attain such guarantees. These balls, however, are not reasoned from the standard data-driven DRO framework because, by t...
