Inventory control in a two-level supply chain with risk pooling effect

We consider an inventory control problem in a supply chain consisting of a single supplier, with a central distribution center (CDC) and multiple regional warehouses, and multiple retailers. We focus on the problem of selecting warehouses to be used among a set of candidate warehouses, assigning each retailer to one of the selected warehouses and determining replenishment plans for the warehouses and the retailers. For the problem with the objective of minimizing the sum of warehouse operation costs, inventory holding costs at the warehouses and the retailers, and transportation costs from the CDC to warehouses as well as from warehouses to retailers, we present a non-linear mixed integer programming model and develop a heuristic algorithm based on Lagrangian relaxation and subgradient optimization methods. A series of computational experiments on randomly generated test problems shows that the heuristic algorithm gives relatively good solutions in a reasonable computation time.     

Algorithm portfolios for logistics optimization considering stochastic demands and mobility allowance

The vehicle routing problem with stochastic demand (VRPSD) is a well known NP-hard problem. The uncharacteristic behaviour associated with the problem enhances the computational efforts required to obtain a feasible and near-optimal solution. This paper proposes an algorithm portfolio methodology based on evolutionary algorithms, which takes into account the stochastic nature of customer demand to solve this computationally complex problem. These problems are well known to have computationally complex objective functions, which make their solutions hard to find, particularly when problem instances of large dimensions are considered. Of particular importance in such situations is the timeliness of the solution. For example, Apple was forced to delay their shipments of iPads internationally due to unprecedented demand and issues with their delivery systems in Samsung Electronics and Seiko Epson. Such examples illustrate the importance of stochastic customer demands and the timing of delivery. Moreover, most of the evolutionary algorithms, known for providing computationally efficient solutions, are unable to always provide optimal or near optimal solutions to all the VRPSD instances within allocated time interval. This is due to the characteristic variations in the computational time taken by evolutionary algorithms for same or varying size of the VRPSD instances. Therefore, this paper presents portfolios of different evolutionary algorithms to reduce the computational time taken to resolve the VRPSD. Moreover, an innovative concept of the mobility allowance (MA) in landmoves based on the levy’s distribution function has been introduced to cope with real situations existing in vehicle routing problems. The proposed portfolio approach has been evaluated for the varying instances of the VRPSD. Four of the existing metaheuristics including Genetic Algorithm (GA), Simulated Annealing (SA), Artificial Immune System (AIS), TABU Search (TS) along with new neighbourhood search, are incorporated in the portfolios. Experiments have been performed on varying dimensions of the VRPSD instances to validate the different properties of the algorithm portfolio. An illustrative example is presented to show that the set of metaheuristics allocated to certain number of processors (i.e. algorithm portfolio) performed better than their individual metaheuristics.     

An efficient hybrid genetic algorithm for the multi-product multi-period inventory routing problem

The inventory routing problem (IRP) addressed in this study is a many-to-one distribution network consisting of an assembly plant and many distinct suppliers where each supplies a distinct product. We consider a finite horizon, multi-periods, multi-suppliers and multi-products where a fleet of capacitated homogeneous vehicles, housed at a depot, transport products from the suppliers to meet the demand specified by the assembly plant in each period. The demand for each product is deterministic and time varying. A mathematical formulation of the problem is given and CPLEX 9.1 is run for a finite amount of time to obtain lower and upper bounds. A hybrid genetic algorithm, which is based on the allocation first route second strategy and which considers both the inventory and the transportation costs, is proposed. In addition to a new set of crossover and mutation operators, we also introduce two new chromosome representations. Several medium and small sized problems are also constructed and added to the existing data sets to show the effectiveness of the proposed approach.     

The selective pickup and delivery problem: Formulation and a memetic algorithm

