Binary/partially binary choice rules for competitive location problems are studied. Two new heuristic algorithms based on ranking of potential locations are proposed. Algorithms’ performance has been checked using optimal solutions given by Xpress. The quality of the solution obtained with RDOA-D is around 0.98 for all cases.