The problem is that when an accident occurs at a railway crossing, emergency response wagons are unable to get to the accident location on time. In this study, we consider the location of emergency response wagons and railway accident location and apply a nature-inspired search strategy as a solution to compute the optimal distance for an emergency response wagon such that when an accident occurs the expected time to reach the accident location can be minimized. The outcome suggests the ideal objective function, haversine method, because it produced the optimal minimal distance of 994, 691.90km with a computational time of 1.05s for KSA over comparative algorithms namely BAT and (Ant Colony Optimization) ACO.