The pickup and delivery problem addresses the real-world issues in logistic industry and establishes an important category of vehicle routing problems. The problem is to find the shortest route to collect and distribute commodities under the assumption that the total supply and the total demand are in equilibrium. This study presents a novel problem formulation, called the selective pickup and delivery problem (SPDP), by relaxing the constraint that all pickup nodes must be visited. Specifically, the SPDP aims to find the shortest route that can supply delivery nodes with required commodities from some pickup nodes. This problem can substantially reduce the transportation cost and fits real-world logistic scenarios. Furthermore, this study proves that the SPDP is NP-hard and proposes a memetic algorithm (MA) based on genetic algorithm and local search to resolve the problem. A novel representation of candidate solutions is designed for the selection of pickup nodes. The related operators are also devised for the MA; in particular, it adapts the 2-opt operator to the sub-routes of the SPDP for enhancement of visiting order. The experimental results on several SPDP instances validate that the proposed MA can significantly outperform genetic algorithm and tabu search in terms of solution quality and convergence speed. In addition, the reduced route lengths on the test instances and the real-world application to rental bikes distribution demonstrate the benefit of the SPDP in logistics.     

A multiple ant colony optimization algorithm for the capacitated location routing problem

The success of a logistics system may depend on the decisions of the depot locations and vehicle routings. The location routing problem (LRP) simultaneously tackles both location and routing decisions to minimize the total system cost. In this paper a multiple ant colony optimization algorithm (MACO) is developed to solve the LRP with capacity constraints (CLRP) on depots and routes. We decompose the CLRP into facility location problem (FLP) and multiple depot vehicle routing problem (MDVRP), where the latter one is treated as a sub problem within the first problem. The MACO algorithm applies a hierarchical ant colony structure that is designed to optimize different subproblems: location selection, customer assignment, and vehicle routing problem, in which the last two are the decisions for the MDVRP. Cooperation between colonies is performed by exchanging information through pheromone updating between the location selection and customer assignment. The proposed algorithm is evaluated on four different sets of benchmark instances and compared with other algorithms from the literature. The computational results indicate that MACO is competitive with other well-known algorithms, being able to obtain numerous new best solutions.     

农村公共物品供给中存在的问题与对策分析

目前,我国农村公共物品供给存在着很多问题,如财政支农结构不合理、供需不平衡、供给主体单一、政府低效率等。为此,必须加大财政支持力度,引入农民的需求表达制度,明确基层政府提供农村公共物品的职责,拓宽农村公共物品建设的融资渠道,建立多元化的供给模式,建设服务型乡镇政府,建立政府与农民合作共治的管理体制,以保证农村公共物品的有效供给。     

Multi-agent-based transport planning in the newspaper industry

In many cases of today's planning tasks, the synchronization of production and distribution is becoming increasingly important in order to minimize costs and to maximize customer satisfaction. This is especially the case if transport schedules are closely connected to production schedules, as it is in the newspaper industry—where perishable goods are distributed immediately after production. In order to achieve the above mentioned competing objectives, a special kind of vehicle routing problem, the vehicle routing problem with time windows and cluster-dependent tour starts (VRPTWCD), has to be solved. Moreover, the varying print and post-processing schedules due to unknown editorial deadlines lead to the need for a dynamic online control of the newspaper production and distribution process. In this contribution, the outlined dynamic transport problem is solved online under consideration of unforeseen changes in production schedules. The solution concept is based on a multi-agent system consisting of, amongst others, several Edition and Vehicle Agents. This system is exemplarily applied to a real life application case of one of the largest German newspaper companies. It is shown that a static (centralized) optimization of the underlying problem would even lead to worse results in comparison to the current situation and that the appliance of the multi-agent system is suitable in the newspaper industry.     

Integrated safety stock optimization for multiple sourced stockpoints facing variable demand and lead time

The safety stock placement problem of a multi-stage supply chain comprising multiple sourced stockpoints is addressed in this paper. Each stockpoint faces variability in its downstream demand and suppliers' lead time. The maximum among these suppliers' lead time is determined by employing concepts of order statistics. It is required to find the fill rate and safety stocks at each stockpoint that leads to satisfying the end customer service level at minimum safety stock placement cost. Hence, the fill rates and the safety amounts are decided from a global supply chain perspective. Two models are proposed; a decentralized safety stock placement model and a centralized consolidation model. The decentralized model finds the safety amounts at each stockpoint required to face its underlying lead time demand variability. The consolidation model finds the consolidated safety amounts that will be kept in the relevant consolidation center at each stage. A Benders decomposition technique is developed to handle the nonlinearity and binary restrictions involved in the safety stock consolidation model. Strategies proposed by the consolidation model achieve 45.2-62% reduction in safety amounts that results in a cost savings ranging between 22.2-44.2% as compared to the strategies proposed by the decentralized model.     

