Capacitated hierarchical clustering heuristic for multi depot location-routing problems

In this paper, the authors develop a hierarchical clustering-based heuristic for the multi-depot location-routing problem (MDLRP). They contribute to the literature in two ways. First, they develop two stopping rules for capacitated hierarchical clustering. Hierarchical clustering does not require a priori assumptions about the number of clusters. The authors test the performance of stopping rules that determine the number of clusters under various assumptions. Second, they compare the performance of their hierarchical clustering-based heuristic approach for the MDLRP with heuristics and meta-heuristics previously proposed in the literature. Their heuristic often finds lower costs on average than the heuristics proposed in the literature and generates solutions within 4%, on average, of various meta-heuristic approaches proposed in the literature. As a result of this level of performance, the authors suggest that this heuristic can be used as a simple solution or a warm start solution for any improvement procedure.

Language

  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 01497448
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Oct 22 2013 11:48AM