Skip navigation

A nested location-routing heuristic using route length estimation

A nested location-routing heuristic using route length estimation

Nagy, Gabor and Salhi, Said (1996) A nested location-routing heuristic using route length estimation. Studies in Locational Analysis, 10. pp. 109-127. ISSN 1105-5162

Full text not available from this repository.

Abstract

A nested heuristic approach that uses route length approximation is proposed to solve the location-routing problem. A new estimation formula for route length approximation is also developed. The heuristic is evaluated empirically against the sequential method and a recently developed nested method for location routing problems. This testing is carried out on a set of problems of 400 customers and around 15 to 25 depots with good results.

Item Type: Article
Uncontrolled Keywords: Heuristic approach, Location-routing
Subjects: Q Science > QA Mathematics
Pre-2014 Departments: School of Computing & Mathematical Sciences
Last Modified: 28 Jun 2017 09:31
Selected for GREAT 2016: None
Selected for GREAT 2017: None
Selected for GREAT 2018: None
URI: http://gala.gre.ac.uk/id/eprint/103

Actions (login required)

View Item View Item