Skip navigation

Nested heuristic methods for the location-routeing problem

Nested heuristic methods for the location-routeing problem

Nagy, G. and Salhi, S. (1996) Nested heuristic methods for the location-routeing problem. Journal of the Operational Research Society, 47 (9). pp. 1166-1174. ISSN 0160-5682 (Print), 1476-9360 (Online)

Full text not available from this repository.

Abstract

The concept of 'nested methods' is adopted to solve the location-routeing problem. Unlike the sequential and iterative approaches, in this method we treat the routeing element as a sub-problem within the larger problem of location. Efficient techniques that take into account the above concept and which use a neighbourhood structure inspired from computational geometry are presented. A simple version of tabu search is also embedded into our methods to improve the solutions further. Computational testing is carried out on five sets of problems of 400 customers with five levels of depot fixed costs, and the results obtained are encouraging.

Item Type: Article
Uncontrolled Keywords: heuristics, location, routeing
Subjects: Q Science > QA Mathematics
Pre-2014 Departments: School of Computing & Mathematical Sciences
Related URLs:
Last Modified: 14 Oct 2016 08:59
Selected for GREAT 2016: None
Selected for GREAT 2017: None
Selected for GREAT 2018: None
URI: http://gala.gre.ac.uk/id/eprint/108

Actions (login required)

View Item View Item