{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:35:13Z","timestamp":1759667713805},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,11,28]],"date-time":"2015-11-28T00:00:00Z","timestamp":1448668800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2016,4]]},"DOI":"10.1007\/s10732-015-9304-3","type":"journal-article","created":{"date-parts":[[2015,11,28]],"date-time":"2015-11-28T16:56:37Z","timestamp":1448729797000},"page":"147-179","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["PSO-based and SA-based metaheuristics for bilinear programming problems: an application to the pooling problem"],"prefix":"10.1007","volume":"22","author":[{"given":"G\u00f6kalp","family":"Erbeyo\u011flu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u00dcmit","family":"Bilge","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,28]]},"reference":[{"key":"9304_CR1","doi-asserted-by":"crossref","unstructured":"Aarts, E., Korst, J., Michiels, W.: Simulated annealing. In: Search Methodologies, pp. 187\u2013210. Springer (2005)","DOI":"10.1007\/0-387-28356-0_7"},{"issue":"5","key":"9304_CR2","doi-asserted-by":"crossref","first-page":"1956","DOI":"10.1021\/ie980666q","volume":"38","author":"N Adhya","year":"1999","unstructured":"Adhya, N., Tawarmalani, M., Sahinidis, N.V.: A lagrangian approach to the pooling problem. Ind. Eng. Chem. Res. 38(5), 1956\u20131972 (1999)","journal-title":"Ind. Eng. Chem. Res."},{"issue":"2","key":"9304_CR3","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1016\/0377-2217(86)90043-3","volume":"24","author":"FA Al-Khayyal","year":"1986","unstructured":"Al-Khayyal, F.A.: Linear, quadratic, and bilinear programming approaches to the linear complementarity problem. Eur. J. Oper. Res. 24(2), 216\u2013227 (1986)","journal-title":"Eur. J. Oper. Res."},{"issue":"11","key":"9304_CR4","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0898-1221(90)90148-D","volume":"19","author":"FA Al-Khayyal","year":"1990","unstructured":"Al-Khayyal, F.A.: Jointly constrained bilinear programs and related problems: An overview. Comput. Math. Appl. 19(11), 53\u201362 (1990)","journal-title":"Comput. Math. Appl."},{"issue":"3","key":"9304_CR5","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1016\/0377-2217(92)90082-K","volume":"60","author":"FA Al-Khayyal","year":"1992","unstructured":"Al-Khayyal, F.A.: Generalized bilinear programming: Part i. models, applications and linear programming relaxation. Eur. J. Oper. Res. 60(3), 306\u2013314 (1992)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"9304_CR6","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/PL00011428","volume":"90","author":"S Alarie","year":"2001","unstructured":"Alarie, S., Audet, C., Jaumard, B., Savard, G.: Concavity cuts for disjoint bilinear programming. Math. Program. 90(2), 373\u2013398 (2001)","journal-title":"Math. Program."},{"key":"9304_CR7","unstructured":"Alfaki, M.: Models and solution methods for the pooling problem. Ph.D. thesis, The University of Bergen (2012)"},{"key":"9304_CR8","doi-asserted-by":"crossref","unstructured":"Alfaki, M., Haugland, D.: A cost minimization heuristic for the pooling problem. Ann. Oper. Res., 1\u201315 (2013a)","DOI":"10.1007\/s10479-013-1433-1"},{"issue":"3","key":"9304_CR9","doi-asserted-by":"crossref","first-page":"897","DOI":"10.1007\/s10898-012-9875-6","volume":"56","author":"M Alfaki","year":"2013","unstructured":"Alfaki, M., Haugland, D.: Strong formulations for the pooling problem. J. Glob. Optim. 56(3), 897\u2013916 (2013b)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"9304_CR10","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/S0305-0548(00)00064-2","volume":"29","author":"MM Ali","year":"2002","unstructured":"Ali, M.M., T\u00f6rn, A., Viitanen, S.: A direct search variant of the simulated annealing algorithm for optimization involving continuous variables. Comput. Oper. Res. 29(1), 87\u2013102 (2002)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"9304_CR11","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/s10898-008-9371-1","volume":"45","author":"H Almutairi","year":"2009","unstructured":"Almutairi, H., Elhedhli, S.: A new lagrangean approach to the pooling problem. J. Glob. Optim. 45(2), 237\u2013257 (2009)","journal-title":"J. Glob. Optim."},{"issue":"3","key":"9304_CR12","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1007\/s101070050072","volume":"85","author":"C Audet","year":"1999","unstructured":"Audet, C., Hansen, P., Jaumard, B., Savard, G.: A symmetrical linear maxmin approach to disjoint bilinear programming. Math. Program. 85(3), 573\u2013592 (1999)","journal-title":"Math. Program."},{"issue":"6","key":"9304_CR13","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1287\/mnsc.1030.0207","volume":"50","author":"C Audet","year":"2004","unstructured":"Audet, C., Brimberg, J., Hansen, P., Digabel, S.L., Mladenovi\u0107, N.: Pooling problem: Alternate formulations and solution methods. Manag. Sci. 50(6), 761\u2013776 (2004)","journal-title":"Manag. Sci."},{"key":"9304_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-0251-3_2","volume-title":"Exact solution of three nonconvex quadratic programming problems","author":"C Audet","year":"2004","unstructured":"Audet, C., Hansen, P., Le Digabel, S.: Exact solution of three nonconvex quadratic programming problems. Springer, New York (2004)"},{"issue":"1\u20133","key":"9304_CR15","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF01582066","volume":"63","author":"A Ben-Tal","year":"1994","unstructured":"Ben-Tal, A., Eiger, G., Gershovitz, V.: Global minimization by reducing the duality gap. Math. Program. 63(1\u20133), 193\u2013212 (1994)","journal-title":"Math. Program."},{"issue":"3","key":"9304_CR16","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1080\/00401706.1986.10488128","volume":"28","author":"IO Bohachevsky","year":"1986","unstructured":"Bohachevsky, I.O., Johnson, M.E., Stein, M.L.: Generalized simulated annealing for function optimization. Technometrics 28(3), 209\u2013217 (1986)","journal-title":"Technometrics"},{"key":"9304_CR17","doi-asserted-by":"crossref","unstructured":"Byrd, R.H., Nocedal, J., Waltz, R.A.: Knitro: an integrated package for nonlinear optimization. In: Large-Scale Nonlinear Optimization, pp. 35\u201339. Springer (2006)","DOI":"10.1007\/0-387-30065-1_4"},{"issue":"1","key":"9304_CR18","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF00940812","volume":"45","author":"V \u010cern\u1ef3","year":"1985","unstructured":"\u010cern\u1ef3, V.: Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm. J. Optim. Theory Appl. 45(1), 41\u201351 (1985)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"9304_CR19","doi-asserted-by":"crossref","first-page":"859","DOI":"10.1016\/j.cor.2004.08.012","volume":"33","author":"A Chatterjee","year":"2006","unstructured":"Chatterjee, A., Siarry, P.: Nonlinear inertia weight variation for dynamic adaptation in particle swarm optimization. Comput. Oper. Res. 33(3), 859\u2013871 (2006)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"9304_CR20","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1145\/29380.29864","volume":"13","author":"A Corana","year":"1987","unstructured":"Corana, A., Marchesi, M., Martini, C., Ridella, S.: Minimizing multimodal functions of continuous variables with the \u201csimulated annealing\u201d algorithm. ACM Trans. Math. Softw. 13(3), 262\u2013280 (1987)","journal-title":"ACM Trans. Math. Softw."},{"issue":"1\u20133","key":"9304_CR21","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/BF01594945","volume":"50","author":"A Dekkers","year":"1991","unstructured":"Dekkers, A., Aarts, E.: Global optimization and simulated annealing. Math. Program. 50(1\u20133), 367\u2013393 (1991)","journal-title":"Math. Program."},{"key":"9304_CR22","doi-asserted-by":"crossref","unstructured":"Eberhart, R.C., Kennedy, J.: A new optimizer using particle swarm theory. In: Proceedings of the Sixth International Symposium on Micro Machine and Human Science, vol. 1, pp. 39\u201343. New York (1995)","DOI":"10.1109\/MHS.1995.494215"},{"key":"9304_CR23","doi-asserted-by":"crossref","unstructured":"Eberhart, R.C., Shi, Y.: Comparison between genetic algorithms and particle swarm optimization. In: Evolutionary Programming VII, pp. 611\u2013616. Springer (1998)","DOI":"10.1007\/BFb0040812"},{"key":"9304_CR24","unstructured":"Erbeyo\u011flu, G.: Metaheuristic approaches to the pooling problem. Master\u2019s thesis, Bo\u011fazi\u00e7i University (2013)"},{"issue":"4","key":"9304_CR25","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1287\/opre.11.4.637","volume":"11","author":"DH Evans","year":"1963","unstructured":"Evans, D.H.: Modular design\u2014a special case in nonlinear programming. Oper. Res. 11(4), 637\u2013647 (1963)","journal-title":"Oper. Res."},{"issue":"3","key":"9304_CR26","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1287\/ijoc.2.3.225","volume":"2","author":"CA Floudas","year":"1990","unstructured":"Floudas, C.A., Aggarwal, A.: A decomposition strategy for global optimum search in the pooling problem. ORSA J. Comput. 2(3), 225\u2013235 (1990)","journal-title":"ORSA J. Comput."},{"issue":"1\u20132","key":"9304_CR27","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1080\/02331939208843786","volume":"24","author":"LR Foulds","year":"1992","unstructured":"Foulds, L.R., Haugland, D., J\u00f6rnsten, K.: A bilinear approach to the pooling problem. Optimization 24(1\u20132), 165\u2013180 (1992)","journal-title":"Optimization"},{"key":"9304_CR28","unstructured":"Frimannslund, L., El Ghami, M., Alfaki, M., Haugland, D.: Solving the pooling problem with lmi relaxations. Models and Solution Methods for the Pooling Problem (2012)"},{"issue":"12","key":"9304_CR29","doi-asserted-by":"crossref","first-page":"5742","DOI":"10.1021\/ie8016048","volume":"48","author":"CE Gounaris","year":"2009","unstructured":"Gounaris, C.E., Misener, R., Floudas, C.A.: Computational comparison of piecewise-linear relaxations for pooling problems. Ind. Eng. Chem. Res. 48(12), 5742\u20135766 (2009)","journal-title":"Ind. Eng. Chem. Res."},{"issue":"2","key":"9304_CR30","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1287\/ijoc.7.2.205","volume":"7","author":"HJ Greenberg","year":"1995","unstructured":"Greenberg, H.J.: Analyzing the pooling problem. ORSA J. Comput. 7(2), 205\u2013217 (1995)","journal-title":"ORSA J. Comput."},{"key":"9304_CR31","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1145\/1111237.1111238","volume":"25","author":"CA Haverly","year":"1978","unstructured":"Haverly, C.A.: Studies of the behavior of recursion for the pooling problem. ACM SIGMAP Bull. 25, 19\u201328 (1978)","journal-title":"ACM SIGMAP Bull."},{"key":"9304_CR32","doi-asserted-by":"crossref","unstructured":"Henderson, D., Jacobson, S.H., Johnson, A.W.: The theory and practice of simulated annealing. In: Handbook of Metaheuristics, pp. 287\u2013319. Springer (2003)","DOI":"10.1007\/0-306-48056-5_10"},{"key":"9304_CR33","volume-title":"Nonparametric Statistical Methods","author":"M Hollander","year":"1999","unstructured":"Hollander, M., Wolfe, D.A.: Nonparametric Statistical Methods, 2nd edn. Wiley, New York (1999)","edition":"2"},{"key":"9304_CR34","doi-asserted-by":"crossref","unstructured":"Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of 1995 IEEE International Conference on Neural Networks, pp.1942\u20131948 (1995)","DOI":"10.1109\/ICNN.1995.488968"},{"issue":"4598","key":"9304_CR35","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671\u2013680 (1983)","journal-title":"Science"},{"key":"9304_CR36","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1145\/1111246.1111247","volume":"27","author":"L Lasdon","year":"1979","unstructured":"Lasdon, L., Waren, A., Sarkar, S., Palacios, F.: Solving the pooling problem using generalized reduced gradient and successive linear programming algorithms. ACM Sigmap Bulletin 27, 9\u201315 (1979)","journal-title":"ACM Sigmap Bulletin"},{"issue":"2","key":"9304_CR37","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/s10898-006-9005-4","volume":"36","author":"L Liberti","year":"2006","unstructured":"Liberti, L., Pantelides, C.C.: An exact reformulation algorithm for large nonconvex nlps involving bilinear terms. J. Glob. Optim. 36(2), 161\u2013189 (2006)","journal-title":"J. Glob. Optim."},{"issue":"11","key":"9304_CR38","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24(11), 1097\u20131100 (1997)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"9304_CR39","first-page":"3","volume":"8","author":"R Misener","year":"2009","unstructured":"Misener, R., Floudas, C.A.: Advances for the pooling problem: modeling, global optimization, and computational studies. Appl. Comput. Math. 8(1), 3\u201322 (2009)","journal-title":"Appl. Comput. Math."},{"issue":"1","key":"9304_CR40","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s11721-007-0002-0","volume":"1","author":"R Poli","year":"2007","unstructured":"Poli, R., Kennedy, J., Blackwell, T.: Particle swarm optimization. Swarm Intell. 1(1), 33\u201357 (2007)","journal-title":"Swarm Intell."},{"key":"9304_CR41","series-title":"Advanced Topics in Computer Science Series","volume-title":"Modern Heuristic Techniques for Combinatorial Problems","author":"C Reeves","year":"1993","unstructured":"Reeves, C.: Modern Heuristic Techniques for Combinatorial Problems. Advanced Topics in Computer Science Series. Halsted Press, Ultimo (1993)"},{"issue":"2","key":"9304_CR42","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/BF01100688","volume":"5","author":"HE Romeijn","year":"1994","unstructured":"Romeijn, H.E., Smith, R.L.: Simulated annealing for constrained global optimization. J. Glob. Optim. 5(2), 101\u2013126 (1994)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"9304_CR43","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/s10898-003-6454-x","volume":"31","author":"JF Schutte","year":"2005","unstructured":"Schutte, J.F., Groenwold, A.A.: A study of global optimization using particle swarms. J. Glob. Optim. 31(1), 93\u2013108 (2005)","journal-title":"J. Glob. Optim."},{"issue":"4","key":"9304_CR44","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/BF00122429","volume":"2","author":"HD Sherali","year":"1992","unstructured":"Sherali, H.D., Alameddine, A.: A new reformulation-linearization technique for bilinear programming problems. J. Glob. Optim. 2(4), 379\u2013410 (1992)","journal-title":"J. Glob. Optim."},{"key":"9304_CR45","doi-asserted-by":"crossref","unstructured":"Shi, Y., Eberhart, R.C.: A modified particle swarm optimizer. In: The 1998 IEEE International Conference on Evolutionary Computation Proceedings, 1998. IEEE World Congress on Computational Intelligence, pp. 69\u201373. IEEE (1998)","DOI":"10.1109\/ICEC.1998.699146"},{"issue":"1","key":"9304_CR46","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1007\/s10479-013-1485-2","volume":"211","author":"Y Su","year":"2013","unstructured":"Su, Y., Geunes, J.: Multi-period price promotions in a single-supplier, multi-retailer supply chain under asymmetric demand information. Ann. Oper. Res. 211(1), 447\u2013472 (2013)","journal-title":"Ann. Oper. Res."},{"key":"9304_CR47","doi-asserted-by":"crossref","unstructured":"Tawarmalani, M., Sahinidis, N.V.: Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming: Theory, Algorithms, Software, and Applications, vol. 65. Springer (2002)","DOI":"10.1007\/978-1-4757-3532-1"},{"issue":"2","key":"9304_CR48","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/s10107-005-0581-8","volume":"103","author":"M Tawarmalani","year":"2005","unstructured":"Tawarmalani, M., Sahinidis, N.V.: A polyhedral branch-and-cut approach to global optimization. Math. Program. 103(2), 225\u2013249 (2005)","journal-title":"Math. Program."},{"issue":"12","key":"9304_CR49","doi-asserted-by":"crossref","first-page":"1419","DOI":"10.1016\/0098-1354(90)80021-3","volume":"14","author":"V Visweswaran","year":"1990","unstructured":"Visweswaran, V., Floudast, C.: A global optimization algorithm (gop) for certain classes of nonconvex nlps - ii. application of theory and test problems. Comput. Chem. Eng. 14(12), 1419\u20131434 (1990)","journal-title":"Comput. Chem. Eng."},{"issue":"1","key":"9304_CR50","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/s10107-004-0559-y","volume":"106","author":"A W\u00e4chter","year":"2006","unstructured":"W\u00e4chter, A., Biegler, L.T.: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming. Math. Program. 106(1), 25\u201357 (2006)","journal-title":"Math. Program."},{"issue":"4","key":"9304_CR51","doi-asserted-by":"crossref","first-page":"991","DOI":"10.1002\/aic.11425","volume":"54","author":"DS Wicaksono","year":"2008","unstructured":"Wicaksono, D.S., Karimi, I.: Piecewise milp under and overestimators for global optimization of bilinear programs. AIChE J. 54(4), 991\u20131008 (2008)","journal-title":"AIChE J."},{"key":"9304_CR52","doi-asserted-by":"crossref","unstructured":"Zomaya, A.Y., Kazman, R.: Simulated annealing techniques. In: Algorithms and Theory of Computation Handbook, pp. 33\u201333. Chapman & Hall\/CRC, Boca Raton (2010)","DOI":"10.1201\/9781584888239-c33"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-015-9304-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-015-9304-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-015-9304-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,27]],"date-time":"2022-05-27T16:13:26Z","timestamp":1653668006000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-015-9304-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11,28]]},"references-count":52,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,4]]}},"alternative-id":["9304"],"URL":"https:\/\/doi.org\/10.1007\/s10732-015-9304-3","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"type":"print","value":"1381-1231"},{"type":"electronic","value":"1572-9397"}],"subject":[],"published":{"date-parts":[[2015,11,28]]}}}