Fuzzy approach to the spatial games in the total market area

The paper presents a fuzzy approach to building up a model of spatial hierarchy based on spatial games. It is derived from the analytical model by Bogataj and Bogataj (Int. J. Prod. Econ. 71 (1–3) (2001) 277). The main strategic problems of a supply chain are connected with the question of location and capacity of individual activity cells to achieve the best supply chain coordination. The results of supply chain coordination between two activity cells on the plain originate from Girlich's research paper (Inventory Modelling, Lecture Notes of the International Postgraduate Summer School, Vol. 2, ISIR, Budapest-Protoroz, 1995, pp. 13–24) and have been later transformed in frequency space, using the methodology of input–output analysis, Laplace transforms and MRP developed at Linköping Institute of Technology by Grubbström and his research group. The analytical results developed by Bogataj and Bogataj (2001) are compared with the results achieved by fuzzy set approach. In our paper the problem is formulated as a non-constant sum game. In this case the total market area is constant and the conditions for lower central places are described for different positions of these central places in an urban hierarchy in the case of two-level production. The results of fuzzy approach in logistic games are compared with analytical results.     

A multi-objective robust optimization model for multi-product multi-site aggregate production planning in a supply chain under uncertainty

Manufacturers need to satisfy consumer demands in order to compete in the real world. This requires the efficient operation of a supply chain planning. In this research we consider a supply chain including multiple suppliers, multiple manufacturers and multiple customers, addressing a multi-site, multi-period, multi-product aggregate production planning (APP) problem under uncertainty. First a new robust multi-objective mixed integer nonlinear programming model is proposed to deal with APP 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. Then the problem transformed into a multi-objective linear one. The first objective function aims to minimize total losses of supply chain including production cost, hiring, firing and training cost, raw material and end product inventory holding cost, transportation and shortage cost. The second objective function considers customer satisfaction through minimizing sum of the maximum amount of shortages among the customers’ zones in all periods. Working levels, workers productivity, overtime, subcontracting, storage capacity and lead time are also considered. Finally, the proposed model is solved as a single-objective mixed integer programming model applying the LP-metrics method. The practicability of the proposed model is demonstrated through its application in solving an APP problem in an industrial case study. The results indicate that the proposed model can provide a promising approach to fulfill an efficient production planning in a supply chain.     

基于模型预测轮廓控制的自动驾驶车辆路径跟踪控制

为了实现无人驾驶汽车的路径跟踪和避障功能,基于模型预测轮廓控制提出一种路径跟踪控制策略。首先将二自由度单轨车辆模型和Pacejka轮胎模型结合在一起搭建整车模型,遵循模型预测的思路将路径规划和跟踪问题结合为一个非线性优化问题,利用线性化得到线性时变模型,在每个采样时间内以凸二次规划的形式建立非线性优化问题的局部逼近。其次,为了使车辆在跟踪路径的时候维持稳定,结合车辆稳定包络线,施加横向稳定性约束,并通过施加车道线边界约束,实现自动驾驶车辆的避障功能。最后将Matlab/Simulink和Carsim结合进行联合仿真。仿真结果表明,所设计的控制器在较宽路面能自主规划出一条最短路径,实现了跟踪和避障功能,同时维持了车辆在行驶中的稳定性和安全性,在赛道竞速下具有较明显的优势。研究结果可为结构化道路下的汽车自动驾驶提供技术参考,具有一定的应用价值。     

Managerial practices driving knowledge creation,learning and transfer in translational research: an exploratory case study

