Open AccessStrategic planning of biodiesel supply chain
Author(s) -
Rafael Guillermo García Cáceres
Publication year - 2017
Publication title -
ingenieria y universidad/ingenieria y universidad
Language(s) - English
Resource type - Journals
eISSN - 0123-2126
pISSN - 2011-2769
DOI - 10.11144/javeriana.iyu22-1.spbs
Subject(s) - heuristics , supply chain , decomposition , constraint (computer aided design) , mathematical optimization , computer science , biodiesel , biodiesel production , benchmark (surveying) , operations research , supply chain network , supply chain management , dual (grammatical number) , scale (ratio) , engineering , mathematics , business , ecology , chemistry , biology , biochemistry , geodesy , marketing , quantum mechanics , catalysis , mechanical engineering , physics , geography , art , literature
A stochastic biobjective MIP model for designing the network of biodiesel supply chains is presented. Ultimately intending to support the strategic decisions of stakeholders. The constraints included are: economies of scale, location of facilities, production capacity, raw material supply, product demand, bill of materials and mass balance.Objectives:The model aims to minimize, both, the total cost and environmental impact of five chain echelonsMetodology:The solution procedure resorts to chance constraint and the ε-constraint method to solve the biobjective model.Results:Computational experiments allowed assessing the performance of the solution procedure. The CPU times for the solution of the instances of the problem show very good values.Conclutions:By approaching the modeling of the biodiesel supply chain the current contribution can serve as the basis of future similar works and associated solution procedures, thus facilitating decision-making at different supply chain stages. The current approach can be improved through its modeling and/or through the development of solution procedures that allow its practical use in larger instances of the model. This can be overcome through permanent research lines that include the development of adequate acceleration methods, valid constraints, Benders decomposition, branch and cut, Lagrangian decomposition, Danzing-Wolf decomposition, or heuristics and meta-heuristics.