Shaikh, Arifusalam, Salhi, Said, Ndiaye, Malick M. (2015) New MAXCAP Related Problems: Formulation and Model Solutions: A class of competitive location problems. Computers & Industrial Engineering, 85 . pp. 248-259. ISSN 0360-8352. (doi:10.1016/j.cie.2015.03.018) (KAR id:48033)
PDF (MaxCAP related competitiove location problems)
Language: English |
|
Download this file (PDF/741kB) |
|
Request a format suitable for use with assistive technology e.g. a screenreader | |
Official URL: http://dx.doi.org/10.1016/j.cie.2015.03.018 |
Abstract
In this paper three related problems of the maximum capture (MAXCAP) model are proposed. These include the case where facilities provide a certain amount of service level for the customers, the possibility where customers do not allocate their demand completely to one facility but prorate their demand based on the service level, and finally we explore the situation where customers will not opt for sharing their demand irrespective of the service level if the next attractive facility is too far way which we express by a distance threshold. These models are put forward to mimic realistic situations related to customer behaviour when it comes to selecting a facility. Their respective mathematical formulations are put forward and tested on a case study and also over a range of larger data sets.
Item Type: | Article |
---|---|
DOI/Identification number: | 10.1016/j.cie.2015.03.018 |
Uncontrolled keywords: | Competitive location, customer behaviour, ILP formulations |
Subjects: |
H Social Sciences > H Social Sciences (General) Q Science > Operations Research - Theory |
Divisions: | Divisions > Kent Business School - Division > Department of Analytics, Operations and Systems |
Depositing User: | Said Salhi |
Date Deposited: | 22 Apr 2015 10:43 UTC |
Last Modified: | 05 Nov 2024 10:31 UTC |
Resource URI: | https://kar.kent.ac.uk/id/eprint/48033 (The current URI for this page, for reference purposes) |
- Link to SensusAccess
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):