Please use this identifier to cite or link to this item:
Title: Pooling problem: Alternate formulations and solution methods
Authors: Audet, C
Brimberg, J
Hansen, P
Le Digabel, S
Mladenović, N
Keywords: Pooling problem;Bilinear programming;Branch-and-cut;Heuristics;Variable neighborhood search
Issue Date: 2004
Publisher: INFORMS
Citation: Management Science, 50(6): 761 - 776, Jun 2004
Abstract: The pooling problem, which is fundamental to the petroleum industry, describes a situation in which products possessing different attribute qualities are mixed in a series of pools in such a way that the attribute qualities of the blended products of the end pools must satisfy given requirements. It is well known that the pooling problem can be modeled through bilinear and nonconvex quadratic programming. In this paper, we investigate how best to apply a new branch-and-cut quadratic programming algorithm to solve the pooling problem. To this effect, we consider two standard models: One is based primarily on flow variables, and the other relies on the proportion. of flows entering pools. A hybrid of these two models is proposed for general pooling problems. Comparison of the computational properties of flow and proportion models is made on several problem instances taken from the literature. Moreover, a simple alternating procedure and a variable neighborhood search heuristic are developed to solve large instances and compared with the well-known method of successive linear programming. Solution of difficult test problems from the literature is substantially accelerated, and larger ones are solved exactly or approximately.
Description: Copyright @ 2004 INFORMS
ISSN: 0025-1909
Appears in Collections:Publications
Computer Science
Dept of Mathematics Research Papers
Mathematical Sciences

Files in This Item:
File Description SizeFormat 
Fulltext.pdf186.86 kBAdobe PDFView/Open

Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.