Abstract
Competitive facility location problems (CFLP) form a wide class of optimization problems. A new facility is to location and the market share captured by each facility depends on its distance to customers and its location costs. This paper proposes a new location problem of competitive facilities where the service capability of each facility is considered. The aggregation effects which could appear in the process of location are also considered. In order to solve the large size problems, a heuristic algorithm base on greedy idea is proposed. Simulation results show the effectiveness of the algorithm.
Sign-in/Register to access full text options 
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.
