PSO-based and SA-based metaheuristics for bilinear programming problems: an application to the pooling problem

Gökalp Erbeyoğlu () and Ümit Bilge ()
Additional contact information
Gökalp Erbeyoğlu: Boğaziçi University
Ümit Bilge: Boğaziçi University

Journal of Heuristics, 2016, vol. 22, issue 2, No 2, 147-179

Abstract: Abstract Bilinear programming problems (BLP) are subsets of nonconvex quadratic programs and can be classified as strongly NP-Hard. The exact methods to solve the BLPs are inefficient for large instances and only a few heuristic methods exist. In this study, we propose two metaheuristic methods, one is based on particle swarm optimization (PSO) and the other is based on simulated annealing (SA). Both of the proposed approaches take advantage of the bilinear structure of the problem. For the PSO-based method, a search variable, which is selected among the variable sets causing bilinearity, is subjected to particle swarm optimization. The SA-based procedure incorporates a variable neighborhood scheme. The pooling problem, which has several application areas in chemical industry and formulated as a BLP, is selected as a test bed to analyze the performances. Extensive experiments are conducted and they indicate the success of the proposed solution methods.

Keywords: Bilinear programming; Metaheuristics; Pooling problem; Particle swarm optimization; Simulated annealing (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10732-015-9304-3 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:joheur:v:22:y:2016:i:2:d:10.1007_s10732-015-9304-3

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10732

DOI: 10.1007/s10732-015-9304-3

Access Statistics for this article

Journal of Heuristics is currently edited by Manuel Laguna

More articles in Journal of Heuristics from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().