Locating Facilities in the Presence of Disruptions and Incomplete Information*

In this article, we analyze a location model where facilities may be subject to disruptions. Customers do not have advance information about whether a given facility is operational or not, and thus may have to visit several facilities before finding an operational one. The objective is to locate a set of facilities to minimize the total expected cost of customer travel. We decompose the total cost into travel, reliability, and information components. This decomposition allows us to put a value on the advance information about the states of facilities and compare it to the reliability and travel cost components, which allows a decision maker to evaluate which part of the system would benefit the most from improvements. The structure of optimal solutions is analyzed, with two interesting effects identified: facility centralization and co‐location; both effects appear to be stronger than in the complete information case, where the status of each facility is known in advance.     

On tie breaking in competitive location under binary customer behavior

Ties in customer facility choice may occur when the customer selects the facility with maximum utility to be served. In the location literature ties in maximum utility are broken by assigning a fixed proportion of the customer demand to the facilities with maximum utility which are owned by the entering firm. This tie breaking rule does not take into account the number of tied facilities of both the entering firm and its competitors. In this paper we introduce a more realistic tie breaking rule which assigns a variable proportion of customer demand to the entering firm depending on the number of tied facilities. We present a general framework in which optimal locations for the old and the new tie breaking rules can be obtained through Integer Linear Programming formulations of the corresponding location models. The optimal locations are obtained for the old tie breaking rule for different values of the fixed proportion and a comparison with the results obtained for the new tie breaking rule is drawn with data of Spanish municipalities in a variety of scenarios. Finally, some conclusions are presented.     

A Capacitated Multi‐echelon Inventory Placement Model under Lead Time Constraints

We develop an inventory placement model in the context of general multi‐echelon supply chains where the delivery lead time promised to the customer must be respected. The delivery lead time is calculated based on the available stocks of the different input and output products in the different facilities and takes into account the purchasing lead times, the manufacturing lead times, and the transportation lead times. We assume finite manufacturing capacities and consider the interactions of manufacturing orders between time periods. Each facility manages the stocks of its input and output products. The size of customer orders and their arrival dates and due dates are assumed to be known as in many B2B situations. We perform extensive computational experiments to derive managerial insights. We also derive analytical insights regarding the manufacturing capacities to be installed and the impacts of the frequency of orders on the system cost.     

Enhancing corporate social responsibility: Contract design under information asymmetry

We consider a two-stage supply chain in which a contract manufacturer (CM) sells products through a brand name retailer. The contract manufacturer can invest in corporate social responsibility (CSR) activities to improve customer perception about the firm and increase demand, while the retailer can influence the demand by exerting marketing efforts. We design optimal contracts for such a supply chain, which faces information asymmetry. The wholesale price contract was developed as the base model to derive insight into the value of information sharing. We examine the impact of CSR cost on CSR commitment and profits. We find that CM׳s CSR cost impacts the CM׳s and the retailer׳s profits differently. Under certain conditions, the CM׳s profit will increase with cost, while that of the retailer is uncertain. We also propose two-part tariff contracts for both the symmetric and asymmetric cases with the aim of maximizing the retailer׳s profit and improving CM׳s commitment to CSR. Finally, numerical experiments are conducted to illustrate and validate the proposed models and provide managerial insights.     

Social Optimal Location of Facilities with Fixed Servers,Stochastic Demand,and Congestion

We consider two capacity choice scenarios for the optimal location of facilities with fixed servers, stochastic demand, and congestion. Motivating applications include virtual call centers, consisting of geographically dispersed centers, walk‐in health clinics, motor vehicle inspection stations, automobile emissions testing stations, and internal service systems. The choice of locations for such facilities influences both the travel cost and waiting times of users. In contrast to most previous research, we explicitly embed both customer travel/connection and delay costs in the objective function and solve the location–allocation problem and choose facility capacities simultaneously. The choice of capacity for a facility that is viewed as a queueing system with Poisson arrivals and exponential service times could mean choosing a service rate for the servers (Scenario 1) or choosing the number of servers (Scenario 2). We express the optimal service rate in closed form in Scenario 1 and the (asymptotically) optimal number of servers in closed form in Scenario 2. This allows us to eliminate both the number of servers and the service rates from the optimization problems, leading to tractable mixed‐integer nonlinear programs. Our computational results show that both problems can be solved efficiently using a Lagrangian relaxation optimization procedure.     

Ordering,Pricing, and Lead‐Time Quotation Under Lead‐Time and Demand Uncertainty

