-
作者：Amaldi, Edoardo; Bosio, Sandro; Malucelli, Federico; Yuan, Di
作者单位：Polytechnic University of Milan; Swiss Federal Institutes of Technology Domain; ETH Zurich; Linkoping University
摘要：Wireless local area networks (WLANs) are widely used for cable replacement and wireless Internet access. Because the medium access control (MAC) scheme of WLANs has a strong influence on network performance, it should be accounted for in WLAN design. This paper presents AP location models that optimize a network performance measure specifically for the MAC scheme of WLANs that represents the efficiency in sharing the wireless medium. For these models, we propose a solution framework based on a...
-
作者：Borgonovo, E.; Smith, C. L.
作者单位：Bocconi University; Bocconi University; United States Department of Energy (DOE); Idaho National Laboratory
摘要：Risk managers are often confronted with the evaluation of operational policies in which two or more system components are simultaneously affected by a change. In these instances, the decision-making process should be informed by the relevance of interactions. However, because of system and model complexity, a rigorous study for determining whether and how interactions quantitatively impact operational choices has not been developed yet. In light of the central role played by the multilinearity...
-
作者：Baldacci, Roberto; Bartolini, Enrico; Mingozzi, Aristide
作者单位：University of Bologna; University of Bologna; University of Bologna
摘要：The pickup and delivery problem with time windows (PDPTW) is a generalization of the vehicle routing problem with time windows. In the PDPTW, a set of identical vehicles located at a central depot must be optimally routed to service a set of transportation requests subject to capacity, time window, pairing, and precedence constraints. In this paper, we present a new exact algorithm for the PDPTW based on a set-partitioning-like integer formulation, and we describe a bounding procedure that fin...
-
作者：Ryzhov, Ilya O.; Powell, Warren B.
作者单位：Princeton University
摘要：We derive a knowledge gradient policy for an optimal learning problem on a graph, in which we use sequential measurements to refine Bayesian estimates of individual edge values in order to learn about the best path. This problem differs from traditional ranking and selection in that the implementation decision (the path we choose) is distinct from the measurement decision (the edge we measure). Our decision rule is easy to compute and performs competitively against other learning policies, inc...
-
作者：Oskoorouchi, Mohammad R.; Ghaffari, Hamid R.; Terlaky, Tamas; Aleman, Dionne M.
作者单位：California State University System; California State University San Marcos; University of Toronto; Lehigh University
摘要：We propose an interior point constraint generation (IPCG) algorithm for semi-infinite linear optimization (SILO) and prove that the algorithm converges to an epsilon-solution of SILO after a finite number of constraints is generated. We derive a complexity bound on the number of Newton steps needed to approach the updated mu-center after adding multiple violated constraints and a complexity bound on the total number of constraints that is required for the overall algorithm to converge. We impl...
-
作者：Chen, Yihsu; Liu, Andrew L.; Hobbs, Benjamin F.
作者单位：University of California System; University of California Merced; Purdue University System; Purdue University; Johns Hopkins University
摘要：In response to Assembly Bill 32, the state of California considered three types of carbon emissions trading programs for the electric power sector: load-based, source-based, and first-seller. They differed in terms of their point of regulation and in whether in-state-to-out-of-state and out-of-state-to-in-state electricity sales are regulated. In this paper, we formulate a market equilibrium model for each of the three approaches, considering power markets, transmission limitations, and emissi...
-
作者：Little, John D. C.
作者单位：Massachusetts Institute of Technology (MIT)
摘要：Fifty years ago, the author published a paper in Operations Research with the title, A proof for the queuing formula: L = lambda W [Little, J. D. C. 1961. A proof for the queuing formula: L = lambda W. Oper. Res. 9(3) 383-387]. Over the years, L = lambda W has become widely known as Little's Law. Basically, it is a theorem in queuing theory. It has become well known because of its theoretical and practical importance. We report key developments in both areas with the emphasis on practice. In t...
-
作者：Simchi-Levi, David; Trick, Michael A.
作者单位：Massachusetts Institute of Technology (MIT); Carnegie Mellon University
-
作者：Cook, Wade D.; Zhu, Joe
作者单位：York University - Canada; Worcester Polytechnic Institute
摘要：Data envelopment analysis (DEA) provides an optimization methodology for deriving an efficiency score for each member of a set of peer decision-making units. Under the original DEA model it was assumed that there is constant returns to scale (CRS). This idea was later extended to the more general case that allowed for variable returns to scale (VRS). In both of these structures, it is assumed that the returns to scale (RTS) classification, consistent with the classical definition, applies to t...
-
作者：Guo, Pengfei; Hassin, Refael
作者单位：Hong Kong Polytechnic University; Tel Aviv University
摘要：We consider a single server queueing system in which service shuts down when there are no customers present and is resumed only when the queue length reaches a given critical length. We analyze the strategic response of customers to this mechanism and compare it to the overall optimal behavior, with and without information on delay. The results are significantly different from those obtained when the server is continuously available. We show that there may exist multiple equilibria in such a s...
