Ride-sharing in warehousing can be implemented in picking up and delivering one or more items from one location to another location using an autonomous vehicle. The advantages of ride-sharing, especially in warehouses, are reducing the number of vehicles in use and lowering operational costs. One of the main problems in ride-sharing is determining the best route from the start to the end. Based on related research, some algorithms are usually used to determine the best route, like A* and Dijkstra. Previous research showed that A* has a better performance rather than Dijkstra. Previous research about the IDA* algorithm showed that this algorithm is efficient and uses memory use. Therefore, this research compares the performance between the A* and IDA* algorithms to determine the best route for ride-sharing autonomous vehicles in a warehouse environment. This research uses a two-dimensional matrix simulation approach to compare the two algorithms. In this simulation, it is evident that A* exhibits superior overall processing efficiency, whereas IDA* demonstrates a marginal advantage regarding memory utilization.