Location problem is typical in operations research, which has wide applications in real life. Based on the recently developed ant colony optimization strategy, a new algorithm for solving planar location problem with regional constraints is proposed in the paper. By modifying the transition probability and some relevant parameters, the algorithm extends the ant-based ideas used in combinatorial optimization to continuous function optimization. Numerical examples are tested and compared which give effective and encouraging results.