A facility location model for global closed-loop supply chain network design

Forward and reverse supply chains form a closed-loop supply chain. In this paper, a mathematical model is proposed for a closed-loop supply chain network by considering global factors, including exchange rates and customs duties. The model is a multi-objective mixed-integer linear programming model under uncertain demand. A solution approach based on fuzzy programming is developed for solving the optimization problem. The model is then applied in a network, which is located in Southwestern Ontario, Canada. A sensitivity analysis is provided to validate the model. This model considers global factors, multi-objectives, and uncertainty simultaneously in a closed-loop supply chain network.     

The research on optimization of auto supply chain network robust model under macroeconomic fluctuations

Considering the uncertainty of the macroeconomic environment, the robust optimization method is studied for constructing and designing the automotive supply chain network, and based on the definition of robust solution a robust optimization model is built for integrated supply chain network design that consists of supplier selection problem and facility location–distribution problem. The tabu search algorithm is proposed for supply chain node configuration, analyzing the influence of the level of uncertainty on robust results, and by comparing the performance of supply chain network design through the stochastic programming model and robustness optimize model, on this basis, determining the rational layout of supply chain network under macroeconomic fluctuations. At last the contrastive test result validates that the performance of tabu search algorithm is outstanding on convergence and computational time. Meanwhile it is indicated that the robust optimization model can reduce investment risks effectively when it is applied to supply chain network design.     

A robust optimization model for agile and build-to-order supply chain planning under uncertainties

Supply chain planning as one of the most important processes within the supply chain management concept, has a great impact on firms’ success or failure. This paper considers a supply chain planning problem of an agile manufacturing company operating in a build-to-order environment under various kinds of uncertainty. An integrated optimization approach of procurement, production and distribution costs associated with the supply chain members has been taken into account. A robust optimization scenario-based approach is used to absorb the influence of uncertain parameters and variables. The formulation is a robust optimization model with the objective of minimizing the expected total supply chain cost while maintaining customer service level. The developed multi-product, multi-period, multi-echelon robust mixed-integer linear programming model is then solved using the CPLEX optimization studio and guidance related to future areas of research is given.     

A multi-objective facility location model for closed-loop supply chain network under uncertain demand and return

A closed-loop supply chain (CLSC) network consists of both forward and reverse supply chains. In this paper, a CLSC network is investigated which includes multiple plants, collection centres, demand markets, and products. To this aim, a mixed-integer linear programming model is proposed that minimizes the total cost. Besides, two test problems are examined. The model is extended to consider environmental factors by weighed sums and ε-constraint methods. In addition, we investigate the impact of demand and return uncertainties on the network configuration by stochastic programming (scenario-based). Computational results show that the model can handle demand and return uncertainties, simultaneously.     

An optimization model for traceable closed-loop supply chain networks

In this paper, a new non-linear mixed-integer mathematical programming problem is proposed to model a stochastic multi-product closed-loop supply chain (CLSC). The radio frequency identification (RFID) system is implemented in the supply chain to decrease product losses and the overall lead time of transportation while computing the profit derived from internet and conventional sales. The resulting traceable CLSC improves upon the existing literature by allowing us to: (1) boost the incorporation of traceability assumptions in mathematical programming problems so as to enhance the efficiency and visibility of a supply chain, (2) analyze the strategic effects that different internet sale formats have on customers’ evaluations and acquisition choices, and (3) account for the environmental and socio-economical dimension by explicitly formalizing employment-based incomes as part of the profit function. Two meta-heuristic algorithms are introduced to solve the proposed optimization problem, namely, the greedy randomized adaptive search procedure (GRASP) and particle swarm optimization (PSO). Twelve test problems of different sizes are generated and solved using these algorithms. The computational results show that GRASP outperforms PSO in terms of both profit and CPU time values. Finally, a case study in the network marketing industry is presented and managerial implications outlined to show the validity of the proposed model and shed more light on its practical implications.     

基于交互式模糊规划方法的可持续闭环供应链网络规划

