Abstract
Competitive facility location problem has been studied in many literatures, which were dealt with problems considering location of some competitive facilities on at most two-dimensional space. In this study, we formulate competitive facility location problem in the situation that a new facility is located on a multi-dimensional space which has been already located several facilities. In order to find an optimal solution for the problem efficiently, first we show that one of optimal solutions is found by a combination problem, and then we use genetic algorithm with double structured strings to find approximate solution of the problem. In order to illustrate the efficiency of our proposing algorithm, results for numerical experiments are shown.
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.
