A Combined Cluster and Interaction Model: The Hierarchical Assignment Problem Export

@article{horo05, abstract = {This article presents a new spatial modeling approach that deals with interactions between individual geographic entities. The developed model represents a generalization of the transportation problem and the classical assignment problem and is termed the hierarchical assignment problem (HAP). The HAP optimizes the spatial flow pattern between individual origin and destination locations, given that some grouping, or aggregation of individual origins and destinations is permitted to occur. The level of aggregation is user specified, and the aggregation step is endogenous to the model itself. This allows for the direct accounting of aggregation costs in pursuit of optimal problem solutions. The HAP is formulated and solved with several sample data sets using commercial optimization software. Trials illustrate how HAP solutions respond to changes in levels of aggregation, as well as reveal the diverse network designs and allocation schemes obtainable with the HAP. Connections between the HAP and the literature on the p-median problem, cluster analysis, and hub-and-spoke networks are discussed and suggestions for future research are made.}, address = {Department of Geography, The Florida State University, Tallahassee, FL; Department of Geography, The Ohio State University, Columbus, OH}, author = {Horner, Mark W. and O'Kelly, Morton E.}, citeulike-article-id = {3575111}, citeulike-linkout-0 = {http://dx.doi.org/10.1111/j.1538-4632.2005.00567.x}, citeulike-linkout-1 = {http://www3.interscience.wiley.com/cgi-bin/abstract/118685223/ABSTRACT}, doi = {10.1111/j.1538-4632.2005.00567.x}, journal = {Geographical Analysis}, number = {3}, pages = {315--335}, posted-at = {2008-11-18 17:52:15}, priority = {2}, title = {A Combined Cluster and Interaction Model: The Hierarchical Assignment Problem}, url = {http://dx.doi.org/10.1111/j.1538-4632.2005.00567.x}, volume = {37}, year = {2005} }

TY - JOUR ID - horo05 L3 - citeulike-article-id:3575111 N2 - This article presents a new spatial modeling approach that deals with interactions between individual geographic entities. The developed model represents a generalization of the transportation problem and the classical assignment problem and is termed the hierarchical assignment problem (HAP). The HAP optimizes the spatial flow pattern between individual origin and destination locations, given that some grouping, or aggregation of individual origins and destinations is permitted to occur. The level of aggregation is user specified, and the aggregation step is endogenous to the model itself. This allows for the direct accounting of aggregation costs in pursuit of optimal problem solutions. The HAP is formulated and solved with several sample data sets using commercial optimization software. Trials illustrate how HAP solutions respond to changes in levels of aggregation, as well as reveal the diverse network designs and allocation schemes obtainable with the HAP. Connections between the HAP and the literature on the p-median problem, cluster analysis, and hub-and-spoke networks are discussed and suggestions for future research are made. IS - 3 JF - Geographical Analysis AD - Department of Geography, The Florida State University, Tallahassee, FL; Department of Geography, The Ohio State University, Columbus, OH EP - 335 TI - A Combined Cluster and Interaction Model: The Hierarchical Assignment Problem VL - 37 SP - 315 AU - Horner, Mark AU - O'Kelly, Morton PY - 2005/// UR - http://dx.doi.org/10.1111/j.1538-4632.2005.00567.x ER -