Manzour-al-Ajdad, S.M.H. and Torabi, S.A. and Salhi, S. (2012) A Hierarchical Algorithm for the Planar Single-facility Location Routing Problem. Computers & Operations Research, 39 (2). pp. 461-470. ISSN 0305-0548.
|The full text of this publication is not available from this repository. (Contact us about this Publication)|
Location routing problem (LRP) is an important logistical problem that comprises two of the main logistical drivers namely facility location and vehicle routing. In this paper, we focus on the planar single-facility LRP with Euclidean distance where the location of the facility can be anywhere in the space and not restricted to a given set of potential sites only as in the discrete case. A hierarchical heuristic-based method is put forward which continuously takes into account the information from the routing results while systematically improving the location using the end-points of the obtained routes. In addition, some enhancement schemes that include a set of local searches as well as diversification and intensification mechanisms are also incorporated into the search. The proposed method out-performed the existing approaches when tested on the data sets taken from the literature. Our approach produced nine new best results out of the fifteen in the literature besides being relatively robust when compared to the existing methods.
|Uncontrolled keywords:||Location routing problem Weber problem Heuristics Logistics|
|Subjects:||H Social Sciences
H Social Sciences > H Social Sciences (General)
|Divisions:||Faculties > Social Sciences > Kent Business School
Faculties > Social Sciences > Kent Business School > Management Science
|Depositing User:||Cathy Norman|
|Date Deposited:||29 May 2012 11:54|
|Last Modified:||29 May 2012 13:52|
|Resource URI:||http://kar.kent.ac.uk/id/eprint/29587 (The current URI for this page, for reference purposes)|
- Depositors only (login required):