A branch-and-price algorithm for production routing problems with carbon cap-and-trade

This study presents a model for a pollution production-routing problem under carbon cap-and-trade. The aim is to incorporate carbon emissions into production inventory and routing decisions. The model is characterized by an additional flow-related cost structure, which generalizes models for pollution-routing problems and production inventory and routing problems. Correspondingly, we develop a branch-and-price heuristic by incorporating a column-generation formulation based on the Dantzig–Wolfe decomposition. In addition, we design an ad hoc label-setting algorithm to deal with time-slice networks in pricing subproblems. Computational results allow us to provide managerial insights concerning reduction of carbon emissions in supply chains. We prove that the model has the potential to reduce emission levels of carbon dioxide and operational costs.     

动态投入占用产出分析模型应用中的三个特殊处理问题

动态投入占用产出分析模型应用于经济分析实践有不少复杂问题需要相机处理,本文对其中的投资时滞、生产能力利用程度和库存与固定资本的生产性质差异等三个问理提出了相应的处理技术,建立了实用I—O—O模型．     

Sensing Abnormal Resource Flow Using Adaptive Limit Process Charts in a Complex Supply Network*

Supply networks are becoming increasingly complex with multiple overlapping relationships between firms that may span across industries. Consequently, inventory management is becoming more difficult as managers have to cope with variability in the supply flows that originate from different parts of the network. Managers that quickly sense abnormal flows may intervene and adapt their inventory policies in response to system changes. In this article, we present a framework for sensing abnormal flows originating within the upstream supply network of a focal organization. Our framework combines time series modeling with process charts to identify abnormal flow patterns in the incoming supply streams. It is a flexible framework that uses off‐the‐shelf technology to provide managers with a process that can be employed for monitoring multiple individual or aggregated data streams originating within any complex system such as complex adaptive supply networks. We illustrate our framework on four years of longitudinal supply data from the second largest food bank in the United States. We identify multiple instances of abnormal supply flows and validate our results through rigorous inventory analysis as well as field‐based expert interviews. We discuss the implications of our findings for inventory management in complex supply networks, both from academic and practitioner points of view.     

A heuristic for inventory management of slow-moving items

Abstract. The traditional approach in the study of inventory systems is to give more importance to items whose demands are either large or very difficult to forecast, discounting the importance of inventory items with small demand. The objective of this paper is to present a simple and practical heuristic to the slow-moving items problem. First we provide insight into previous work in this area and also give a brief outline of classical models in stochastic inventory theory. Then we present the proposed approach and detail the heuristic. We summarize the paper with an analysis of the simulation results and finish with the conclusions that are drawn from the results.     

Optimal design of supply chain networks under uncertain transient demand variations

We consider a detailed mathematical formulation for the problem of designing supply chain networks comprising multiproduct production facilities with shared production resources, warehouses, distribution centers and customer zones and operating under time varying demand uncertainty. Uncertainty is captured in terms of a number of likely scenarios possible to materialize during the lifetime of the network. The problem is formulated as a mixed-integer linear programming problem and solved to global optimality using standard branch-and-bound techniques. A case study concerned with the establishment of Europe-wide supply chain is used to illustrate the applicability and efficiency of the proposed approach. The results obtained provide a good indication of the value of having a model that takes into account the complex interactions that exist in such networks and the effect of inventory levels to the design and operation.     

Performance analysis of serial supply chain networks considering system disruptions

The supply chain networks could be very fragile in global environment due to unexpected events such as emergencies, normal disruptions and industrial accidents. The supply chain members may lose their production capacities temporarily, which might have significant impacts on the performance of the whole supply chain network. This article proposes a discrete time model to characterise the unreliable production capacity in serial supply chain networks. Based on the proposed model, the exact probability distributions are available for the performance analysis of a single-stage system in the lost sales scenario. The iterative methods are developed to derive the approximate performance measures for single-stage systems in the backorder scenario and multi-stage systems in both the lost sales and backorder scenarios. The proposed methods are verified through a series of numerical experiments. The analysis results suggest that the performance of the supply chain network suffers more from the downstream-stage unreliability than the upstream-stage unreliability. Furthermore, some application examples are illustrated to show the possible solutions for practical problems.     

Hedging strategic flexibility in the distribution optimization problem

