This paper considers an inventory system consisting of one supplier and one retailer, and studies a joint inventory policy and transport capacity decision for this inventory system with carbon emissions. The joint decision simultaneously determines the reorder interval of the retailer and the number of the vehicles used to transport the product from the supplier to the retailer while minimizing the inventory replenishment related cost and the carbon emission cost. This paper considers the carbon emissions from holding and replenishing inventory at the retailer, and calculates the carbon emissions based on the reorder interval of the retailer and the number of the vehicles used to transport the product. This problem is formulated as a nonlinear mixed integer programming, and an algorithm is designed to solve the nonlinear mixed integer programming to optimality. The computational results show that the integrated model proposed in this paper can reduce the system-wide cost and the carbon emissions by 5.6% and 14.42% in average, respectively. For the cases that the product with low fixed ordering cost and the vehicle with high fuel consumption, the superiority of the integrated model is more prominent. Besides, the computational results also provide some other management insights.
1 December 2016 in Computers & Industrial Engineering
In this paper, we consider an integrated supply chain network design problem, which incorporates inventory and pricing decisions into the capacitated facility location model. We assume that each warehouse has a capacity limitation that limits the average demand flowing through the warehouse and that the supplier can choose whether to satisfy each potential retailer’s demand. We formulate the problem as a nonlinear integer programming model and solve the model via a Lagrangian relaxation based approach. We develop an efficient algorithm to solve the subproblem that arises from the Lagrangian relaxation procedure. Finally, we conduct extensive computational experiments to test the performance of the algorithms proposed in this paper and provide the managerial insights based on the computational results.
In this paper, we consider a distribution system consisting of one distribution center (DC), a set of ports, and a set of retailers, in which the product is distributed to the retailers from the DC through the ports by the water transport, and study inventory management for the distribution system with considering the effect of the free storage periods provided by the ports. Inventory management for the distribution system is to determine the order intervals of the DC and the retailers while minimizing the inventory ordering and holding costs. Focusing on stationary and integer‐ratio policies, we formulate this inventory management problem as an optimization problem with a convex objective function and a set of integer‐ratio constraints and present O(NlogN) time algorithm to solve the relaxed problem (relaxing the integer‐ratio constraints) to optimality, where N is the number of the retailers. We prove that the relaxed problem provides a lower bound on average cost for all the feasible policies (containing dynamic policies) for this inventory management problem. By using the optimal solution of the relaxed problem, we build a stationary integer‐ratio policy (a power‐of‐two policy) for this inventory management problem and prove that the power‐of‐two policy can approximate the optimal inventory policy to 83% accuracy.
The problem of group decision making toward expressing preference relation in linguistic labels in fuzzy decision system, constructs deviation function by transform function , make use of the idea of optimization, builds optimal model, an optimal algorithm of group decision making based on linguistic preference information is proposed, called "least variance method". Calculate simply and manipulate easily are features of this method, and finally, an example is given to show the efficiency and practicality of this method.
This work makes an exhaustive search for generic renormalizable R-symmetric Wess-Zumino models with up to 5 chiral fields, and checks the consistency of their vacuum solutions with predictions from the Nelson-Seiberg theorem and its generalizations. Each model is recorded as the R-charge assignment of fields, which uniquely determines the cubic polynomial superpotentials with generic coefficients. Redundancy from permutation symmetries and reducible models are properly eliminated in the searching algorithm. We found that among 859 models in total, 19 of them have supersymmetric vacua unpredicted by the Nelson-Seiberg theorem and its generalizations. These exceptional models have their specific R-charge assignments covered by constructions found in previous literature. The search result can be used to estimate the accuracy of the field counting method for finding supersymmetric models in the string landscape. More applications of the dataset are expected in future work.