Uncapacitated single allocation p-hub maximal covering problem

Young Ha Hwang, Young Hoon Lee

Research output: Contribution to journalArticle

28 Citations (Scopus)

Abstract

The hub location problem is to find a set of hub nodes on the network, where logistics transportation via the hubs is encouraged because of the cost or distance savings. Each node that has a specified amount of demands can be connected to one of p hubs. The uncapacitated single allocation p-hub maximal covering problem is to maximize the logistics covered, where the logistics of demand is said to be covered if the distance between two nodes is less than or equal to the specified range in consideration of the distance savings between hubs. The aim of our model is to locate the hub, and to allocate non-hub nodes to the located hub nodes; the hub can maximize the demand covered by deadline traveling time. It is presented an integer programming formulation for the new hub covering model, and a computational study based on several instances derived from the CAB (Civil Aeronautics Board) data set. Two heuristics, distance based allocation and volume based allocation methods, are suggested with a computational experiment on the CAB data set. Performances of heuristics are evaluated, and it is shown that good solutions are found in a relatively reasonable computation time for most of instances.

Original languageEnglish
Pages (from-to)382-389
Number of pages8
JournalComputers and Industrial Engineering
Volume63
Issue number2
DOIs
Publication statusPublished - 2012 Sep 1

Fingerprint

Logistics
Aviation
Integer programming
Costs
Experiments

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Engineering(all)

Cite this

@article{89d1cf2eab1b437d90aefc9d9702f9e0,
title = "Uncapacitated single allocation p-hub maximal covering problem",
abstract = "The hub location problem is to find a set of hub nodes on the network, where logistics transportation via the hubs is encouraged because of the cost or distance savings. Each node that has a specified amount of demands can be connected to one of p hubs. The uncapacitated single allocation p-hub maximal covering problem is to maximize the logistics covered, where the logistics of demand is said to be covered if the distance between two nodes is less than or equal to the specified range in consideration of the distance savings between hubs. The aim of our model is to locate the hub, and to allocate non-hub nodes to the located hub nodes; the hub can maximize the demand covered by deadline traveling time. It is presented an integer programming formulation for the new hub covering model, and a computational study based on several instances derived from the CAB (Civil Aeronautics Board) data set. Two heuristics, distance based allocation and volume based allocation methods, are suggested with a computational experiment on the CAB data set. Performances of heuristics are evaluated, and it is shown that good solutions are found in a relatively reasonable computation time for most of instances.",
author = "Hwang, {Young Ha} and Lee, {Young Hoon}",
year = "2012",
month = "9",
day = "1",
doi = "10.1016/j.cie.2012.03.014",
language = "English",
volume = "63",
pages = "382--389",
journal = "Computers and Industrial Engineering",
issn = "0360-8352",
publisher = "Elsevier Limited",
number = "2",

}

Uncapacitated single allocation p-hub maximal covering problem. / Hwang, Young Ha; Lee, Young Hoon.

In: Computers and Industrial Engineering, Vol. 63, No. 2, 01.09.2012, p. 382-389.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Uncapacitated single allocation p-hub maximal covering problem

AU - Hwang, Young Ha

AU - Lee, Young Hoon

PY - 2012/9/1

Y1 - 2012/9/1

N2 - The hub location problem is to find a set of hub nodes on the network, where logistics transportation via the hubs is encouraged because of the cost or distance savings. Each node that has a specified amount of demands can be connected to one of p hubs. The uncapacitated single allocation p-hub maximal covering problem is to maximize the logistics covered, where the logistics of demand is said to be covered if the distance between two nodes is less than or equal to the specified range in consideration of the distance savings between hubs. The aim of our model is to locate the hub, and to allocate non-hub nodes to the located hub nodes; the hub can maximize the demand covered by deadline traveling time. It is presented an integer programming formulation for the new hub covering model, and a computational study based on several instances derived from the CAB (Civil Aeronautics Board) data set. Two heuristics, distance based allocation and volume based allocation methods, are suggested with a computational experiment on the CAB data set. Performances of heuristics are evaluated, and it is shown that good solutions are found in a relatively reasonable computation time for most of instances.

AB - The hub location problem is to find a set of hub nodes on the network, where logistics transportation via the hubs is encouraged because of the cost or distance savings. Each node that has a specified amount of demands can be connected to one of p hubs. The uncapacitated single allocation p-hub maximal covering problem is to maximize the logistics covered, where the logistics of demand is said to be covered if the distance between two nodes is less than or equal to the specified range in consideration of the distance savings between hubs. The aim of our model is to locate the hub, and to allocate non-hub nodes to the located hub nodes; the hub can maximize the demand covered by deadline traveling time. It is presented an integer programming formulation for the new hub covering model, and a computational study based on several instances derived from the CAB (Civil Aeronautics Board) data set. Two heuristics, distance based allocation and volume based allocation methods, are suggested with a computational experiment on the CAB data set. Performances of heuristics are evaluated, and it is shown that good solutions are found in a relatively reasonable computation time for most of instances.

UR - http://www.scopus.com/inward/record.url?scp=84860998123&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84860998123&partnerID=8YFLogxK

U2 - 10.1016/j.cie.2012.03.014

DO - 10.1016/j.cie.2012.03.014

M3 - Article

VL - 63

SP - 382

EP - 389

JO - Computers and Industrial Engineering

JF - Computers and Industrial Engineering

SN - 0360-8352

IS - 2

ER -