eprintid: 343
rev_number: 15
eprint_status: archive
userid: 7
dir: disk0/00/00/03/43
datestamp: 2011-07-29 11:55:21
lastmod: 2015-05-29 19:58:02
status_changed: 2011-07-29 11:55:21
type: report
metadata_visibility: show
item_issues_count: 0
creators_name: Jaimungal, S.
corp_creators: Emad Khalawi
corp_creators: Hasan Zidan
title: Car Centres Placement Problem
ispublished: pub
subjects: discrete
subjects: transport
subjects: retail
subjects: finance
studygroups: ksg1
companyname: Abdul Latif Jameel Co. Ltd
full_text_status: public
abstract: Deciding on where to locate the next retail outlet is a problem with a long and distinguished history beginning with the early work of Hotelling (1929) and extended by Huff (1964). The basic idea is to view potential customers as sources of purchasing power while a retail store possesses attractiveness thus creating an interacting particle model.

Here, we address the issue of where to locate a new car center based on a limited dataset. A method for distilling aggregate population information down to sub-regions is developed to provide estimates that feed into the optimization algorithm.
Two measures were used in the optimization: (i) total market share and (ii) total attractiveness. Total market share optimization is found to lead to placing the center close to competitors, while total attractiveness optimization is found to lead to placing the center closer to centroid of the population.
date: 2011
citation:   Jaimungal, S.  (2011) Car Centres Placement Problem.  [Study Group Report]     
document_url: http://miis.maths.ox.ac.uk/miis/343/1/ALJ.pdf