20,916 research outputs found
Performance optimization of a leagility inspired supply chain model: a CFGTSA algorithm based approach
Lean and agile principles have attracted considerable interest in the past few decades. Industrial sectors throughout the world are upgrading to these principles to enhance their performance, since they have been proven to be efficient in handling supply chains. However, the present market trend demands a more robust strategy incorporating the salient features of both lean and agile principles. Inspired by these, the leagility principle has emerged, encapsulating both lean and agile features. The present work proposes a leagile supply chain based model for manufacturing industries. The paper emphasizes the various aspects of leagile supply chain modeling and implementation and proposes a new Hybrid Chaos-based Fast Genetic Tabu Simulated Annealing (CFGTSA) algorithm to solve the complex scheduling problem prevailing in the leagile environment. The proposed CFGTSA algorithm is compared with the GA, SA, TS and Hybrid Tabu SA algorithms to demonstrate its efficacy in handling complex scheduling problems
Nash Game Model for Optimizing Market Strategies, Configuration of Platform Products in a Vendor Managed Inventory (VMI) Supply Chain for a Product Family
This paper discusses how a manufacturer and its retailers interact with each other to optimize their product marketing strategies, platform product configuration and inventory policies in a VMI (Vendor Managed Inventory) supply chain. The manufacturer procures raw materials from multiple suppliers to produce a family of products sold to multiple retailers. Multiple types of products are substitutable each other to end customers. The manufacturer makes its decision on raw materials’ procurement, platform product configuration, product replenishment policies to retailers with VMI, price discount rate, and advertising investment to maximize its profit. Retailers in turn consider the optimal local advertising and retail price to maximize their profits. This problem is modeled as a dual simultaneous non-cooperative game (as a Nash game) model with two sub-games. One is between the retailers serving in competing retail markets and the other is between the manufacturer and the retailers. This paper combines analytical, iterative and GA (genetic algorithm) methods to develop a game solution algorithm to find the Nash equilibrium. A numerical example is conducted to test the proposed model and algorithm, and gain managerial implications.supply chain management;nash game model;vendor managed inventory
Assessing the Consequences of Natural Disasters on Production Networks: A Disaggregated Approach
This article proposes a framework to investigate the consequences of natural disasters. This framework is based on the disaggregation of Input-Output tables at the business level, through the representation of the regional economy as a network of production units. This framework accounts for (i) limits in business production capacity; (ii) forward propagations through input shortages; and (iii) backward propagations through decreases in demand. Adaptive behaviors are included, with the possibility for businesses to replace failed suppliers, entailing changes in the network structure. This framework suggests that disaster costs depend on the heterogeneity of losses and on the structure of the affected economic network. The model reproduces economic collapse, suggesting that it may help understand the difference between limited-consequence disasters and disasters leading to systemic failure.Natural disasters, Economic impacts, Economic Network
Evolutionary multiobjective optimization of the multi-location transshipment problem
We consider a multi-location inventory system where inventory choices at each
location are centrally coordinated. Lateral transshipments are allowed as
recourse actions within the same echelon in the inventory system to reduce
costs and improve service level. However, this transshipment process usually
causes undesirable lead times. In this paper, we propose a multiobjective model
of the multi-location transshipment problem which addresses optimizing three
conflicting objectives: (1) minimizing the aggregate expected cost, (2)
maximizing the expected fill rate, and (3) minimizing the expected
transshipment lead times. We apply an evolutionary multiobjective optimization
approach using the strength Pareto evolutionary algorithm (SPEA2), to
approximate the optimal Pareto front. Simulation with a wide choice of model
parameters shows the different trades-off between the conflicting objectives
- …