在市场需求、设施开设成本和产品回收率不确定的条件下,采用一种交互式可能性规划方法,研究由多个工厂、分销点、市场和废旧点构成的可持续闭环供应链网络设计问题。基于可持续闭环供应链网络结构,构建以企业运营成本和环境伤害最小、社会效益最大为目标的混合整数规划模型。同时,引入改进Epsilon约束方法将多目标优化问题转化为单目标优化问题,在此基础上提出一种两阶段可能性规划方法,基于TH模糊方法对不确定性参数进行处理。最后,通过数值实例,验证本文所建可持续闭环供应链网络模型的有效性,并对悲观-乐观值、不确定参数最低可接受水平β、可调参数γ进行敏感性分析;通过与其他模糊方法对比表明,采用TH模糊方法能得到稳定的最优解。     

Strategic robust supply chain design based on the Pareto-optimal tradeoff between efficiency and risk

The strategic design of a robust supply chain has to determine the configuration of the supply chain so that its performance remains of a consistently high quality for all possible future conditions. The current modeling techniques often only consider either the efficiency or the risk of the supply chain. Instead, we define the strategic robust supply chain design as the set of all Pareto-optimal configurations considering simultaneously the efficiency and the risk, where the risk is measured by the standard deviation of the efficiency. We model the problem as the Mean–Standard Deviation Robust Design Problem (MSD-RDP). Since the standard deviation has a square root expression, which makes standard maximization algorithms based on mixed-integer linear programming non-applicable, we show the equivalency to the Mean–Variance Robust Design Problem (MV-RDP). The MV-RDP yields an infinite number of mixed-integer programming problems with quadratic objective (MIQO) when considering all possible tradeoff weights. In order to identify all Pareto-optimal configurations efficiently, we extend the branch-and-reduce algorithm by applying optimality cuts and upper bounds to eliminate parts of the infeasible region and the non-Pareto-optimal region. We show that all Pareto-optimal configurations can be found within a prescribed optimality tolerance with a finite number of iterations of solving the MIQO. Numerical experience for a metallurgical case is reported.     

Robust environmental closed-loop supply chain design under uncertainty

With the fast developments in product remanufacturing to improve economic and environmental performance, an environmental closed-loop supply (ECLSC) chain is important for enterprises' competitiveness. In this paper, a robust ECLSC network is investigated which includes multiple plants, collection centers, demand zones, and products, and consists of both forward and reverse supply chains. First, a robust multi-objective mixed integer nonlinear programming model is proposed to deal with ECLSC considering two conflicting objectives simultaneously, as well as the uncertain nature of the supply chain. Cost parameters of the supply chain and demand fluctuations are subject to uncertainty. The first objective function aims to minimize the economical cost and the second objective function is to minimize the environmental influence. Then, the proposed model is solved as a single-objective mixed integer programming model applying the LP-metrics method. Finally, numerical example has been presented to test the model. The results indicate that the proposed model is applicable in practice.     

Global optimization of mixed-integer bilevel programming problems

Two approaches that solve the mixed-integer nonlinear bilevel programming problem to global optimality are introduced. The first addresses problems mixed-integer nonlinear in outer variables and C²-nonlinear in inner variables. The second adresses problems with general mixed-integer nonlinear functions in outer level. Inner level functions may be mixed-integer nonlinear in outer variables, linear, polynomial, or multilinear in inner integer variables, and linear in inner continuous variables. This second approach is based on reformulating the mixed-integer inner problem as continuous via its vertex polyheral convex hull representation and solving the resulting nonlinear bilevel optimization problem by a novel deterministic global optimization framework. Computational studies illustrate proposed approaches.     

Environmental supply chain network design using multi-objective fuzzy mathematical programming

The concern about environmental impact of business activities has spurred an interest in designing environmentally conscious supply chains. This paper proposes a multi-objective fuzzy mathematical programming model for designing an environmental supply chain under inherent uncertainty of input data in such problem. The proposed model is able to consider the minimization of multiple environmental impacts beside the traditional cost minimization objective to make a fair balance between them. A life cycle assessment-based (LCA-based) method is applied to assess and quantify the environmental impact of different options for supply chain network configuration. Also, to solve the proposed multi-objective fuzzy optimization model, an interactive fuzzy solution approach is developed. A real industrial case is used to demonstrate the significance and applicability of the developed fuzzy optimization model as well as the usefulness of the proposed solution approach.     

考虑风险偏好的动态生产库存问题的鲁棒优化模型

