The planar hub location problem: a probabilistic clustering approach

Date

2013-12-01

Author

İyigün, Cem

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

11
views

0
downloads

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.

Subject Keywords

Management Science and Operations Research, General Decision Sciences

URI

https://hdl.handle.net/11511/37663

Journal

ANNALS OF OPERATIONS RESEARCH

DOI

https://doi.org/10.1007/s10479-013-1394-4

Collections

Department of Industrial Engineering, Article

Citation Formats

C. İyigün, “The planar hub location problem: a probabilistic clustering approach,” ANNALS OF OPERATIONS RESEARCH, vol. 211, no. 1, pp. 193–207, 2013, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/37663.