The planar hub location problem: a probabilistic clustering approach

Iyigun C.

ANNALS OF OPERATIONS RESEARCH, vol.211, no.1, pp.193-207, 2013 (SCI-Expanded) identifier identifier

  • Publication Type: Article / Article
  • Volume: 211 Issue: 1
  • Publication Date: 2013
  • Doi Number: 10.1007/s10479-013-1394-4
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Page Numbers: pp.193-207
  • Keywords: Hub location problem, Planar hub location, Clustering, Fermat-Weber problem, Probabilistic assignments, FORMULATIONS, ALGORITHM, FACILITY
  • Middle East Technical University Affiliated: Yes


Given the demand between each origin-destination pair on a network, the planar hub location problem is to locate the multiple hubs anywhere on the plane and to assign the traffic to them so as to minimize the total travelling cost. The trips between any two points can be nonstop (no hubs used) or started by visiting any of the hubs. The travel cost between hubs is discounted with a factor. It is assumed that each point can be served by multiple hubs.