Hub Arc Location Problems: Part II—Formulations and Optimal Algorithms

A companion 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.

• 저널Management Science · 51(10) · 1556–1571
• 토픽Vehicle Routing Optimization Methods · Industrial and Manufacturing Engineering
• DOI10.1287/mnsc.1050.0407
• 저자James F. Campbell, Andreas Ernst, Mohan Krishnamoorthy