scholarly journals Integrated Production and Distribution Planning for the Iron Ore Concentrate

2019 ◽  
Vol 2019 ◽  
pp. 1-10
Author(s):  
Wenbo Liu ◽  
Defeng Sun ◽  
Te Xu

This paper studies the production and distribution planning problem faced by the iron ore mining companies, which aims to minimize the total costs for the whole production and distribution system of the iron ore concentrate. The ores are first mined from multiple ore locations, and then sent to the corresponding dressing plant to produce ore concentrate, which will be sent to distribution centers and finally fulfill the customers' demands. This paper also tackles the difficulty of variable cut-off grade when making mining production planning decisions. A mixed-integer programming model is developed and then solved by a Lagrange relaxation (LR) procedure. Computational results indicate that the proposed solution method is more efficient than the standard solution software CPLEX.

2014 ◽  
Vol 2014 ◽  
pp. 1-10 ◽  
Author(s):  
S. M. Seyedhosseini ◽  
S. M. Ghoreyshi

In many conventional supply chains, production planning and distribution planning are treated separately. However, it is now demonstrated that they are mutually related problems that must be tackled in an integrated way. Hence, in this paper a new integrated production and distribution planning model for perishable products is formulated. The proposed model considers a supply chain network consisting of a production facility and multiple distribution centers. The facility produces a single perishable product that is storable only for predetermined periods. A homogenous fleet of vehicles is responsible for delivering the product from facility to distribution centers. The decisions to be made are the production quantities, the distribution centers that must be visited, and the quantities to be delivered to them. The objective is to minimize the total cost, where the trip minimization is considered simultaneously. As the proposed formulation is computationally complex, a heuristic method is developed to tackle the problem. In the developed method, the problem is divided into production submodel and distribution submodel. The production submodel is solved using LINGO, and a particle swarm heuristic is developed to tackle distribution submodel. Efficiency of the algorithm is proved through a number of randomly generated test problems.


2021 ◽  
Author(s):  
Niloofar Nadim Kabiri ◽  
Saeed Emami ◽  
Abdul Sattar Safaei

Abstract With the growth of multinational companies, increasing international and domestic competition between companies, upgrading information technology, and increasing customer expectations, accurate supply chain (SC) planning is essential. In such an environment, pollution has become more severe in recent decades, and with the weakening of the environment and global warming, green SC management (GSCM) strategies have become more attention in recent decades. In this research, we consider the integrated production and distribution (PD) planning problem of a multi-level green closed-loop SC (GCLSC) system, which includes multiple recycling, manufacturing/ remanufacturing, and distribution centers. We present a three-level bi-objective programming model to maximize profit and minimize the amount of greenhouse gas emissions. A hierarchical iterative approach utilizing the LP-metric method and the non-dominated sorting genetic algorithm (NSGA-II) is introduced to solve the proposed model. Also, the Taguchi approach is applied to find optimum control parameters of NSGA-II. Moreover, Monte Carlo (MC) simulation is applied to tackle uncertainty in demand, and the NSGA-II algorithm is fusioned with MC simulation (MCNSGA-II). The results obtained show that the simulation-optimization approach presented better results than the deterministic approach.


2015 ◽  
Vol 2015 ◽  
pp. 1-7 ◽  
Author(s):  
J. A. Marmolejo ◽  
I. Soria ◽  
H. A. Perez

This work presents a distribution problem of products of a soda bottling company. Commodities are produced at several plants with limited capacity and the demand of distribution centers is satisfied by shipping via cross-docking warehouses. The decomposition strategy is proposed to determine which warehouse needs to be opened to consolidate the demand and by which warehouse each distribution center is served exclusively. The objective is minimizing fixed costs and total transportation costs. The model presented is a mixed-integer programming model with binary variables for which we propose a decomposition strategy based on Benders algorithm. Numerical results show that the proposed strategy can provide the optimal solution of several instances. A large-scale case study based on a realistic company situation is analyzed. Solutions obtained by the proposed method are compared with the solution of full scale problem in order to determine the quality bound and computational time.


2018 ◽  
Vol 9 (3/4) ◽  
pp. 407
Author(s):  
Satya Prakash ◽  
Gunjan Soni ◽  
Vipul Jain ◽  
Gaurav Kumar Badhotiya ◽  
Murari Lal Mittal

Sign in / Sign up

Export Citation Format

Share Document