Single-facility huff location problems on networks

Rafael Blanquero (), Emilio Carrizosa (), Amaya Nogales-Gómez () and Frank Plastria ()

Annals of Operations Research, 2014, vol. 222, issue 1, 175-195

Abstract: Huff location problems have been extensively analyzed within the field of competitive continuous location. In this work, two Huff location models on networks are addressed, by considering that users go directly to the facility or they visit the facility in their way to a destination. Since the problems are multimodal, a branch and bound algorithm is proposed, in which two different bounding strategies, based on Interval Analysis and DC optimization, are used and compared. Computational results are given for the two bounding procedures, showing that problems of rather realistic size can be solved in reasonable time. Copyright Springer Science+Business Media New York 2014

Keywords: Huff location models; Location on networks; DC optimization; Interval analysis (search for similar items in EconPapers)
Date: 2014
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://hdl.handle.net/10.1007/s10479-013-1445-x (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:222:y:2014:i:1:p:175-195:10.1007/s10479-013-1445-x

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-013-1445-x

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().