| The research focuses on the use of IBM ILOG CPLEX software to solve a set covering problem. The software utilizes the OPL language and involves defining indices, parameters, data, and decision variables. The model is written to minimize the total distance coverage while maximizing demand points in South Tangerang. Constraints are set to ensure gas stations are assigned as either intra-cluster or inter-cluster. Data is collected using Google Maps and recorded in an Excel sheet. A data file is created to define origin and destination nodes, and distances between nodes are entered as a matrix. The final result shows decision variables for AssignIntra, AssignInter, and Route. The objective function minimizes distance and maximizes demand coverage. The optimal global solution covers the entire South Tangerang City with gas stations, eliminating unnecessary ones. A map and cluster analysis are used to identify excess stations for elimination. The computation time is recorded as 14.18 seconds, and verification and validation processes are conducted. The validated result indicates a total distance of 115.99 km. |