The mobile ad-hoc networks (MANET) are infrastructure less and decentralized group of mobile nodes where the routers and mobile hosts are connected over wireless links. In MANET, nodes communicate with each other using multi-hop communication system. The nodes and routers are free to move within the network and it is a difficult task to maintain the network topology as it changes every time. So, efficient algorithms are needed for routing. Due to the suddenly changing of topology every time routing of packets from source to destination using shortest path is difficult. In present work, it is proposed by adding a factor called orientation to Ant Colony Optimization algorithm for routing in MANETs in which destination nodes are selected and exchanges the packets (agents) between the source and the destination. This algorithm helps in finding the shortest path between source and destination. The results are compared with AODV by using throughput as performance metric.