We explore global optimizations- simulated annealing (SA) and hill-climbing (HC)-for placement of multiple optical network units (ONU) in a hybrid optical- wireless access network. We compare the performance of SA and HC with a greedy algorithm (greedy) and conclude that results from Greedy are quite comparable to those from SA and HC, but at much lower processing requirements.