Availability of positioning instruments makes it possible to use position of nodes in routing algorithms for ad hoc mobile networks. Usual position-based routing algorithms fail to find a route from a source to a destination in some cases, or they find routes that are much longer than the shortest path. Routing algorithms based on ant colony optimization find routing paths that are close to the shortest paths in very general situations. The drawback of these algorithms is the large number of control messages needed to establish the routes. We propose routing algorithms for mobile ad hoc networks which combine the idea of ant colony optimization with the use of the position of nodes. Our results show that this gives scalable routing algorithms.