Motivated by the increasing prevalence of flexibility hedging in corporate-level risk management programs, this paper focuses on the treatment of hedging operational risks in the coordinated replenishment and shipment for distribution systems. The forward option pricing model with the generalized autoregressive conditional heteroskedasticity (GARCH) model for stochastic demand forecasting is adopted for constructing inventory volume flexibility. We therefore propose a hedge-based coordinated inventory replenishment and shipment (HCIRS) methodology for flexibly making inventory hedging and optimal routing assignment decisions as well as coordinating replenishment and shipment policies. The HCIRS methodology provides insight into strategic flexibility adopted for a real-life inventory–distribution problem faced by one of the major East Asia food supply networks and turns out to be very efficient. The proposed HCIRS methodology has provided evidence of better results than the traditional operational techniques for the presented case in this paper.     

The managerial implications of networking

Recent years have shown a proliferation of publications about interaction and networks. All in all, these articles and books tend to focus on the formulation of theory and hypotheses. Despite the relevance of further development of theoretical thought, managers display more interest in scientifically-based recommendations with direct practical relevance. Wim Biemans presents the findings of an in-depth analysis of seventeen cases of new product development in the Dutch medical equipment industry by discussing eight critical success factors related to networking. He maintains that, while the existence of networks offers great opportunities to management, the practice of networking involves some serious potential pitfalls and problems as well. The conclusions are summarized by The Five C's of Innovation Management.“Marketing can be seen as relationship management: creating, developing, and maintaining a network in which the firm thrives”(Gummesson).     

Two-Group Classification Using Neural Networks*

Artificial neural networks are new methods for classification. We investigate two important issues in building neural network models; network architecture and size of training samples. Experiments were designed and carried out on two-group classification problems to find answers to these model building questions. The first experiment deals with selection of architecture and sample size for different classification problems. Results show that choice of architecture and choice of sample size depend on the objective: to maximize the classification rate of training samples, or to maximize the generalizability of neural networks. The second experiment compares neural network models with classical models such as linear discriminant analysis and quadratic discriminant analysis, and nonparametric methods such as k-nearest-neighbor and linear programming. Results show that neural networks are comparable to, if not better than, these other methods in terms of classification rates in the training samples but not in the test samples.     

Leveraging the Strengths of Choice Models and Neural Networks: A Multiproduct Comparative Analysis*

Choice models and neural networks are two approaches used in modeling selection decisions. Defining model performance as the out‐of‐sample prediction power of a model, we test two hypotheses: (i) choice models and neural network models are equal in performance, and (ii) hybrid models consisting of a combination of choice and neural network models perform better than each stand‐alone model. We perform statistical tests for two classes of linear and nonlinear hybrid models and compute the empirical integrated rank (EIR) indices to compare the overall performances of the models. We test the above hypotheses by using data for various brand and store choices for three consumer products. Extensive jackknifing and out‐of‐sample tests for four different model specifications are applied for increasing the external validity of the results. Our results show that using neural networks has a higher probability of resulting in a better performance. Our findings also indicate that hybrid models outperform stand‐alone models, in that using hybrid models guarantee overall results equal or better than the two stand‐alone models. The improvement is particularly significant in cases where neither of the two stand‐alone models is very accurate in prediction, indicating that the proposed hybrid models may capture aspects of predictive accuracy that neither stand‐alone model is capable of on their own. Our results are particularly important in brand management and customer relationship management, indicating that multiple technologies and mixture of technologies may yield more accurate and reliable outcomes than individual ones.     

Inventory control with seasonality of lead times

The practical challenges posed by the seasonality of lead times have largely been ignored within the inventory control literature. The length of the seasons, as well as the length of the lead times during a season, may demonstrate cyclical patterns over time. This study examines whether inventory control policies that anticipate seasonal lead-time patterns can reduce costs. We design a framework for characterizing different seasonal lead-time inventory problems. Subsequently, we examine the effect of deterministic and stochastic seasonal lead times within periodic review inventory control systems. We conduct a base case analysis of a deterministic system, enabling two established and alternating lead-time lengths that remain valid through known intervals. We identify essential building blocks for developing solutions to seasonal lead-time problems. Lastly, we perform numerical experiments to evaluate the cost benefits of implementing an inventory control policy that incorporates seasonal lead-time lengths. The findings of the study indicate the potential for cost improvements. By incorporating seasonality in length of seasons and length of lead times within the season into the control models, inventory controllers can make more informed decisions when ordering their raw materials. They need smaller buffers against lead-time variations due to the cyclical nature of seasonality. Reductions in costs in our experiments range on average between 18.9 and 26.4% (depending on safety time and the probability of the occurrence of stock out). Therefore, inventory control methods that incorporate seasonality instead of applying large safety stock or safety time buffers can lead to substantial cost reductions.     

