Abstract
Competitive location problems consist of determining optimal strategies for competing firms which make location decisions. The standard problem is the leader-follower location problem which consists of determining optimal strategies for two competing firms, the leader and the follower, which make decisions sequentially. The follower has the objective of maximizing its market share, given the locations chosen by the leader. The leader optimization problem is to minimize the maximum market share that the follower can get. We propose a two-swarm particle swarm optimization procedure in which each swarm contains locations for one of the two firms. We analyze the application of this procedure to the (r|p)-centroid problem in the plane. It is the leader-follower problem where the leader chooses p points and then the follower chooses r points.KeywordsCompetitive LocationHeuristicsLeader-Follower problem
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.
