Random search, in this chapter of this book, refers to the ability of a search process to either (1) modify randomly one feasible solution with the hope of improving the quality of the solution, or (2) construct a single feasible solution using random selections of management activities. Random search is efficient, perhaps one of the most computationally fast methods for developing feasible solutions to complex problems. Random search, however, may not be very effective in producing high quality solutions to complex problems simply due to the random nature of the search. For research purposes, it seems that a random search-based starting point within a solution space is necessary in order to produce what some consider to be independent samples (final solutions) to complex problems using other heuristic methods.