Integrality in Stochastic Inventory Models

We study several finite‐horizon, discrete‐time, dynamic, stochastic inventory control models with integer demands: the newsvendor model, its multi‐period extension, and a single‐product, multi‐echelon assembly model. Equivalent linear programs are formulated for the corresponding stochastic dynamic programs, and integrality results are derived based on the total unimodularity of the constraint matrices. Specifically, for all these models, starting with integer inventory levels, we show that there exist optimal policies that are integral. For the most general single‐product, multi‐echelon assembly system model, integrality results are also derived for a practical alternative to stochastic dynamic programming, namely, rolling‐horizon optimization by a similar argument. We also present a different approach to prove integrality results for stochastic inventory models. This new approach is based on a generalization we propose for the one‐dimensional notion of piecewise linearity with integer breakpoints to higher dimensions. The usefulness of this new approach is illustrated by establishing the integrality of both the dynamic programming and rolling‐horizon optimization models of a two‐product capacitated stochastic inventory control system.     

Assessing bank soundness with classification techniques

The recent crisis highlighted, once again, the importance of early warning models to assess the soundness of individual banks. In the present study, we use six quantitative techniques originating from various disciplines to classify banks in three groups. The first group includes very strong and strong banks; the second one includes adequate banks, while the third group includes banks with weaknesses or serious problems. We compare models developed with financial variables only, with models that incorporate additional information in relation to the regulatory environment, institutional development, and macroeconomic conditions. The accuracy of classification of the models that include only financial variables is rather poor. We observe a substantial improvement in accuracy when we consider the country-level variables, with five out of the six models achieving out-of-sample classification accuracy above 70% on average. The models developed with multi-criteria decision aid and artificial neural networks achieve the highest accuracies. We also explore the development of stacked models that combine the predictions of the individual models at a higher level. While the stacked models outperform the corresponding individual models in most cases, we found no evidence that the best stacked model can outperform the best individual model.     

A Simulated Annealing Approach to Communication Network Design

This paper explores the use of the meta-heuristic search algorithm Simulated Annealing for solving a minimum cost network synthesis problem. This problem is a common one in the design of telecommunication networks. The formulation we use models a number of practical problems with hop-limit, degree and capacity constraints. Emphasis is placed on a new approach that uses a knapsack polytope to select amongst a number of pre-computed traffic routes in order to synthesise the network. The advantage of this approach is that a subset of the best routes can be used instead of the whole set, thereby making the process of designing large networks practicable. Using simulated annealing, we solve moderately large networks (up to 30 nodes) efficiently.     

Neighborhood-based uncertainty generation in social networks

Imprecision, incompleteness and dynamic exist in a wide range of network applications. It is difficult to decide the uncertainty relationship among nodes since traditional models are not meaningful in uncertain networks, and the inherent computational complexity of the problems with uncertainty is always intractable. In this paper, we study how to capture uncertainty in networks by transforming a series of snapshots of a network to an uncertain graph. A novel sampling scheme is also proposed which enables the development of efficient algorithms to measure uncertainty in networks. Considering the practical aspects of neighborhood relationship in real networks, a framework is introduced to transform an uncertain network into a deterministic weighted network where the weights on edges can be measured by Jaccard-like index. The comprehensive experimental evaluation results on real data demonstrate the effectiveness and efficiency of our algorithms.     

基于临期回收和响应供给策略的易逝性应急物资库存决策研究

基于降低由于需求时间和需求数量的不确定性会引致较高的过期损失和缺货损失,将临期回收策略和响应供给策略引入易逝性应急物资库存系统,同时考虑应急系统中需求时间不确定性的这一突出特性,建立临期回收策略和应急供给策略的随机规划模型,决策临期回收策略和响应供给策略下的最佳存储水平,并分析各策略带来的风险降低和价值增加。回收策略和应急供给策略并不都是有利的,存在着降低风险和增加价值的有利条件域;库存决策需要权衡风险的降低与价值的增加,给定一个判断标准;需求时间和需求数量的不同随机分布对策略的价值增加作用有不同的影响,且分布的不确定性程度对价值增加的影响不具有一致性和单调性。     