In this article, we study the newsvendor problem with endogenous setting of price and quoted lead‐time. This problem can be observed in situations where a firm orders semi‐finished product prior to the selling season and customizes the product in response to customer orders during the selling season. The total demand during the selling season and the lead‐time required for customization are uncertain. The demand for the product depends not only on the selling price but also on the quoted lead‐time. To set the quoted lead‐time, the firm has to carefully balance the benefit of increasing demand as the quoted lead‐time is reduced against the cost of increased tardiness. Our model enables the firm to determine the optimal selling price, quoted lead‐time, and order quantity simultaneously, and provides a new set of insights to managers.     

Electricity Time‐of‐Use Tariff with Stochastic Demand

In this article, we study the electricity time‐of‐use (TOU) tariff for an electricity company with stochastic demand. The electricity company offers the flat rate (FR) and TOU tariffs to customers. Under the FR tariff, the customer pays a flat price for electricity consumption in both the peak and non‐peak periods. Under the TOU tariff, the customer pays a high price for electricity consumption in the peak period and a low price for electricity consumption in the non‐peak period. The electricity company uses two technologies, namely the base‐load and peak‐load technologies, to generate electricity. We derive the optimal capacity investment and pricing decisions for the electricity company. Furthermore, we use real data from a case study to validate the results and derive insights for implementing the TOU tariff. We show that in almost all the cases, the electricity company needs less capacity for both technologies under the TOU tariff than under the FR tariff, even though the expected demand in the non‐peak period increases. In addition, except for some extreme cases, there is essentially no signicant reduction in the total demand of the two periods, although the TOU tariff can reduce the demand in the peak period. Under the price‐cap regulation, the customer may pay a lower price on average under the TOU tariff than under the FR tariff. We conduct an extensive numerical study to assess the impacts of the model parameters on the optimal solutions and the robustness of the analytical results, and generate managerial implications of the research findings.     

Managing stochastic demand in an Inventory Routing Problem with transportation procurement

We study an Inventory Routing Problem in which the supplier has a limited production capacity and the stochastic demand of the retailers is satisfied with procurement of transportation services. The aim is to minimize the total expected cost over a planning horizon, given by the sum of the inventory cost at the supplier, the inventory cost at the retailers, the penalty cost for stock-out at the retailers and the transportation cost. First, we show that a policy based just on the average demand can have a total expected cost infinitely worse than the one obtained by taking into account the overall probability distribution of the demand in the decision process. Therefore, we introduce a stochastic dynamic programming formulation of the problem that allows us to find an optimal policy in small size instances. Finally, we design and implement a matheuristic approach, integrating a rollout algorithm and an optimal solution of mixed-integer linear programming models, which is able to solve realistic size problem instances. Computational results allow us to provide managerial insights concerning the management of stochastic demand.     

运输成本对批量敏感时的供应链批量协调策略比较研究

以一个多周期、随机客户需求和单位产品运输成本对批量敏感的供应链为研究对象,建立了由生产商负责产品运输时,供应链分散决策情形下的最佳批量模型,并提出了基于批量折扣和改由批发商负责产品运输的供应链批量协调策略.研究结果表明:当由生产商负责产品运输时,单位产品运输成本对批量越不敏感,生产商的最佳生产批量越小,与批发商要求的短周期、小批量订货越接近;如果改由批发商负责产品运输,批发商的最佳订货批量更接近于生产商的最佳生产批量.最后,通过数例分析发现,对生产商来讲,当单位产品运输成本对批量不太敏感时,批量折扣政策优于改由批发商负责产品运输的策略,但当单位产品运输成本对批量较敏感时,后者优于前者.     

设施失灵风险下不确定需求应急定位-路径鲁棒优化研究

为抵御突发灾害对路网造成的破坏性和设施失灵风险,降低系统成本,并快速完成应急救援任务,本文考虑到受灾点物资需求量的不确定和风险对救援系统的影响,采用直升机进行物资运送以规避路径风险。建立了最小化应急物流系统总成本和物资到达需求点总救援时间为双目标的应急物流定位-路径鲁棒优化模型,基于相对鲁棒优化方法处理需求不确定,采用偏差鲁棒优化思想描述设施失灵风险损失,采用遗传算法进行求解。通过对三个算例进行数据仿真实验,证明了相对鲁棒优化方法在处理需求不确定和偏差鲁棒优化方法在处理设施失灵风险方面的有效性,进而为解决应急设施点的开设和救援物资的安全及时准确配送,增强应急物流系统的风险应对能力提供了有效的方法。     

A local search approximation algorithm for the uniform capacitated <Emphasis Type="Italic">k</Emphasis>-facility location problem

