Optimal placement of a finite-size facility: A computational study of sequential and parallel implementations

Ketan Date, Rakesh Nagi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We present a computational study related to the optimal placement of a single, finite-size, rectangular facility in presence of other rectangular facilities. All the facilities interact with each other through the input/output points located on their boundary. The objective is to locate the new facility optimally so as to minimize the total weighted rectilinear distance between the interacting facilities. We explore two different solution procedures: (1) a parallel explicit enumeration procedure using message passing interface (MPI); and (2) the sequential dominance procedure. We test both procedures on randomly generated layouts and compare the benefits of parallelization versus the dominance rules.

Original languageEnglish (US)
Title of host publication7th IFAC Conference on Manufacturing Modelling, Management, and Control, MIM 2013 - Proceedings
PublisherIFAC Secretariat
Pages460-465
Number of pages6
Edition9
ISBN (Print)9783902823359
DOIs
StatePublished - 2013
Externally publishedYes
Event7th IFAC Conference on Manufacturing Modelling, Management, and Control, MIM 2013 - Saint Petersburg, Russian Federation
Duration: Jun 19 2013Jun 21 2013

Publication series

NameIFAC Proceedings Volumes (IFAC-PapersOnline)
Number9
Volume46
ISSN (Print)1474-6670

Other

Other7th IFAC Conference on Manufacturing Modelling, Management, and Control, MIM 2013
Country/TerritoryRussian Federation
CitySaint Petersburg
Period6/19/136/21/13

Keywords

  • Dominance rules
  • Facility location
  • Finite-size facility
  • MPI
  • Parallel computing

ASJC Scopus subject areas

  • Control and Systems Engineering

Fingerprint

Dive into the research topics of 'Optimal placement of a finite-size facility: A computational study of sequential and parallel implementations'. Together they form a unique fingerprint.

Cite this