Despite its growing popularity in the biomedical literature, the particular phenomenon of translational research management has not been addressed from an organizational and strategic perspective yet. Our study aims to fill this gap by identifying a set of managerial practices that could influence how knowledge is created, amplified and transferred from biomedical research both to clinical practice and the productive sector. As a result of the theoretical review, we have proposed a preliminary model to guide our empirical work. We have developed an exploratory case study to gather organisational information from an outstanding translational research center. The results obtained from the analysis have allowed us to build an induced model of managerial practices that both affect the creation, integration and transfer of knowledge in the translational research organization studied, as well as derives a set of research propositions. Finally, we present the main academic and managerial implications of the work, together with its limitations and related future research lines.     

Ship routing problem with berthing time clash avoidance constraints

We consider a ship routing problem in which multiple vessels have to perform pickups and deliveries of cargoes at various locations. The loading and unloading time of cargoes at pickup and delivery locations is significant, and at each of these locations we need to assign a time slot to each vessel to perform the loading/unloading task so as to avoid time clashes. This problem is motivated by the operations of feeder vessels and company-owned cargo terminals, where the shipping company wishes to coordinate the routing and the berthing time of its vessels. We develop a heuristic algorithm for the problem using set partitioning formulation and column generation techniques. The effectiveness of the heuristic is tested via extensive computational experiments.     

Efficient location of industrial activity cells in a global supply chain

Inefficient locations for production, distribution and reverse logistics plants will result in excess costs no matter how well material requirements planning (MRP), inventory control, distribution and information sharing decisions are optimized. In this paper we study ways in which aspect of activity cell location decisions can be analyzed within an extended MRP model. This model has previously been extended by including distribution and reverse logistics components in a compact form, presented in Grubbström et al. (2007). Our aim is to demonstrate the basic differences between an approach to location problems with MRP “under the same roof” as the global supply chain, in which transportation time delays and direct transportation costs have substantial influence. We discuss possibilities of how to present location aspects in the supply chain model obtained from combining input–output analysis and Laplace transforms in four sub-systems, namely manufacturing, distribution, consumption and reverse logistics, and show how the transportation costs and lead time influenced by the location of all these activities affect the resulting net present value (NPV). Our aim is to build a model supporting decisions concerning the structure of a supply chain as an alternative to a mixed integer programming formulation. The model developed is based on the use of continuous functions describing spatial distributions of cost and customer demand. Continuous functions are embedded in the MRP extension previously introduced in Grubbström et al. (2007).Location decisions influence (i) production costs, because timing influences the cost of activities involved in creating a product, cf. (Grubbström and Bogataj, submitted for publication), and (ii) logistics costs, which refer to the procurement and physical transmission of materials through the supply chain. In this current paper we wish to combine both of these aspects into a comprehensive model, where we show the interaction between the “space of flows” and the “space of places” as Giovanni Arrighi distinguishes one from the other in his book The Long Twentieth Century.     

A system-wide interdisciplinary conceptual framework for food loss and waste mitigation strategies in the supply chain

The issues of food loss and waste (FLW) in the global supply chains have recently gained attention. However, causes for FLW and their mitigation strategies for curbing FLW at different stages of the supply chains remains under researched. Our research aims to address these research gaps in a three-fold way: i), we identified key causes (through root-cause analysis) of FLW in the supply chain of developed and less developed countries; ii), systematically classified measures and policies, which have been implemented to mitigate FLW; iii), developed an interdisciplinary conceptual framework for waste utilisation practices that can contribute towards the triple bottom-line in food system. A root-cause analysis was performed, and mitigation strategies identified by systematically analysing and synthesizing the extant research published over the past 20 years (1998 to 2018) in the areas of food loss and waste in the supply chain. A conceptual model for the prevention of FLW utilising a systems approach through the circular economy concept has been proposed. Since the agri-food sector is largely interdisciplinary, we have also demonstrated a method of integrating contributions from multiple disciplines in our proposed model towards achieving a total depollution (zero waste supply chain).     

A strategic-tactical model for the supply chain design in the delocalization context: Mathematical formulation and a case study

