Show simple item record

FieldValueLanguage
dc.contributor.authorHaase, Knut
dc.date.accessioned2018-11-23
dc.date.available2018-11-23
dc.date.issued2009-03-01
dc.identifier.issnISSN 1832-570X
dc.identifier.urihttp://hdl.handle.net/2123/19420
dc.description.abstractTwo new models for discrete location planning under static competition are introduced. The empirical context is an enterprise that is planning to set up a number of stores in various locations. The probability that a customer chooses a specific store is obtained from a multinomial logit (MNL) model. In the first model we apply the basic MNL model where the choice set contains all potential locations. To obtain the choice probabilities of a reduced choice set, we take advantage of the property of constant substitution patterns which can be modelled by linear constraints. In the second model we consider the case where flexible substitution patterns are accounted for. The main idea is to simulate, for a given number of individuals, their alternative specific utility values. Thus for each individual, we can identify which locations have to be opened to attract an individual as a customer. We consider two parcel service providers in the City of Dresden. Both approaches can be solved very fast within few minutes with a small solution gap by a state-of-the-art solver.en_AU
dc.relation.ispartofseriesITLS-WP-09-07en_AU
dc.subjectDiscrete location, competition, multinomial logit model, constant substitution patterns, flexible substitution patterns, simulation, parcel service provideren_AU
dc.titleDiscrete location planningen_AU
dc.typeWorking Paperen_AU
dc.contributor.departmentITLSen_AU


Show simple item record

Associated file/s

Associated collections

Show simple item record

There are no previous versions of the item available.