6期

最新文章

• Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows AI翻译
  作者：Desaulniers, Guy; Errico, Fausto; Irnich, Stefan; Schneider, Michael
  作者单位：Universite de Montreal; Polytechnique Montreal; Universite de Montreal; University of Quebec; Ecole de Technologie Superieure - Canada; Universite de Montreal; Universite de Montreal; Johannes Gutenberg University of Mainz; RWTH Aachen University
  摘要：Effective route planning for battery electric commercial vehicle (ECV) fleets has to take into account their limited autonomy and the possibility of visiting recharging stations during the course of a route. In this paper, we consider four variants of the electric vehicle-routing problem with time windows: (i) at most a single recharge per route is allowed, and batteries are fully recharged on visit of a recharging station; (ii) multiple recharges per route, full recharges only; (iii) at most ...
• Strong SOCP Relaxations for the Optimal Power Flow Problem AI翻译
  作者：Kocuk, Burak; Dey, Santanu S.; Sun, X. Andy
  作者单位：University System of Georgia; Georgia Institute of Technology
  摘要：This paper proposes three strong second order cone programming (SOCP) relaxations for the AC optimal power flow (OPF) problem. These three relaxations are incomparable to each other and two of them are incomparable to the standard SDP relaxation of OPF. Extensive computational experiments show that these relaxations have numerous advantages over existing convex relaxations in the literature: (i) their solution quality is extremely close to that of the standard SDP relaxation (the best one is w...
• Patrolling a Border AI翻译
  作者：Papadaki, Katerina; Alpern, Steve; Lidbetter, Thomas; Morton, Alec
  作者单位：University of London; London School Economics & Political Science; University of Warwick; Rutgers University System; Rutgers University New Brunswick; Rutgers University Newark; University of Strathclyde
  摘要：Patrolling games were recently introduced to model the problem of protecting the nodes of a network from an attack. Time is discrete and in each time unit the Patroller can stay at the same node or move to an adjacent node. The Attacker chooses when to attack and which node to attack and needs m consecutive time units to carry it out. The Attacker wins if the Patroller does not visit the chosen node while it is being attacked; otherwise, the Patroller wins. This paper studies the patrolling ga...
• Continuous-Review (R, nQ) Policies for Inventory Systems with Dual Delivery Modes AI翻译
  作者：Zhou, Sean X.; Yang, Chaolin
  作者单位：Chinese University of Hong Kong; Shanghai University of Finance & Economics
  摘要：We study a continuous-review, infinite-horizon inventory system with compound Poisson demand and dual sourcing/delivery modes. Ordering from either source/mode incurs a fixed cost and the expedited mode provides a shorter lead time than the regular mode. As the optimal ordering policy is unknown, while expected to be very complicated, we propose a class of simple policies called single-index (R, nQ) policies-when ordering from each mode, based on the inventory position, the system follows an (...
• The Cost of Free Spectrum AI翻译
  作者：Thanh Nguyen; Zhou, Hang; Berry, Randall A.; Honig, Michael L.; Vohra, Rakesh
  作者单位：Purdue University System; Purdue University; Northwestern University; University of Pennsylvania; University of Pennsylvania
  摘要：There has been growing interest in increasing the amount of radio spectrum available for unlicensed broadband wireless access. That includes prime spectrum at lower frequencies, which is also suitable for wide area coverage by licensed cellular providers. While additional unlicensed spectrum would allow for market expansion, it could influence competition among providers and increase congestion (interference) among consumers of wireless services. We study the value (social welfare and consumer...
• Least Squares Approximation to the Distribution of Project Completion Times with Gaussian Uncertainty AI翻译
  作者：Zheng, Zhichao; Natarajan, Karthik; Teo, Chung-Piaw
  作者单位：Singapore Management University; Singapore University of Technology & Design; National University of Singapore
  摘要：This paper is motivated by the following question: How to construct good approximation for the distribution of the solution value to linear optimization problem when the random objective coefficients follow a multivariate normal distribution? Using Stein's Identity, we show that the least squares normal approximation of the random optimal value can be computed by estimating the persistency values of the corresponding optimization problem. We further extend our method to construct a least squar...
• Supply Chain Coordination with Multiple Shipments: The Optimal Inventory Subsidizing Contracts AI翻译
  作者：Chen, Shi; Lee, Hau; Moinzadeh, Kamran
  作者单位：University of Washington; University of Washington Seattle; Stanford University
  摘要：We study a supply chain involving a supplier-retailer relationship. When production lead-time is long and the selling season is short, the retailer has to place an order ahead of the season, which resembles the classical Newsvendor model. However, we consider the situation when the supplier agrees to deliver the order in multiple shipments in the season, and then the retailer needs to determine the quantity and/or timing of each shipment. Under a centralized setting, we derive the optimal quan...
• Optimal Mechanism Design for a Sequencing Problem with Two-Dimensional Types AI翻译
  作者：Hoeksma, Ruben; Uetz, Marc
  作者单位：Universidad de Chile; University of Twente
  摘要：We study the design of mechanisms for a sequencing problem where the types of job-agents consist of processing times and waiting costs that are private to the jobs. In the Bayes-Nash setting, we seek to find a sequencing rule and incentive compatible payments that minimize the total expected payments that have to be made to the agents. It is known that the problem can be efficiently solved when jobs have single-dimensional types. Here, we address the problem with two-dimensional types. We show...
• Indifference-Zone-Free Selection of the Best AI翻译
  作者：Fan, Weiwei; Hong, L. Jeff; Nelson, Barry L.
  作者单位：Chinese Academy of Sciences; University of Science & Technology of China, CAS; City University of Hong Kong; City University of Hong Kong; Northwestern University
  摘要：Many procedures have been proposed in the literature to select the simulated alternative with the best mean performance from a finite set of alternatives. Among these procedures, frequentist procedures are typically designed under either the subset-selection (SS) formulation or the indifference-zone (IZ) formulation. Both formulations may encounter problems when the goal is to select the unique best alternative for any configuration of the means. In particular, SS procedures may return a subse...
• Managing Perishable Inventories in Retailing: Replenishment, Clearance Sales, and Segregation AI翻译
  作者：Li, Qing; Yu, Peiwen; Wu, Xiaoli
  作者单位：Hong Kong University of Science & Technology; Fudan University; South China University of Technology
  摘要：We study joint replenishment and clearance sales of perishable goods under a general finite lifetime and a last-in-firstout (LIFO) issuing rule, a problem common in retailing. We show that the optimal policies can be characterized by two thresholds for each age group of inventory: a lower one and a higher one. For an age group of inventory with a remaining lifetime of two periods or longer, if its inventory level is below its lower threshold, then there is no clearance sales; if it is above it...