Solving the Huff-based competitive location model on a network with link-based demand

This paper shows a computational method for optimizing the location of a store on a network in a competitive environment, assuming that consumers probabilistically choose stores following the Huff model (1963) and that the store can be located on a continuum of a network. This method gives the exact...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Annals of operations research 2002-03, Vol.111 (1), p.239
Hauptverfasser: Kei-Ichi Okunuki, Okabe, Atsuyuki
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This paper shows a computational method for optimizing the location of a store on a network in a competitive environment, assuming that consumers probabilistically choose stores following the Huff model (1963) and that the store can be located on a continuum of a network. This method gives the exact optimal solution with the computational order of n^sup 2^^sub N^ log n^sub N^ where n^sub N^ is the number of nodes of the network. [PUBLICATION ABSTRACT]
ISSN:0254-5330
1572-9338
DOI:10.1023/A:1020962005350