It is interesting to study the linear search and evacuation problems on robots with variable maximum speed in order to compare the results based on that speed. What makes the problem more interesting is to include a passive entity, such as a bike, that can be used by any of the robots. This will make the problem more generalized and thus it may encompass many previously done studies on linear search and evacuation, as we will demonstrate later. We will revisit the linear search and evacuation problems; however, this time we will use two robots with a bike under the condition that only one robot can use the bike at a time. The exit would be placed at an unknown position on the line. The problem will be divided into two categories: linear search and evacuation. Evacuation in turn will be studied for two communication models: wi-fi and face-to-face.