In the uniform capacitated k-facility location problem (UC-k-FLP), we are given a set of facilities and a set of clients. Every client has a demand. Every facility have an opening cost and an uniform capacity. For each client–facility pair, there is an unit service cost to serve the client with unit demand by the facility. The total demands served by a facility cannot exceed the uniform capacity. We want to open at most k facilities to serve all the demands of the clients without violating the capacity constraint such that the total opening and serving cost is minimized. The main contribution of this work is to present the first combinatorial bi-criteria approximation algorithm for the UC-k-FLP by violating the cardinality constraint.     

Facility Location: A Robust Optimization Approach

In this research, we apply robust optimization (RO) to the problem of locating facilities in a network facing uncertain demand over multiple periods. We consider a multi‐period fixed‐charge network location problem for which we find (1) the number of facilities, their location and capacities, (2) the production in each period, and (3) allocation of demand to facilities. Using the RO approach we formulate the problem to include alternate levels of uncertainty over the periods. We consider two models of demand uncertainty: demand within a bounded and symmetric multi‐dimensional box, and demand within a multi‐dimensional ellipsoid. We evaluate the potential benefits of applying the RO approach in our setting using an extensive numerical study. We show that the alternate models of uncertainty lead to very different solution network topologies, with the model with box uncertainty set opening fewer, larger facilities. Through sample path testing, we show that both the box and ellipsoidal uncertainty cases can provide small but significant improvements over the solution to the problem when demand is deterministic and set at its nominal value. For changes in several environmental parameters, we explore the effects on the solution performance.     

A shelf-space optimization model when demand is stochastic and space-elastic

The more customer demand is impulse-driven, the more it is space-dependent and the more it is subject to variation. We investigate the corresponding problem of retail shelf-space planning when demand is stochastic and sensitive to the number and position of facings. We develop a model to maximize a retailer׳s profit by selecting the number of facings and their shelf position under the assumption of limited space. The model is particularly applicable to promotional or temporary products.We develop the first optimization model and solution approach that takes stochastic demand into account, since the current literature applies deterministic models for shelf-space planning. By the means of an innovative modeling approach for the case with space- and positioning effects and the conversion of our problem into a mixed-integer problem, we obtain optimal results within very short run times for large-scale instances relevant in practice. Furthermore, we develop a solution approach to account for cross-space elasticity, and solve it using an own heuristic, which efficiently yields near-optimal results. We demonstrate that correctly considering space elasticity and demand variation is essential. The corresponding impacts on profits and solution structures become even more significant when space elasticity and stochastic demand interact, resulting in up to 5% higher profits and up to 80% differences in solution structures, if both effects are correctly accounted for. We develop an efficient modeling approach, compare the model results with approaches applied in practice and derive rules-of-thumb for planners.     

多类顾客环境下报童模型中库存分配策略研究

考虑一个报童模型中多类顾客的库存分配问题,将顾客按照他们愿意支付价格的高低划分为不同级别。零售商在销售期初决定产品订货量,并在销售期内决定接受或者拒绝不同顾客的需求,以最大化销售期内的期望总利润。将销售期分成大量足够小的时间单位,通过建立一个反向Bellman动态规划方程,以优化每个时间单位内的库存分配策略,并得到了零售商最优的期初订货量。通过与没有库存分配策略下零售商的期望利润进行比较,算例分析得出库存分配策略可以大幅提高零售商的利润。这主要是因为通过库存分配可以使得零售商从高端顾客中获取更多利润,同时能够减小期初的订货量,以节约采购成本和库存持有成本。     

随机需求下联合选址-库存模型研究

研究了一类具有季节性需求特性的商品的联合选址-库存模型。在传统的无容量限制的固定费用设施选址问题中考虑了分销中心的运作库存和安全库存的影响,以及规模经济效应和风险分摊效应,同时考虑了季节性商品未来需求的不确定性,将订货决策作为模型的决策变量,建立了一类随机需求下以期望销售收益最大化为目标函数的联合选址-库存模型,拓展了已有的联合选址-库存模型。该模型是一个混合整数规划问题,给出了求解该问题的基于拉格朗日松弛算法的两阶段算法,最后通过随机生成四组不同规模的数值算例,得到的计算结果表明拉格朗日松弛算法可以有效地求解该问题。     

现货价格和需求关联时期权组合合约模式下采购风险管理策略

