Cluster first, route second graphical transformation for the allocation-location problem

William Bistline, Snehamay Banerjee

Research output: Contribution to conferencePaperpeer-review

Abstract

In many industrial scale problem the number of new facilities (NF) is not always predetermined. However, most solution algorithms require that the number of NF is predetermined. The work of this paper demonstrates a sinusoidal transformation clustering technique that suggest groupings of Existing Facilities (EF), that can be served by an appropriate NF. Primarily graphical in nature, the technique suggests, by the clustering of the transformed values, the number of NF that best might serve the original problem. The significant advantage of this approach is that it appears to work quite well for large scale problems and the number of customer locations is only a linear factor in the computational complexity of the solution.

Original languageEnglish (US)
Pages1276
Number of pages1
StatePublished - 1996
Externally publishedYes
EventProceedings of the 1996 27th Annual Meeting of the Decision Sciences Institute. Part 2 (of 3) - Orlando, FL, USA
Duration: Nov 24 1996Nov 26 1996

Conference

ConferenceProceedings of the 1996 27th Annual Meeting of the Decision Sciences Institute. Part 2 (of 3)
CityOrlando, FL, USA
Period11/24/9611/26/96

ASJC Scopus subject areas

  • Management Information Systems
  • Hardware and Architecture

Fingerprint

Dive into the research topics of 'Cluster first, route second graphical transformation for the allocation-location problem'. Together they form a unique fingerprint.

Cite this