Skip to main content
Kent Academic Repository

Solving the multiple competitive facilities location problem

Drezer, Tammy, Drezer, Zvi, Salhi, Said (2002) Solving the multiple competitive facilities location problem. European Journal of Operational Research, 142 (1). pp. 138-151. ISSN 0377-2217. (doi:10.1016/S0377-2217(01)00168-0) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:5221)

The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided.
Official URL:
http://dx.doi.org/10.1016/S0377-2217(01)00168-0

Abstract

In this paper we propose five heuristic procedures for the solution of the multiple competitive facilities location problem. A franchise of several facilities is to be located in a trade area where competing facilities already exist. The objective is to maximize the market share captured by the franchise as a whole. We perform extensive computational tests and conclude that a two-step heuristic procedure combining simulated annealing and an ascent algorithm provides the best solutions.

Item Type: Article
DOI/Identification number: 10.1016/S0377-2217(01)00168-0
Subjects: H Social Sciences
Divisions: Divisions > Kent Business School - Division > Department of Analytics, Operations and Systems
Depositing User: Said Salhi
Date Deposited: 11 Sep 2008 14:37 UTC
Last Modified: 05 Nov 2024 09:37 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/5221 (The current URI for this page, for reference purposes)

University of Kent Author Information

  • Depositors only (login required):

Total unique views for this document in KAR since July 2020. For more details click on the image.