Solution Approaches for the Double-Row Equidistant Facility Layout Problem

Miguel F. Anjos (), Anja Fischer () and Philipp Hungerländer ()
Additional contact information
Miguel F. Anjos: GERAD & École Polytechnique de Montréal
Anja Fischer: TU Dortmund
Philipp Hungerländer: Alpen-Adria Universität Klagenfurt

A chapter in Operations Research Proceedings 2014, 2016, pp 17-23 from Springer

Abstract: Abstract We consider the Double-Row Equidistant Facility Layout Problem and show that the number of spaces needed to preserve at least one optimal solution is much smaller compared to the general double-row layout problem. We exploit this fact to tailor exact integer linear programming (ILP) and semidefinite programming (SDP) approaches that outperform other recent methods for this problem. We report computational results on a variety of benchmark instances showing that the ILP is preferable for small and medium instances whereas the SDP yields better results on large instances with up to 60 departments.

Date: 2016
References: Add references at CitEc
Citations: View citations in EconPapers (2)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-319-28697-6_3

Ordering information: This item can be ordered from
http://www.springer.com/9783319286976

DOI: 10.1007/978-3-319-28697-6_3

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().