-
作者：Marklund, Johan; Rosling, Kaj
作者单位：Lund University; Linnaeus University
摘要：Assume that in periods with stochastic demand remain until the next replenishment arrives at a central warehouse. How should the available inventory be allocated among N retailers? This paper presents a new policy and a new lower bound for the expected cost of this problem. The lower bound becomes tight as N -> infinity. The infinite horizon problem then decomposes into N independent m-period problems with optimal retailer ship-up-to levels that decrease over the in periods, and the warehouse ...
-
作者：Chun, So Yeon; Shapiro, Alexander; Uryasev, Stan
作者单位：Georgetown University; University System of Georgia; Georgia Institute of Technology; State University System of Florida; University of Florida
摘要：We discuss linear regression approaches to the estimation of law-invariant conditional risk measures. Two estimation procedures are considered and compared; one is based on residual analysis of the standard least-squares method, and the other is in the spirit of the M-estimation approach used in robust statistics. In particular, value-at-risk and average value-at-risk measures are discussed in detail. Large sample statistical inference of the estimators is derived. Furthermore, finite sample p...
-
作者：Gurvich, Itai; Perry, Ohad
作者单位：Northwestern University; Northwestern University
摘要：Motivated by call center cosourcing problems, we consider a service network operated under an overflow mechanism. Calls are first routed to an in-house (or dedicated) service station that has a finite waiting room. If the waiting room is full, the call is overflowed to an outside provider (an overflow station) that might also be serving overflows from other stations. We establish approximations for overflow networks with many servers under a resource-pooling assumption that stipulates, in our ...
-
作者：Huh, Woonghee Tim; Janakiraman, Ganesh
作者单位：University of British Columbia; University of Texas System; University of Texas Dallas
摘要：We study a periodically reviewed multiechelon inventory system in series such that order quantities at every stage have to be multiples of a given stage-specific batch size. The batch sizes are nested in the sense that the batch size for every stage is an integer multiple of the batch size for its downstream stage. The problem is that of determining the policy that minimizes the expected discounted sum of costs over a finite horizon. The result is that an echelon (R, nQ) policy is optimal when...
-
作者：Sioshansi, Ramteen
作者单位：University System of Ohio; Ohio State University
摘要：Plug-in hybrid electric vehicles (PHEVs) have been touted as a transportation technology with lower fuel costs and emissions impacts than other vehicle types. Most analyses of PHEVs assume that the power system operator can either directly or indirectly control PHEV charging to coordinate it with power system operations. This paper examines the incentives of individual drivers making charging decisions with different electricity tariffs, and it compares the cost and emissions impacts of these ...
-
作者：Vidal, Thibaut; Crainic, Teodor Gabriel; Gendreau, Michel; Lahrichi, Nadia; Rei, Walter
作者单位：Universite de Montreal; Universite de Montreal; Universite de Montreal; University of Quebec; University of Quebec Montreal; University of Quebec; University of Quebec Montreal; Universite de Montreal; Polytechnique Montreal; Universite de Montreal; Polytechnique Montreal
摘要：We propose an algorithmic framework that successfully addresses three vehicle routing problems: the multidepot VRP, the periodic VRP, and the multidepot periodic VRP with capacitated vehicles and constrained route duration. The metaheuristic combines the exploration breadth of population-based evolutionary search, the aggressive-improvement capabilities of neighborhood-based metaheuristics, and advanced population-diversity management schemes. Extensive computational experiments show that the ...
-
作者：Deng, Xiaotie; Qi, Qi; Saberi, Amin
作者单位：University of Liverpool; City University of Hong Kong; Hong Kong University of Science & Technology; Stanford University
摘要：We study the problem of finding an envy-free allocation of a cake to d + 1 players using d cuts. Two models are considered, namely, the oracle-function model and the polynomial-time function model. In the oracle-function model, we are interested in the number of times an algorithm has to query the players about their preferences to find an allocation with the envy less than c. We derive a matching lower and upper bound of theta(1/is an element of)(d-1) for players with Lipschitz utilities and ...
-
作者：Michel, S.; Vanderbeck, F.
作者单位：Universite de Bordeaux
摘要：Inventory routing problems combine the optimization of product deliveries (or pickups) with inventory control at customer sites. The application that motivates this paper concerns the planning of single-product pickups over time; each site accumulates stock at a deterministic rate; the stock is emptied on each visit. At the tactical planning stage considered here, the objective is to minimize a surrogate measure of routing cost while achieving some form of regional clustering by partitioning t...
-
作者：Abbas, Ali E.; Bell, David E.
作者单位：University of Illinois System; University of Illinois Urbana-Champaign; Harvard University
摘要：We introduce a variety of new independence conditions for multiattribute utility functions that permit preference dependencies among the attributes of a decision problem. The hierarchy of new conditions varies in the degree to which it specifies the functional form, ranging from more general solutions with weaker constraints, to more specific solutions with stronger constraints. This formulation provides a wealth of new functional forms that a decision maker may use in a multiattribute decisio...
-
作者：Wierman, Adam; Zwart, Bert
作者单位：California Institute of Technology; California Institute of Technology; Vrije Universiteit Amsterdam; Centrum Wiskunde & Informatica (CWI)
摘要：This paper focuses on the competitive analysis of scheduling disciplines in a large deviations setting. Although there are policies that are known to optimize the sojourn time tail under a large class of heavy-tailed job sizes (e.g., processor sharing and shortest remaining processing time) and there are policies known to optimize the sojourn time tail in the case of light-tailed job sizes (e.g., first come first served), no policies are known that can optimize the sojourn time tail across bot...