Neural Network Earnings per Share Forecasting Models: A Comparative Analysis of Alternative Methods

In this paper, we present a comparative analysis of the forecasting accuracy of univariate and multivariate linear models that incorporate fundamental accounting variables (i.e., inventory, accounts receivable, and so on) with the forecast accuracy of neural network models. Unique to this study is the focus of our comparison on the multivariate models to examine whether the neural network models incorporating the fundamental accounting variables can generate more accurate forecasts of future earnings than the models assuming a linear combination of these same variables. We investigate four types of models: univariate‐linear, multivariate‐linear, univariate‐neural network, and multivariate‐neural network using a sample of 283 firms spanning 41 industries. This study shows that the application of the neural network approach incorporating fundamental accounting variables results in forecasts that are more accurate than linear forecasting models. The results also reveal limitations of the forecasting capacity of investors in the security market when compared to neural network models.     

A classification approach based on the outranking model for multiple criteria ABC analysis

The multiple criteria ABC analysis is widely used in inventory management, and it can help organizations to assign inventory items into different classes with respect to several evaluation criteria. Many approaches have been proposed in the literature for addressing such a problem. However, most of these approaches are fully compensatory in multiple criteria aggregation. This means that an item scoring badly on one or more key criteria could be placed in good classes because these bad performances could be compensated by other criteria. Thus, it is necessary to consider the non-compensation in the multiple criteria ABC analysis. To the best of our knowledge, the ABC classification problem with non-compensation among criteria has not been studied sufficiently. We thus propose a new classification approach based on the outranking model to cope with such a problem in this paper. However, the relational nature of the outranking model makes the search for the optimal classification solution a complex combinatorial optimization problem. It is very time-consuming to solve such a problem using mathematical programming techniques when the inventory size is large. Therefore, we combine the clustering analysis and the simulated annealing algorithm to search for the optimal classification. The clustering analysis groups similar inventory items together and builds up the hierarchy of clusters of items. The simulated annealing algorithm searches for the optimal classification on different levels of the hierarchy. The proposed approach is illustrated by a practical example from a Chinese manufacturer. Furthermore, we validate the performance of the approach through experimental investigation on a large set of artificially generated data at the end of the paper.     

A comparison of simplified value function approaches for treating uncertainty in multi-criteria decision analysis

Uncertainty is present in many decisions where an action's consequences are unknown because they depend on future events. Multi-attribute utility theory (MAUT) offers an axiomatic basis for choice, but practitioners may prefer to use simpler decision models for transparency, ease of use, or other practical reasons. We identify some ‘simplified’ models currently in use and use a simulation experiment to evaluate their ability to approximate results obtained using MAUT. Our basic message is that avoiding assessment errors in the application of a simplified model is more important than the choice of a particular type of model, but that the best performance over a range of decision problems is from a model using a small number of quantiles.     

Spatial Transmission Models: A Taxonomy and Framework

Within risk analysis and, more broadly, the decision behind the choice of which modeling technique to use to study the spread of disease, epidemics, fires, technology, rumors, or, more generally, spatial dynamics, is not well documented. While individual models are well defined and the modeling techniques are well understood by practitioners, there is little deliberate choice made as to the type of model to be used, with modelers using techniques that are well accepted in the field, sometimes with little thought as to whether alternative modeling techniques could or should be used. In this article, we divide modeling techniques for spatial transmission into four main categories: population‐level models, where a macro‐level estimate of the infected population is required; cellular models, where the transmission takes place between connected domains, but is restricted to a fixed topology of neighboring cells; network models, where host‐to‐host transmission routes are modeled, either as planar spatial graphs or where shortcuts can take place as in social networks; and, finally, agent‐based models that model the local transmission between agents, either as host‐to‐host geographical contacts, or by modeling the movement of the disease vector, with dynamic movement of hosts and vectors possible, on a Euclidian space or a more complex space deformed by the existence of information about the topology of the landscape. We summarize these techniques by introducing a taxonomy classifying these modeling approaches. Finally, we present a framework for choosing the most appropriate spatial modeling method, highlighting the links between seemingly disparate methodologies, bearing in mind that the choice of technique rests with the subject expert.