Hub arc location problems: Part II - Formulations and optimal algorithms

被引:119
作者
Campbell, JF
Ernst, AT
Krishnamoorthy, M
机构
[1] Univ Missouri, Coll Business Adm, St Louis, MO 63121 USA
[2] CSIRO, Math & Informat Sci, Clayton, Vic 3169, Australia
关键词
hub arc location; hub location; network design; integer programming formulations; algorithms;
D O I
10.1287/mnsc.1050.0407
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
Acompanion paper (Campbell et al. 2005) introduces new hub arc location models and analyzes optimal solutions, with special attention to spatial pattens and relationships. This paper provides integer programming formulations and optimal solution algorithms for these problems. We describe two optimal solution approaches in detail and compare their performance, using standard hub location data sets. We present implementation details and show how algorithms can be fine tuned based on characteristics of the data.
引用
收藏
页码:1556 / 1571
页数:16
相关论文
共 15 条