Operations Research

最新文章

• Approximation Algorithms for Product Framing and Pricing AI翻译
  作者：Gallego, Guillermo; Li, Anran; Van-Anh Truong; Wang, Xinshang
  作者单位：Hong Kong University of Science & Technology; University of London; London School Economics & Political Science; Columbia University; Alibaba Group; Shanghai Jiao Tong University
  摘要：We propose one of the first models of product framing and pricing. Product framing refers to the way consumer choice is influenced by how the products are framed or displayed. We present a model in which a set of products is displayed or framed into a set of virtual web pages. We assume that consumers consider only products in the top pages with different consumers willing to see different numbers of pages. Consumers select a product, if any, from these pages following a general choice model. ...
• Time Inconsistency of Optimal Policies of Distributionally Robust Inventory Models AI翻译
  作者：Shapiro, Alexander; Xin, Linwei
  作者单位：University System of Georgia; Georgia Institute of Technology; University of Chicago
  摘要：In this paper, we investigate optimal policies of distributionally robust (risk averse) inventory models. We demonstrate that if the respective risk measures are not strictly monotone, then there may exist infinitely many optimal policies that are not basestock and not time consistent. This is in a sharp contrast with the risk neutral formulation of the inventory model where all optimal policies are time consistent. This also extends previous studies of time inconsistency in the robust setting.
• When Risk Perception Gets in the Way: Probability Weighting and Underprevention AI翻译
  作者：Baillon, Aurelien; Bleichrodt, Han; Emirmahmutoglu, Aysil; Jaspersen, Johannes; Peter, Richard
  作者单位：Erasmus University Rotterdam - Excl Erasmus MC; Erasmus University Rotterdam; Australian National University; Norwegian School of Economics (NHH); University of Munich; University of Iowa
  摘要：Personal decisions about health hazards are the main cause of impaired health and premature death. People smoke and eat too much, and they exercise too little. The lack of preventive efforts is surprising given their proven effectiveness. In the early 1960s, Arrow suggested that moral hazard might be a reason for underprevention, but this explanation was later challenged. In this paper, we show that underprevention might be caused by misperceived probabilities. We derive when and how probabili...
• Pseudo-Valid Cutting Planes for Two-Stage Mixed-Integer Stochastic Programs with Right-Hand-Side Uncertainty AI翻译
  作者：Romeijnders, Ward; van der Laan, Niels
  作者单位：University of Groningen
  摘要：We propose a novel way of applying cutting plane techniques to two-stage mixed-integer stochastic programs with uncertainty in the right-hand side. Instead of using cutting planes that are always valid, our idea is to apply pseudo-valid cutting planes to the second-stage feasible regions that may cut away feasible integer second-stage solutions for some scenarios and may be overly conservative for others. The advantage is that it allows us to use cutting planes that are affine in the first-sta...
• Near-Optimal Disjoint-Path Facility Location Through Set Cover by Pairs AI翻译
  作者：Johnson, David S.; Breslau, Lee; Diakonikolas, Ilias; Duffield, Nick; Gu, Yu; Hajiaghayi, MohammadTaghi; Karloff, Howard; Resende, Mauricio G. C.; Sen, Subhabrata
  作者单位：AT&T; University of Wisconsin System; University of Wisconsin Madison; Texas A&M University System; Texas A&M University College Station; Amazon.com; University System of Maryland; University of Maryland College Park; Amazon.com; University of Washington; University of Washington Seattle; Nokia Corporation; Nokia Bell Labs; AT&T
  摘要：In this paper, we consider two special cases of the cover-by-pairs optimization problem that arises when we need to place facilities so that each customer is served by two facilities that reach it by disjoint shortest paths. These problems arise in a network trafficmonitoring scheme proposed by Breslau et al. and have potential applications to content distribution. The set-disjoint variant applies to networks that use the open shortest path first routing protocol, and the path-disjoint variant...
• Adaptive Submodular Ranking and Routing AI翻译
  作者：Navidi, Fatemeh; Kambadur, Prabhanjan; Nagarajan, Viswanath
  作者单位：University of Michigan System; University of Michigan; Bloomberg L.P.
  摘要：We study a general stochastic ranking problem in which an algorithm needs to adaptively select a sequence of elements so as to cover a random scenario (drawn from a known distribution) at minimum expected cost. The coverage of each scenario is captured by an individual submodular function, in which the scenario is said to be covered when its function value goes above a given threshold. We obtain a logarithmic factor approximation algorithm for this adaptive ranking problem, which is the best p...
• Modeling and Design of Container Terminal Operations AI翻译
  作者：Roy, Debjit; De Koster, Rene; Bekker, Rene
  作者单位：Indian Institute of Management (IIM System); Indian Institute of Management Ahmedabad; Erasmus University Rotterdam; Erasmus University Rotterdam - Excl Erasmus MC; Vrije Universiteit Amsterdam
  摘要：The design of container terminal operations is complex because multiple factors affect operational performance. These factors include numerous choices for handling technology, terminal topology, and design parameters and stochastic interactions between the quayside, stackside, and vehicle transport processes. In this research, we propose new integrated queuing network models for rapid design evaluation of container terminals with automated lift vehicles and automated guided vehicles. These mod...
• Capacity Analysis of Sequential Zone Picking Systems AI翻译
  作者：van der Gaast, Jelmer P.; de Koster, Rene B. M.; Adan, Ivo J. B. F.; Resing, Jacques A. C.
  作者单位：Fudan University; Erasmus University Rotterdam; Erasmus University Rotterdam - Excl Erasmus MC
  摘要：This paper develops a capacity model for sequential zone picking systems. These systems are popular internal transport and order-picking systems because of their scalability, flexibility, high-throughput ability, and fit for use for a wide range of products and order profiles. The major disadvantage of such systems is congestion and blocking under heavy use, leading to long order throughput times. To reduce blocking and congestion, most systems use the block-and-recirculate protocol to dynamic...
• Input Efficiency Measures: A Generalized, Encompassing Formulation AI翻译
  作者：Briec, Walter; Cavaignac, Laurent; Kerstens, Kristiaan
  作者单位：Universite Perpignan Via Domitia; Universite Perpignan Via Domitia; Centre National de la Recherche Scientifique (CNRS); CNRS - Institute for Humanities & Social Sciences (INSHS); IESEG School of Management; Universite de Lille
  摘要：This contribution defines a new generalized input efficiency measure which encompasses and thus links four well-known input efficiency measures: the Debreu-Farrell measure, the Fare-Lovell measure, the asymmetric Fare measure, and the multiplicative Fare-Lovell measure. The axiomatic properties of this new measure are studied. The generalized input efficiency measure naturally leads to the definition of new measures as special cases. It also provides a general framework for testing the choice ...
• Interior-Point-Based Online Stochastic Bin Packing AI翻译
  作者：Gupta, Varun; Radovanovic, Ana
  作者单位：University of Chicago; Alphabet Inc.; Google Incorporated
  摘要：Bin packing is an algorithmic problem that arises in diverse applications such as remnant inventory systems, shipping logistics, and appointment scheduling. In its simplest variant, a sequence of T items (e.g., orders for raw material, packages for delivery) is revealed one at a time, and each item must be packed on arrival in an available bin (e.g., remnant pieces of raw material in inventory, shipping containers). The sizes of items are independent and identically distributed (i.i.d.) sample...