-
作者：Archibald, T. W.; Black, D. P.; Glazebrook, K. D.
作者单位：University of Edinburgh; Lancaster University
摘要：We utilise and develop Whittle's restless bandit formulation to analyse a simple class of inventory routing problems with direct deliveries. These routing problems arise from the practice of vendor-managed inventory replenishment and concern the optimal replenishment of a collection of inventory holding locations controlled centrally by a decision maker who is able to monitor inventory levels throughout the network. We develop a notion of location indexability from a Lagrangian relaxation of t...
-
作者：Levina, Tatsiana; Levin, Yuri; McGill, Jeff; Nediak, Mikhail
作者单位：Queens University - Canada
摘要：We study the problem faced by a monopolistic company that is dynamically pricing a perishable product or service and simultaneously learning the demand characteristics of its customers. In the learning procedure, the company observes the sales history over consecutive learning stages and predicts consumer demand by applying an aggregating algorithm ( AA) to a pool of online stochastic predictors. Numerical implementation uses finite-sample distribution approximations that are periodically upda...
-
作者：Chen, Wenqing; Sim, Melvyn
作者单位：National University of Singapore
摘要：We develop a goal-driven stochastic optimization model that considers a random objective function in achieving an aspiration level, target, or goal. Our model maximizes the shortfall-aware aspiration-level criterion, which encompasses the probability of success in achieving the aspiration level and an expected level of underperformance or shortfall. The key advantage of the proposed model is its tractability. We can obtain its solution by solving a small collection of stochastic linear optimiz...
-
作者：Chandran, Bala G.; Hochbaum, Dorit S.
作者单位：University of California System; University of California Berkeley; University of California System; University of California Berkeley
摘要：We present the results of a computational investigation of the pseudoflow and push-relabel algorithms for the maximum flow and minimum s-t cut problems. The two algorithms were tested on several problem instances from the literature. Our results show that our implementation of the pseudoflow algorithm is faster than the best-known implementation of push-relabel on most of the problem instances within our computational study.
-
作者：Chao, Xiuli; Zhou, Sean X.
作者单位：University of Michigan System; University of Michigan; Chinese University of Hong Kong
摘要：In many production/distribution systems, materials flow in fixed lot sizes (e. g., in full truckloads or full containers) and under regular schedules (e. g., delivery every week). In this paper, we study a multiechelon serial system with batch ordering and fixed replenishment intervals. We derive the optimal inventory control policy, provide a distribution-function solution for its optimal control parameters, and present an efficient algorithm for computing those parameters. Further, we show t...
-
作者：Jia, Jing; Heragu, Sunderesh S.
作者单位：Barclays; University of Louisville
摘要：A semi-open queuing network (SOQN) is a special type of a queuing network consisting of two parts: an inner network with a population constraint and an external queue to accommodate jobs whose entrance is delayed. We first study an SOQN with a single class of jobs in tandem configuration and then extend our study to multiclass configurations. Multiclass SOQNs fall into two categories: general pallet and dedicated pallet SOQNs. For the general pallet case, we aggregate all classes and solve the...
-
作者：Leung, Lawrence C.; Van Hui, Yer; Wang, Yong; Chen, Gang
作者单位：Chinese University of Hong Kong; City University of Hong Kong; Chongqing University; Sun Yat Sen University
摘要：This paper addresses the problem of determining the optimal integrations and consolidations of air cargo shipments. A freight forwarder arranges for the execution of many jobs (shipments) on behalf of several clients. Each job consists of a number of sequential activities, such as pickup, truck transportation, warehousing, and air transportation. Each activity can be performed by a number of processing units, such as trucking companies, warehouses, and airlines. If a number of consecutive acti...
-
作者：Rothlauf, Franz
作者单位：Johannes Gutenberg University of Mainz
摘要：This paper presents an experimental investigation into the properties of the optimal communication spanning tree (OCST) problem. The OCST problem seeks a spanning tree that connects all the nodes and satisfies their communication requirements at a minimum total cost. The paper compares the properties of random trees to the properties of the best solutions for the OCST problem that are found using an evolutionary algorithm. The results show, on average, that the optimal solution and the minimum...
-
作者：Selvarajah, Esaignani; Steiner, George
作者单位：University of Windsor; McMaster University
摘要：We study the upstream supplier's batch scheduling problem in a supply chain, which was defined by Hall and Potts [Hall, N. G., C. N. Potts. 2003. Supply chain scheduling: Batching and delivery. Oper. Res. 51(4) 566-584]. The supplier has to manufacture multiple products and deliver them to customers in batches. There is an associated delivery cost with each batch. The objective of the supplier is to minimize the total inventory holding and delivery costs. We present simple approximation algori...
-
作者：Anderson, E. J.; Cau, T. D. H.
作者单位：University of Sydney; University of New South Wales Sydney
摘要：Many oligopolies operate as a repeated game. In such circumstances, it can be expected that profit-maximising participants may engage in implicit collusion to profitably increase spot market prices. This paper models the emergence of such implicit collusion in a stylised market model using a coevolutionary approach. Players bid supply functions made up of a finite number of linear pieces. Each player uses a genetic algorithm to find state-based strategies depending on the price and demand in t...
