Journal
COMPUTERS & OPERATIONS RESEARCH
Volume 39, Issue 12, Pages 3325-3330Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2012.04.016
Keywords
Facility layout; Double row layout; Integer programming
Categories
Funding
- FCT (Foundation for Science and Technology-Portugal) under the grant Investigation of efficient techniques for hard optimization problems in Operations and Logistics
Ask authors/readers for more resources
The corridor allocation problem (CAP) seeks an arrangement of facilities along a central corridor defined by two horizontal lines parallel to the x-axis of a Cartesian coordinate system. The objective is to minimize the total communication cost among facilities, while respecting two main conditions: (i) no space is allowed between two adjacent facilities; (ii) the left-most point of the arrangement on either line should have zero abscissa. The conditions (i) and (ii) are required in many applications such as the arrangement of rooms at office buildings or hospitals. The CAP is a NP-Hard problem. In this paper, a mixed-integer programming formulation of the CAP is proposed, which allows us to compute optimal layouts in reasonable time for problem instances of moderate sizes. Moreover, heuristic procedures are presented that can handle larger instances. (c) 2012 Elsevier Ltd. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available