Abstract
The Anti-Covering Location Problem (ACLP) is a member of an important class of spatial optimization problems. The ACLP involves locating a maximally weighted set of facilities so that no two located facilities are within a specified time or distance measure of each other. This papar examines alternative constraint structures for imposing spatial restrictions within the ACLP. A Lagrangian relaxation solution approach is developed to solve the ACLP based upon the use of these new constraint structures. Computational results from a number of geographical problems demonstrate the effectiveness of the Lagrangian heuristic and concomitantly, the new constraint representations.
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.
