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

• 成果类型: Article
• 署名作者: Campbell, JF; Ernst, AT; Krishnamoorthy, M
• 署名单位: University of Missouri System; University of Missouri Saint Louis; Commonwealth Scientific & Industrial Research Organisation (CSIRO)
• 刊物名称: MANAGEMENT SCIENCE
• ISSN/ISSBN: 0025-1909
• DOI: 10.1287/mnsc.1050.0407
• 发表日期: 2005
• 页码: 1556-1571
• 关键词: hub arc location; hub location; Network design; integer programming formulations; algorithms

摘要

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.