Abstract: Planning, controlling and coordinating search and rescue operations is complex and time is crucial for survivors who must be found quickly. The search planning phase is especially important when the location of the incident is unknown. We propose, implement, solve, and evaluate mathematical models for the multiple rectangular search area problem. The objective is to define optimal or near-optimal feasible search areas for the available search and rescue units that maximize the probability of success. We compare our new model to an existing model on problem instances of realistic size. Our results show that we are able to generate, in a reasonable time, near optimal operationally feasible plans for searches conducted in vast open spaces. In an operational context, this research can increase the chances of finding s urvivors. Ultimately, as our models get implemented in the Canadian Coast Guard search planning tool, this can translate into more lives being saved.