A threaded approach of the quadratic bi-blending algorithm

Blending algorithms aim for solving the problem of determining the mixture of raw materials in order to obtain a cheap and feasible recipe with the smallest number of raw materials. An algorithm that solves this problem for two products, where available raw material is limited, has two phases. The first phase is a simplicial branch-and-bound algorithm which determines, for a given precision, a Pareto set of solutions of the bi-blending problem as well as a subspace of the initial space where better feasible solutions (with more precision) can be found. The second phase basically consists in an exhaustive reduction of the mentioned subspace by deleting simplicial subsets that do not contain solutions. This second phase is useful for future refinement of the solutions. Previous work only focused on the first phase neglecting the second phase due to computational burden. With this in mind, we study the parallelization of the different phases of the sequential bi-blending algorithm and focus on the most time consuming phase, analyzing the performance of several strategies.

[1]  Jalal Ashayeri,et al.  Blending modelling in a process manufacturing: A case study , 1994 .

[2]  Inmaculada García,et al.  Branch-and-Bound interval global optimization on shared memory multiprocessors , 2008, Optim. Methods Softw..

[3]  J. Will M. Bertrand,et al.  Evaluation of three production planning procedures for the use of recipe flexibility , 1999, Eur. J. Oper. Res..

[4]  José A. Martínez,et al.  Interval Parallel Global Optimization with Charm++ , 2004, PARA.

[5]  Yuefan Deng,et al.  Applied Parallel Computing , 2012 .

[6]  L. G. Mitten.  Branch-and-Bound Methods: General Formulation and Properties , 1970, Oper. Res..

[7]  Inmaculada García,et al.  Infeasibility spheres for finding robust solutions of blending problems with quadratic constraints , 2007, J. Glob. Optim..

[8]  Eligius M.T. Hendrix,et al.  The semi-continuous quadratic mixture design problem: Description and branch-and-bound approach , 2008, Eur. J. Oper. Res..

[9]  Inmaculada García,et al.  Solving the mixture design problem on a shared memory parallel machine , 2007 .

[10]  Bartlomiej Jacek Kubica.  A class of problems that can be solved using interval algorithms , 2011, Computing.

[11]  Leocadio G. Casado,et al.  Adaptive Parallel Interval Global Optimization Algorithms Based on their Performance for Non-dedicated Multicore Architectures , 2011, 2011 19th International Euromicro Conference on Parallel, Distributed and Network-Based Processing.

[12]  Toshihide Ibaraki,et al.  Theoretical comparisons of search strategies in branch-and-bound algorithms , 1976, International Journal of Computer & Information Sciences.

[13]  Inmaculada García,et al.  Adaptive parallel interval branch and bound algorithms based on their performance for multicore architectures , 2011, The Journal of Supercomputing.

[14]  R. W. Hamming.  State of the art in scientific computing , 1963, AFIPS '63 (Spring).

[15]  Boglárka G.-Tóth,et al.  On determining the cover of a simplex by spheres centered at its vertices , 2011, J. Glob. Optim..

[16]  Richard C. Larson,et al.  Model Building in Mathematical Programming , 1979 .

[17]  Inmaculada García,et al.  On estimating workload in interval branch-and-bound global optimization algorithms , 2013, J. Glob. Optim..