A mixed-integer nonlinear programming model for production of electricity from biomass

Document Type : Review Article

Authors

1 Faculty of Engineering and Technology, Imam Khomeini International University, Qazvin, Iran *P.O.B. 288 Qazvin, Iran.

2 Faculty of Engineering and Technology, Imam Khomeini International University, Qazvin, Iran.

Abstract

The provision of energy is one of the most important issues at present. At the same time the environmental impacts need to be considered. The renewable energy, biomass energy in particular, could be a solution. The aim of this paper is to develop a mathematical programming model for solving problems arising from planning a biomasses energy production via burning the biomass. The models take into account different aspects of the problem: determination of the biomasses to produce and/or buy, transportation decisions to convey the materials to the respective plants, and plant design. First, a non-linear model was used, which was converted to a linear programming model. The application of this model for determining the locations of the plants, which are based on the geographical positions of the raw material providers. This model helps for developing more economically viable renewable projects.

Keywords

References

[1]      H.I. Inyang, Bridging the gaps for global sustainable development, International Conference on Energy, Environment and Disasters, Charlotte, NC, July 2005.
[2]      Regional Wood Energy Development Programme, Proceedings of the regional expert consultation on modern applications of biomass energy, Food and Agricultural Organization of the UN, Bangkok, January 1998.
[3]      D.M. Adams, R.J. Alig, J.T. Chmelik, B.A. McCarl, Analysis of Biomass Fueled Electrical Powerplants: Implications in the Agricultural and Forestry Sectors, Annals of Operations Research, 1998.
[4]      D.M. Adams, R.J. Alig, J.T. Chmelik, B.A. McCarl, Competitiveness of biomassfueled  electrical power plants,  Annals of Operations Research, 94: 37-55, 2000.
[5]      R. Aringhieri, M. Bruglieri, F. Malucelli, and M. Nonato. An asymmetric vehicle routing problem arising in the collection and disposal of special waste, CTW04 Workshop on Graphs and Combinatorial Optimization, volume 17 of Electronic Notes in Discrete Mathematics, pages 41–46, Elsevier. Amsterdam, 2004.
[6]      D. Freppaz, R. Minciardi, M. Robba, M. Rovatti, R. Sacile, A. Taramasso Optimizing forest biomass exploitation for energy supply at a regional level,  Biomass and Bionergy, 26:15–25, 2004.
[7]      D. Voivontas, D. Assimacopoulos, E.G. Koukios,  Assessment of biomass potential for power production: a GIS based method, Biomass and Bionergy, 20:101–112, 2001.
[8]       M. Berkelaar,  LP SOLVE: Linear Programming Code. http://www.cs.sunysb.edu/ algorith/implement/lpsolve/implement.shtml, 2004.
[9]      S. Kucherenko and Yu. Sytsko, Application of deterministic lowdiscrepancy sequences to nonlinear global optimization problems, Computational Optimization and Applications, 30(3):297–318, 2004.
[10]   L. Liberti and S. Kucherenko. Comparison of deterministic and stochastic approaches to global optimization, International Transactions in Operations Research, 12:263–285, 2005.
[11]   P. Hansen and N. Mladenovi´c, Variable neighbourhood search: Principles and applications. European Journal of Operations Research, 130:449–467, 2001.
[12]   L. Liberti and M. Draˇzic. Variable neighbourhood search for the global optimization of constrained nlps. Proceedings of GO Workshop, Almeria, Spain, 2005.
[13]   E.M.B. Smith and C.C. Pantelides. A symbolic reformulation/spatial branch-and-bound algorithm for the global optimization of nonconvex minlps. Computers & Chemical Engineering, 23:457–478, 1999.
[14]   C.S. Adjiman, S. Dallwig, C.A. Floudas, and A. Neumaier. A global optimization method, αbb, for general twice-differentiable constrained nlps: I. theoretical advances. Computers & Chemical Engineering, 22(9):1137–1158, 1998.
[15]   G.P. McCormick. Computability of global solutions to factorable nonconvex programs: Part i — convex underestimating problems. Mathematical Programming, 10:146–175, 1976.
[16]   H.D. Sherali and W.P. Adams. A tight linearization and an algorithm for 0-1 quadratic programming problems. Management Science, 32(10):1274–1290, 1986.
[17]   H.D. Sherali and A. Alameddine. A new reformulation-linearization technique for bilinear programming problems. Journal of Global Optimization, 2:379–410, 1992.
[18]   H.D. Sherali and W.P. Adams. A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems. Kluwer Academic Publishers, Dodrecht, 1999.
[19]   L. Liberti. Linearity embedded in nonconvex programs. Journal of Global Optimization, 2004.
 
Journal of Renewable and New Energy
Volume 2, Issue 1
March 2015
Pages 23-27

Files

History

  • Receive Date: 06 August 2017
  • Accept Date: 06 August 2017

Share

How to cite

Statistics