Customer Allocation in Maximum Capture Problems

Sheikh, A. and Salhi, S. and Ndiaye, M. (2012) Customer Allocation in Maximum Capture Problems. Journal of Mathematical Modelling and Algorithms, 11 (3). pp. 281-293. ISSN 1572-9214 . (The full text of this publication is not available from this repository)

The full text of this publication is not available from this repository. (Contact us about this Publication)

Abstract

The maximum capture (MAXCAP) model and its variants have been widely used to find the maximum capture that a firm can get as it enters a spatial market where there are already existing (competitor’s) facilities. While the model obtains the optimal demand capture, it however allows the customers to be assigned to the non-closest facility which may incur additional operating costs. A two stage method can be used that overcomes the drawback of the original model while requiring a negligible extra computational effort. To make the original model mathematically self contained and more concise two revised formulations of the problem RMAXCAP-1 and RMAXCAP-2 are proposed which assure that the customers patronize only their closest entering facilities. These models are tested on different sizes of datasets and their performances are compared.

Item Type: Article
Uncontrolled keywords: Maximum capture model· MAXCAP · Customer allocation · Location analysis
Subjects: H Social Sciences
H Social Sciences > H Social Sciences (General)
Divisions: Faculties > Social Sciences > Kent Business School
Faculties > Social Sciences > Kent Business School > Management Science
Depositing User: Cathy Norman
Date Deposited: 29 May 2012 13:17
Last Modified: 24 Oct 2012 14:20
Resource URI: http://kar.kent.ac.uk/id/eprint/29589 (The current URI for this page, for reference purposes)
  • Depositors only (login required):