Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10348321 | Computers & Operations Research | 2012 | 10 Pages |
Abstract
⺠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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
S.M.H. Manzour-al-Ajdad, S.A. Torabi, S. Salhi,