Staff Publications

  • external user (warningwarning)
  • Log in as
  • language uk
Record number 441790
Title A threaded approach of the quadratic bi-blending algorithm
Author(s) Herrera, J.F.; Casado, L.G.; Hendrix, E.M.T.; García, I.
Source Journal of Supercomputing 64 (2013)1. - ISSN 0920-8542 - p. 38 - 48.
DOI https://doi.org/10.1007/s11227-012-0783-9
Department(s) Operations Research and Logistics
WASS
Publication type Refereed Article in a scientific journal
Publication year 2013
Keyword(s) global optimization - bound algorithms - spheres
Abstract 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
Comments
There are no comments yet. You can post the first one!
Post a comment
 
Please log in to use this service. Login as Wageningen University & Research user or guest user in upper right hand corner of this page.