eprintid: 11131 rev_number: 2 eprint_status: archive userid: 1 dir: disk0/00/01/11/31 datestamp: 2023-11-10 03:25:40 lastmod: 2023-11-10 03:25:40 status_changed: 2023-11-10 01:14:32 type: article metadata_visibility: show creators_name: Jamaluddin, F.N. creators_name: Abdul Karim, Z.A. creators_name: Abdul Majid, M.A. creators_name: Sasaki, T. title: Cooling capacity optimization of absorption chillers using binary integer programming ispublished: pub note: cited By 0 abstract: In this paper, the plant runs eight units of chiller with the same design specification every hour. By contract, the plant must supply 13 205 RT per hour for 24 hours a day. However, in this plant case scenario, all units of chillers are not able to run at full capacity due to low in �T of CHW and it affected the CHW production. Typically, a chiller plant that has multi-chillers do not operate all units of chiller at the same time. Therefore, a simple binary integer programming model is created to reduce the number of unit of chiller operated per hour while satisfying the cooling demand by the customer and system operational constraints. The model is solved using Solver tool in Microsoft Excel. The model showed after optimization, the number of unit of chiller operated per hour is possible to reduce one despite low in �T of CHW especially during the day and the total CHW production per hour is reduced to 12.5. © 2019 Penerbit Akademia Baru. date: 2019 publisher: Penerbit Akademia Baru official_url: https://www.scopus.com/inward/record.uri?eid=2-s2.0-85083370424&partnerID=40&md5=9013f17e7b4cce78461b50cd2410caf5 full_text_status: none publication: Journal of Advanced Research in Fluid Mechanics and Thermal Sciences volume: 63 number: 2 pagerange: 287-294 refereed: TRUE issn: 22897879 citation: Jamaluddin, F.N. and Abdul Karim, Z.A. and Abdul Majid, M.A. and Sasaki, T. (2019) Cooling capacity optimization of absorption chillers using binary integer programming. Journal of Advanced Research in Fluid Mechanics and Thermal Sciences, 63 (2). pp. 287-294. ISSN 22897879