In this correspondence we reconsider three geometrical problems for which we develop divide-and-conquer algorithms. The first problem is to find all pairwise intersections among a set of horizontal ...

With multi-objective becoming more and more important, ant colony algorithm has become an ideal tool to solve multi-objective optimization problems because of its unique positive feedback and ...