SUPPLY CHAIN OPTIMIZATION Research Papers (original) (raw)
Business sustainability has become the hardest in the global market for any small or giant company in Bangladesh. Companies are adopting & implementing many approaches to sustain in the market. Cost cutting approach has been addressed as... more
As supply chains evolve towards optimal performance in economic and environmental dimensions of sustainability, resilience is required to address disturbances while maintaining their functionality. This research contributes to this topic,... more
As supply chains evolve towards optimal performance in economic and environmental dimensions of sustainability, resilience is required to address disturbances while maintaining their functionality. This research contributes to this topic, using enaR – an Ecosystems Network Analysis package for R software – to quantitatively evaluate the resilience of a sugar beet supply chain design. Six different configurations were generated using profit and cost optimization models and results were analyzed. The main conclusions are: a) the sugar beet supply chain features good resilience for all six configurations, and b) whenever a supply chain is optimized for eco-efficiency, resilience may be compromised.
Abstract Supply Chain Management (SCM) is a set of approaches tied up to integrate various stake holders along the supply chain namely, suppliers, manufacturers, warehouses, distributors, retailers, customers and all others who are adding... more
Abstract
Supply Chain Management (SCM) is a set of approaches tied up to integrate various stake holders along the supply chain namely, suppliers, manufacturers, warehouses, distributors, retailers, customers and all others who are adding value in fulfilling the customer requirements. SCM has gained enormous amount of importance among the participating companies and have realized it as an inevitable mode to achieve competitive advantage. In this paper we have developed mixed integer programming model for multi-vendor multi buyer supply chain problem with perishable products. The objective is to determine a periodic policy of production, supply and transportation that minimizing the sum of the inventory and transportation costs. A numerical case study is elucidated to demonstrate the salient features of the proposed model.
Keywords: vendor, buyer, supply chain, perishable products, mixed integer programming
In this article, a contemporary view of demand chain management (DCM) is provided along with an in-depth literature review that has tracked all of the relevant and key articles on the subject to date. While the concept of DCM is believed... more
In this article, a contemporary view of demand chain management (DCM) is provided along with an in-depth literature review that has tracked all of the relevant and key articles on the subject to date. While the concept of DCM is believed to have been introduced in the 1990's, there has not been much research on DCM relative to other areas such as supply chain management. The methodologies, industries, and cases study companies utilized in the literature are also documented. A unique field case from the home improvement industry is provided along with recommendations for future research in the DCM field.
This text proposes a mathematical programming approach to design international production-distribution networks for make-to-stock products with convergent manufacturing processes. Various formulations of the elements of... more
This text proposes a mathematical programming approach to design international production-distribution networks for make-to-stock products with convergent manufacturing processes. Various formulations of the elements of production-distribution network design models are discussed. The emphasis is put on modeling issues encountered in practice which have a significant impact on the quality of the logistics network designed. The elements discussed include the choice of an objective function, the definition of the planning horizon, the manufacturing process and product structures, the logistics network structure, demand and service requirements, facility layouts and capacity options, product flows and inventory modeling, as well as financial flows modeling. Major contributions from the literature are reviewed and a number of new formulation elements are introduced. A typical model is presented, and the use of successive mixed-integer programming to solve it with commercial solvers is discussed. A more general version of the model presented and the solution method described were implemented in a commercial supply chain design tool which is now available on the market.
We provide a contemporary view of demand chain management (DCM) and an in-depth literature review that has tracked all of the literature to date and detailed case studies. While the concept of DCM is believed to have been introduced in... more
We provide a contemporary view of demand chain management (DCM) and an in-depth literature review that has tracked all of the literature to date and detailed case studies. While the concept of DCM is believed to have been introduced in the 1990’s, there has not been much research on DCM.
Abstract Supplier selection is one important decision factors in the supply chain management. Suppliers are necessary entities to any business, however wrong selection may affect the whole business processes; therefore the process of... more
Abstract
Supplier selection is one important decision factors in the supply chain management. Suppliers are necessary entities to any business, however wrong selection may affect the whole business processes; therefore the process of selecting suppliers is extremely important. The success of a supply chain is dependent on selection of better suppliers. Decision makers and managers always face challenges to select suppliers, for procurement of raw material and components for their manufacturing process. In this paper we develop a Mixed Integer Programming Model for Multi product-Multi supplier -Multi period inventory lot size problem (MMMILP) with supplier selection. The solution of the optimal mathematical model is obtained in terms of determining (i) which products should be ordered to which supplier. (ii) The optimal quantity to be ordered and the time of placing orders. We introduce budget constraint, storage capacity constraint and quantity discount approach. A numerical case study is solve with Genetic algorithms.
Keywords: supplier selection, mixed integer programming, supply chain, genetic algorithm
This paper contemplates the supply chain design problem of a large-scale company by considering the maximization of the Net Present Value. In particular, the variability of the demand for each type of product at each customer zone has... more
This paper contemplates the supply chain design problem of a large-scale company by considering the maximization of the Net Present Value. In particular, the variability of the demand for each type of product at each customer zone has been estimated. As starting point, this paper considers an established supply chain for which the main problem is to determine the decisions regarding expansion of distribution centers. The problem is solved by using a mixed-integer linear programming model, which optimizes the different demand scenarios. The proposed methodology uses a scheme of optimization based on the generation of multiple demand scenarios of the supply network. The model is based on a real case taken from a multinational food company, which supplies to the Colombian and some international markets. The obtained results were compared with the equivalent present costs minimization scheme of the supply network, and showed the importance and ef ciency of the proposed approach as an alternative for the supply chain design with stochastic parameters.
This work presents a Mixed Integer Programing (MIP) formulation for a new complex NP-hard combinatorial optimization problem, the Location Inventory Routing with Distribution Outsourcing (LIRPDO). Due to its computational complexity, only... more
This work presents a Mixed Integer Programing (MIP) formulation for a new complex NP-hard combinatorial optimization problem, the Location Inventory Routing with Distribution Outsourcing (LIRPDO). Due to its computational complexity, only small problem instances can be solved by exact solvers. Therefore, a General Variable Neighborhood Search (GVNS)-based metaheuristic algorithm for solving large LIRPDO instances is presented. The proposed approach has been tested on 20 new randomly generated LIRPDO instances, 20 existing benchmark LIRP instances from the literature and 30 new large-scale random generated LIRP instances. An extended numerical analysis illustrates the efficiency of the underlying method, leading to acceptable solutions requiring limited computational effort.
This article considers a new class of multi-period network interdiction problems that focus on scheduling the activities of law enforcement in order to successfully interdict criminals in an illegal drug supply chain. This class of... more
This article considers a new class of multi-period network interdiction problems that focus on scheduling the activities of law enforcement in order to successfully interdict criminals in an illegal drug supply chain. This class of problems possesses several novel features for interdiction problems that were motivated through collaborations with city-level drug enforcement officials. These features include modeling the temporal aspects of these interdictions and the requirements associated with building interdictions in order to arrest high-ranking criminals in the drug supply chain. Based on these collaborations a systematic procedure is developed to generate realistic test instances of the multi-period network interdiction problem. Computational analysis on these realistic test instances provides some direction to the policies that law enforcement should implement in their interdiction activities.