Optimization Online


p-facility Huff location problem on networks

Rafael Blanquero(rblanquero***at***us.es)
Emilio Carrizosa(ecarrizosa***at***us.es)
Boglárka G.-Tóth(bog***at***math.bme.hu)
Amaya Nogales-Gómez(amayanogales***at***us.es)

Abstract: The p-facility Huff location problem aims at locating facilities on a competitive environment so as to maximize the market share. While it has been deeply studied in the field of continuous location, in this paper we study the p-facility Huff location problem on networks formulated as a Mixed Integer Nonlinear Programming problem that can be solved by a branch and bound algorithm. We propose two approaches for the initialization and division of subproblems, the first one based on the straightforward idea of enumerating every possible combination of p edges of the network as possible locations, and the second one defining sophisticated data structures that exploit the structure of the combinatorial and continuous part of the problem. Bounding rules are designed using DC (difference of convex) and Interval Analysis tools. In our computational study we compare the two approaches on a battery of 21 networks and show that both of them can handle problems for p≤4 in reasonable computing time.

Keywords: Huff location problem, location on networks, p-facility, branch and bound, DC, global optimization

Category 1: Applications -- OR and Management Sciences

Category 2: Network Optimization


Download: [PDF]

Entry Submitted: 10/30/2014
Entry Accepted: 10/30/2014
Entry Last Modified: 10/30/2014

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society