In this paper, we propose a mathematical model for the design of supply chains in the delocalization context. Our main objective is to develop a strategic-tactical supply chain design model that integrates all the relevant components that characterize the delocalization problem. We adopt the activity based approach to model the problem and we focus on the logistic decisions of activity location, technology choice, supplier selection, etc., and the financial decisions of transfer pricing, transportation costs allocation, etc. The mathematical formulation is illustrated by a case study from the automotive sector. A comparison between the model solution and the real decisions is used to prove the applicability and the utility of the proposed model.     

The relationship between supply chain factors and adoption of e-Collaboration tools: An empirical examination

We consider minimum-cost scheduling of different vehicle types on a predetermined set of one-way trips. Trips have predetermined ready times, deadlines and associated demands. All trips must be performed. The total time of operations on any vehicle is limited. We develop a mixed integer model to find the optimal number of vehicles at a minimum cost. Based on the hard nature of the problem, we propose six heuristics. Computational results reveal that heuristics return exceptionally good solutions for problem instances with up to 100 jobs in very small computation times, and are likely to perform well for larger instances.     

A block mining and re-combination enhanced genetic algorithm for the permutation flowshop scheduling problem

The goal of block mining is to obtain a set of genes that contain dependency among gene relationships. Such blocks without overlapping of genes can be further merged to form a new chromosome and the quality of the new chromosome can be greatly improved. Based on this concept, we propose a novel block mining method that is able to locate common structures or to establish new blocks (like a small piece of puzzle) from a set of high fit chromosomes. The identified blocks (puzzles) will also be updated generation by generation through the newly updated high fit chromosomes. We develop a heuristic re-combination procedure to form a new chromosome by re-combining the blocks. We call the new chromosomes generated as artificial chromosomes (ACs) and inject them into the evolutionary process when the convergence slope of the evolutionary process is less than a predefined threshold. This new algorithm retains the regular simple genetic algorithm (SGA) operations of crossover and mutation, and utilizes the ACs generated from elites to speed up the convergence process. Experimental results indicate that the puzzle-based method of chromosome generation is very efficient and effective in solving the traditional permutation flowshop scheduling problem. The new method can be applied to tackle other NP-complete problems such as scheduling and vehicle routing problems.     

Maximizing production rate and workload smoothing in assembly lines using particle swarm optimization

Particle swarm optimization (PSO) one of the latest developed population heuristics has rarely been applied in production and operations management (POM) optimization problems. A possible reason for this absence is that, PSO was introduced as global optimizer over continuous spaces, while a large set of POM problems are of combinatorial nature with discrete decision variables. PSO evolves floating-point vectors (called particles) and thus, its application to POM problems whose solutions are usually presented by permutations of integers is not straightforward. This paper presents a novel method based on PSO for the simple assembly line balancing problem (SALBP), a well-known NP-hard POM problem. Two criteria are simultaneously considered for optimization: to maximize the production rate of the line (equivalently to minimize the cycle time), and to maximize the workload smoothing (i.e. to distribute the workload evenly as possible to the workstations of the assembly line). Emphasis is given on seeking a set of diverse Pareto optimal solutions for the bi-criteria SALBP. Extensive experiments carried out on multiple test-beds problems taken from the open literature are reported and discussed. Comparisons between the proposed PSO algorithm and two existing multi-objective population heuristics show a quite promising higher performance for the proposed approach.     

Mutual impacts of product standardization and supply chain design

This paper deals with two major issues for industries; the product design and the supply chain design. These problems are usually solved separately, but in recent years, approaches were proposed to tackle these two problems together. In this paper, we investigate more precisely the links between the standardization of products or components, and the design of the supply chain. First, we show on a little example that there is a great interest to consider simultaneously these two decisions, and that solving these interdependent problems separately could result in a suboptimal, or even a bad, decision. Then, on a simplified problem issued from an industrial case study, we outline the impact of standardization choices on the structure of the supply chain and the gain that can be obtained from solving the problem as a unique compound optimization model. To illustrate the solutions of the problem, we propose graphics in order to visualize, in function of quantities and/or transportation costs, the best decision for the product standardization and for the supply chain design. Graphics also permit to anticipate the impacts of a variation of either quantities or transportation costs, from a specific situation. Such graphics they could be used in a decision aid tool to help companies in their choices. Finally, we show that costs and supply chain structure are highly impacted.