A hierarchical algorithm for the planar single-facility location routing problem

► Proposing an efficient and novel hierarchical heuristic method to tackle the Planar Single Facility Location Routing Problem (PSFLRP) with Euclidean distances. ► Incorporating some enhancement schemes including a set of local searches as well as diversification and intensification mechanisms into the search. ► Testing the proposed method against the existing ones on the comprehensive data sets taken from the literature indicating that our method outperforms the existing ones while requiring a small amount of computational effort.