不同阶段需求不确定情况下,决策者的风险偏好和生产过程中的废品处理影响着供应链生产库存管理和供应链整体效益。本文考虑决策者风险偏好下,构建了包含I个生产者企业,一个库存点和一个废物处理基地的T阶段动态供应链生产库存框架,建立了椭球型需求不确定集下,以追求整体收益最大化为目标的不确定优化模型,并应用鲁棒优化理论得到了数据确定性线性鲁棒对应模型,讨论了模型解的可靠性和有效性。最后的算例表明,只有当决策者风险偏好参数在一定范围内时,才会存在满足条件且具有较高可靠性的鲁棒决策,验证了该鲁棒优化模型的合理性。     

Robust supply chain network design with multi-products for a company in the food sector

The paper aims to solve a problem faced by a company competing in the snacks market in Turkey. In line with the growth in this market, the company needs to make important decisions over the next few years about the timing and location of a new plant, its initial capacity, the timing and amount of additional capacity to be installed at the new and existing plants, the assignment of demand points to plants and the amount of raw materials to be shipped from suppliers to the plants in each period. The objective is to minimize the total cost of various components. The problem is formulated as a multi-period supply chain network design model with multi products. The resulting mixed-integer linear programming model is solved by the commercial solver CPLEX. This model enables us to carry out all analyses requested by the company in an efficient way. After this deterministic model is solved on the basis of a 9% annual increase in demand, it is extended to a minimax regret model to deal with uncertainty in demand quantities. The results suggest that opening the new plant in the city of İzmir is indeed a robust solution that is unaffected in different scenarios that are based on three distinct demand increase rates. Even though the location of the new plant remains unchanged with respect to scenarios, the optimal robust solution differs from the optimal solution of each scenario in terms of the capacity expansion decisions. After all obtained results had been communicated to the company managers and executives, the new plant construction was started in 2016 very close to the city that the mathematical model had determined. The new plant is expected to start operating in 2018.     

The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming

A new deterministic algorithm for solving convex mixed-integer nonlinear programming (MINLP) problems is presented in this paper: The extended supporting hyperplane (ESH) algorithm uses supporting hyperplanes to generate a tight overestimated polyhedral set of the feasible set defined by linear and nonlinear constraints. A sequence of linear or quadratic integer-relaxed subproblems are first solved to rapidly generate a tight linear relaxation of the original MINLP problem. After an initial overestimated set has been obtained the algorithm solves a sequence of mixed-integer linear programming or mixed-integer quadratic programming subproblems and refines the overestimated set by generating more supporting hyperplanes in each iteration. Compared to the extended cutting plane algorithm ESH generates a tighter overestimated set and unlike outer approximation the generation point for the supporting hyperplanes is found by a simple line search procedure. In this paper it is proven that the ESH algorithm converges to a global optimum for convex MINLP problems. The ESH algorithm is implemented as the supporting hyperplane optimization toolkit (SHOT) solver, and an extensive numerical comparison of its performance against other state-of-the-art MINLP solvers is presented.     

凸概率密度分布簇下的多损失鲁棒优化等价模型及在直营连锁企业中的应用

首先,证明了凸概率密度分布簇的单周期期望均值下单损失鲁棒优化等价模型定理,以及凸概率密度分布簇的单周期期望均值下多损失鲁棒优化等价模型。然后,提出了直营连锁企业的产品在凸概率密度分布簇下的期望均值的单周期生产分配供应问题,建立了直营连锁企业的单周期生产分配供应期望均值鲁棒模型,在获得近似周期概率分布簇情形下给出了单周期生产分配供应鲁棒模型,这种近似鲁棒模型等价于一个线性规划问题。最后,通过已知一个产品的4个周期构成的混合分布簇进行了数值实验,数值结果表明了期望均值准则下的生产分配供应鲁棒模型的生产分配供应策略更加稳健。     

A global optimization algorithm for reliable network design

