The planar hub location problem: a probabilistic clustering approach


Iyigun C.

ANNALS OF OPERATIONS RESEARCH, cilt.211, ss.193-207, 2013 (SCI İndekslerine Giren Dergi) identifier identifier

  • Cilt numarası: 211 Konu: 1
  • Basım Tarihi: 2013
  • Doi Numarası: 10.1007/s10479-013-1394-4
  • Dergi Adı: ANNALS OF OPERATIONS RESEARCH
  • Sayfa Sayıları: ss.193-207

Özet

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.