A hybrid approach combining interior-point and branch-and-bound methods applied to the problem of sugar cane waste

This paper proposes a hybrid approach for solving the multi-objective model related to the minimisation of sugar cane waste collection costs and/or the maximisation of produced energy by this waste, with the aid of strategies for solving multi-objective problems, which transform the problem into a set of single-objective problems. This approach combines the predictor-corrector primal-dual interior-point and branch-and-bound methods in order to solve these single-objective problems. The model consists in identifying the sugar cane varieties with the lowest waste collection costs, while simultaneously it aims to obtain the greatest amount of produced energy by this waste. The hybrid methods are implemented in C++ programming language, and tests are performed to determine the efficient solutions in Pareto optimal sense of the multi-objective model and compare the performance of the hybrid method using the integrality test and without considering it. The mathematical results confirm that the proposed hybrid method for solving the aforementioned models presents good computational performance and reliable solutions.

[1]  Tomaz Caetano Cannavam Ripoli,et al.  Biomassa de cana-de-açúcar: colheita, energia e ambiente , 2004 .

[2]  R. E. Marsten,et al.  A direct nonlinear predictor-corrector primal-dual interior point algorithm for optimal power flows , 1993 .

[3]  Shu-Cherng Fang,et al.  Linear Optimization and Extensions: Theory and Algorithms , 1993 .

[4]  Stephen J. Wright Primal-Dual Interior-Point Methods , 1997, Other Titles in Applied Mathematics.

[5]  Gilmar Tolentino UNIVERSIDADE ESTADUAL PAULISTA "JÚLIO DE MESQUITA FILHO" FACULDADE DE CIÊNCIAS AGRONÔMICAS CAMPUS DE BOTUCATU PROGRAMAÇÃO LINEAR INTEIRA APLICADA AO APROVEITAMENTO DO PALHIÇO DA CANA-DE-AÇÚCAR , 2007 .

[6]  T. P. D. Homem,et al.  Optimal energy generation with biomass of sugarcane harvest , 2010, 2010 IEEE/PES Transmission and Distribution Conference and Exposition: Latin America (T&D-LA).

[7]  Adriano Dawison de Lima Otimização do aproveitamento do palhiço da cana-de-açucar , 2009 .

[8]  Reinaldo Morabito,et al.  An optimization model for the aggregate production planning of a Brazilian sugar and ethanol milling company , 2009, Ann. Oper. Res..

[9]  Brian Borchers,et al.  Using an interior point method in a branch and bound algorithm for integer programming July , 2007 .

[10]  Ailsa H. Land,et al.  An Automatic Method of Solving Discrete Programming Problems , 1960 .

[11]  Jacek Gondzio,et al.  Using the primal-dual interior point algorithm within the branch-price-and-cut method , 2013, Comput. Oper. Res..

[12]  A. J. Higgins Optimizing cane supply decisions within a sugar mill region , 1999 .

[13]  Mauricio G. C. Resende,et al.  A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension , 1990, Math. Oper. Res..

[14]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, Comb..

[15]  Sanjay Mehrotra,et al.  On the Implementation of a Primal-Dual Interior Point Method , 1992, SIAM J. Optim..

[16]  Marcilio Egidio Grisotto,et al.  Otimização do transporte de cana-de-açucar por caminhões , 1995 .

[17]  Lluís M. Plà-Aragonés,et al.  Sugar cane transportation in Cuba, a case study , 2006, Eur. J. Oper. Res..

[18]  Barrett W. Thomas,et al.  Sugarcane Harvest Logistics in Brazil , 2017, Transp. Sci..

[19]  Sanjay Mehrotra,et al.  An Algorithm for Convex Quadratic Programming That Requires O(n3.5L) Arithmetic Operations , 1990, Math. Oper. Res..

[20]  R. K. Ursem Multi-objective Optimization using Evolutionary Algorithms , 2009 .

[21]  José Arnaldo Barra Montevechi,et al.  Multi-choice mixed integer goal programming optimization for real problems in a sugar and ethanol milling company , 2013 .

[22]  Roy E. Marsten,et al.  On Implementing Mehrotra's Predictor-Corrector Interior-Point Method for Linear Programming , 1992, SIAM J. Optim..

[23]  Marcus Poggi de Aragão,et al.  Harvest planning in the Brazilian sugar cane industry via mixed integer programming , 2013, Eur. J. Oper. Res..

[24]  Margarida Vaz Pato,et al.  A bi-objective genetic approach for the selection of sugarcane varieties to comply with environmental and economic requirements , 2014, J. Oper. Res. Soc..

[25]  N. Megiddo Progress in Mathematical Programming: Interior-Point and Related Methods , 2011 .

[26]  Sanjay Mehrotra,et al.  An interior point algorithm for convex quadratic programming that requires O(n3.5) arithmetic operations , 1990 .

[27]  Kaisa Miettinen,et al.  Nonlinear multiobjective optimization , 1998, International series in operations research and management science.

[28]  Helenice de Oliveira Florentino,et al.  Multiobjective 0-1 integer programming for the use of sugarcane residual biomass in energy cogeneration , 2011, Int. Trans. Oper. Res..

[29]  R. Soland,et al.  An interactive branch-and-bound algorithm for multiple criteria optimization , 1986 .

[30]  Antonio Roberto Balbo,et al.  Predictor-Corrector Primal-Dual Interior Point Method for Solving Economic Dispatch Problems: A Postoptimization Analysis , 2012 .

[31]  A. J. Higgins,et al.  Improving harvesting and transport planning within a sugar value chain , 2006, J. Oper. Res. Soc..

[32]  M. L. C. Ripoli Mapeamento do palhiço enfardado de cana-de-açúcar (Saccharum spp.) e do seu potencial energético. , 2002 .

[33]  Maria Márcia Pereira Sartori,et al.  Determination of the optimal quantity of crop residues for energy in sugarcane crop management using linear programming in variety selection and planting strategy , 2001 .