This final project discusses the use of the Set Covering Problem (SCP) model in determining the optimal location and number of fire stations in Pekanbaru City. The SCP model includes Location Set Covering Problem (LSCP) and Maximum Covering Location Problem (MCLP). Problems in this model are solved using the LINGO 18.0 application. Based on the LSCP model with a maximum travel time of 15 minute…