Abstract
We propose a new combinatorial optimization problem, the so-called Directed Circular Facility Layout Problem (DCFLP). The (DCFLP) seems to be quite interesting as it contains several other problems that have been discussed extensively in literature as special cases. We show that the (DCFLP) is closely related to the Single-Row Facility Layout Problem (SRFLP) and hence we adapt the leading algorithmic method for the (SRFLP) by suggesting an appropriate modelling approach for the (DCFLP). Finally we show that this algorithmic approach yields promising computational results on a variety of benchmark instances.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