In this paper, we consider the problem of designing reliable networks that satisfy supply/demand, flow balance, and capacity constraints, while simultaneously allocating certain resources to mitigate the arc failure probabilities in such a manner as to minimize the total cost of network design and resource allocation. The resulting model formulation is a nonconvex mixed-integer 0-1 program, for which a tight linear programming relaxation is derived using RLT-based variable substitution strategies and a polyhedral outer-approximation technique. This LP relaxation is subsequently embedded within a specialized branch-and-bound procedure, and the proposed approach is proven to converge to a global optimum. Various alternative partitioning strategies that could potentially be employed in the context of this branch-and-bound framework, while preserving the theoretical convergence property, are also explored. Computational results are reported for a hypothetical scenario based on different parameter inputs and alternative branching strategies. Related optimization models that conform to the same class of problems are also briefly presented.     

二层供应链网络均衡模型的研究

利用均衡理论和二层规划理论来研究供应链网络均衡问题。针对供应链网络中上下层成员之间具有的Stackelberg博弈特征以及同层成员之间具有的非合作博弈特征,构建了二层供应链网络的均衡模型,该模型实际上一个均衡约束的二层规划问题。此外,为了使得供应链网络在整体上实现最优,本文还在模型中引入回收契约以协调供应链网络。最后,利用罚函数法对模型进行了求解,算例分析说明了模型的合理性和有效性。     

Stochastic programming for optimizing bidding strategies of a Nordic hydropower producer

From the point of view of a price-taking hydropower producer participating in the day-ahead power market, market prices are highly uncertain. The present paper provides a model for determining optimal bidding strategies taking this uncertainty into account. In particular, market price scenarios are generated and a stochastic mixed-integer linear programming model that involves both hydropower production and physical trading aspects is developed. The idea is to explore the effects of including uncertainty explicitly into optimization by comparing the stochastic approach to a deterministic approach. The model is illustrated with data from a Norwegian hydropower producer and the Nordic power market at Nord Pool.     

Process planning in a fuzzy environment

Mixed-integer optimization models for chemical process planning typically assume that model parameters can be accurately predicted. As precise forecasts are difficult to obtain, process planning usually involves uncertainty and ambiguity in the data. This paper presents an application of fuzzy programming to process planning. The forecast parameters are assumed to be fuzzy with a linear or triangular membership function. The process planning problem is then formulated in terms of decision making in a fuzzy environment with fuzzy constraints and fuzzy net present value goals. The model is transformed to a deterministic mixed-integer linear program or mixed-integer nonlinear program depending on the type of uncertainty involved in the problem. For the nonlinear case, a global optimization algorithm is developed for its solution. This algorithm is applicable to general possibilistic programs and can be used as an alternative to the commonly used bisection method. Illustrative examples and computational results for a petrochemical complex with 38 processes and 24 products illustrate the applicability of the developed models and algorithms.     

Interactive fuzzy goal programming for a multi-objective closed-loop logistics network

Over the last decade, there has been increased attention to closed-loop logistics networks. Environmental legislation requires companies to be more responsible by collecting used products from customers. Companies can also benefit from savings that are related to recovering and recycling used products. Unlike previous studies, which only consider single products or a single period of time in multi-objective problems, this paper considers a multi-product multi-period closed-loop logistics network with different types of facilities. A?multi-objective mixed-integer nonlinear programming formulation is developed to minimize the total cost, the delivery time of new products, and the collection time of used products. Thus, this model better approximates real-life applications of closed-loop logistics problems. Interactive fuzzy goal programming (IFGP) is applied to solve the model for handling multiple objective problems with conflicting objectives and to address the imprecise nature of decision-makers?? aspiration levels for goals. The results from computational experiments performed here show that by changing the upper or lower bound of each objective function, one can obtain a better final solution of the problem and also can provide more options for decision makers to choose from based on their situation. Finally, the utilization rate of facilities is shown to be an important indicator when designing a logistics network.     

不确定彩排时长下节目调度的鲁棒优化

实际节目彩排调度中,节目的表演时长受内外因素影响,具有不确定性。为了合理调度所有节目,控制演员的空闲时间,使得演员的总等待成本最小,采用了鲁棒优化方法进行研究。首先,建立了节目彩排调度的确定型模型;进一步,考虑节目表演时长的不确定性,采用有界区间描述节目表演时长并考虑决策者风险偏好,在确定型模型的基础上构建区间型两阶段鲁棒优化模型;接着,将鲁棒优化模型转化为0-1混合线性规划模型;最后,采用Matlab进行数值实验,结果表明决策者越偏好规避风险,演员的总等待成本越大。