在现货价格和客户端需求关联的情形下,本文引用期权组合合约建立现货市场供应量有限时的两阶段采购风险管理模型,以期最大化零售商的期望收益。文中先用逆向归纳法列出零售商第二阶段的最优策略,采用标准扰动定理得出有效合约应满足的最优性条件,并将原模型转化为单调的最短路径问题,应用动态规划求解最优的采购策略。最后用算例分析了现货价格与需求的相关系数及现货市场的供应量对最优策略的影响,发现当供应量一定时,各有效合约的最优预订量及有效合约的总预订量都随着相关系数的增大而提高,并且有效合约受相关系数的影响大小取决于合约的灵活性;并且,当相关系数一定时,有效合约的总预订量及执行价格最低的有效合约的最优预订量都随着供应量的增加而单调减少。     

有限供应的现货市场与期权合约下的采购策略

在随机现货价格与随机需求相独立的情况下,当现货市场供应量有限时,本文采用期权组合合约建立两阶段采购风险管理模型,以期最大化零售商的期望利润.文中提供了甄别有效合约的算法,得到零售商的最优采购策略,并进一步用算例分析了现货市场的供应量、现货价格和客户需求的波动性对最优采购策略的影响,发现当现货市场的供应量增加时,零售商应...     

Increasing the Revenue of Self‐Storage Warehouses by Facility Design

Self‐storage is a booming industry. Both private customers and companies can rent temporary space from such facilities. The design of self‐storage warehouses differs from other facility designs in its focus on revenue maximization. A major question is how to design self‐storage facilities to fit market segments and accommodate volatile demand to maximize revenue. Customers that cannot be accommodated with a space size of their choice can be either rejected or upscaled to a larger space. Based on data of 54 warehouses in America, Europe, and Asia, we propose a new facility design approach with models for three different cases: an overflow customer rejection model and two models with customer upscale possibilities, one with reservation and another without reservation. We solve the models for several real warehouse cases, and our results show that the existing self‐storage warehouses can be redesigned to generate larger revenues for all cases. Finally, we show that the upscaling policy without reservation generally outperforms the upscaling policy with reservation.     

The min-p robust optimization approach for facility location problem under uncertainty

Improper value of the parameter p in robust constraints will result in no feasible solutions while applying stochastic p-robustness optimization approach (p-SRO) to solving facility location problems under uncertainty. Aiming at finding the lowest critical p-value of parameter p and corresponding robust optimal solution, we developed a novel robust optimization approach named as min-p robust optimization approach (min-pRO) for P-median problem (PMP) and fixed cost P-median problem (FPMP). Combined with the nearest allocation strategy, the vertex substitution heuristic algorithm is improved and the influencing factors of the lowest critical p-value are analyzed. The effectiveness and performance of the proposed approach are verified by numerical examples. The results show that the fluctuation range of data is positively correlated with the lowest critical p-value with given number of new facilities. However, the number of new facilities has a different impact on lowest critical p-value with the given fluctuation range of data. As the number of new facilities increases, the lowest critical p-value for PMP and FPMP increases and decreases, respectively.

     

Benchmark Schedules for Subcontracted Operations: Decentralization Inefficiencies that Arise from Competition and First‐Come‐First‐Served Processing*

Subcontracting has become a prominent business practice across many industries. Subcontracting of industrial production is generally based on short‐term need for additional processing capacity, and is frequently employed by manufacturers to process customer orders more quickly than using only in‐house production. In this article, we study a popular business model where multiple manufacturers, each capable of processing his entire workload in‐house, have the option to subcontract some of their operations to a single third party with a flexible resource. Each manufacturer can deliver customer orders only after his entire batch of jobs, processed in‐house and at the third party, is completed. The third party facility is available to several manufacturers who compete for its use. Current business practice of First‐Come‐First‐Served (FCFS) processing of the subcontracted workloads as well as the competitive Nash equilibrium schedules developed in earlier studies result in two types of inefficiencies; the third party capacity is not maximally utilized, and the manufacturers incur decentralization cost. In this article, we develop models to assess the value created by coordinating the manufacturers' subcontracting decisions by comparing two types of centralized control against FCFS and Nash equilibrium schedules. We present optimal and/or approximate algorithms to quantify the third party underutilization and the manufacturers' decentralization cost. We find that both inefficiencies are more severe with competition than they are when the third party allocates capacity in an FCFS manner. However, in a decentralized setting, a larger percentage of the players prefer Nash equilibrium schedules to FCFS schedules. We extend our analysis to incomplete information scenarios where manufacturers reveal limited demand information, and find that more information dramatically benefits the third party and the manufacturers, however, the marginal benefit of additional information is decreasing. Finally, we discuss an extension wherein each manufacturer's objective takes into account asymmetries in subcontracting, in‐house processing, and delay costs.