Aggregation and Disaggregation Techniques and Methodology in Optimization

A fundamental issue in the use of optimization models is the tradeoff between the level of detail and the ease of using and solving the model. Aggregation and disaggregation techniques have proven to be valuable tools for manipulating data and determining the appropriate policies to employ for this tradeoff. Furthermore, aggregation and disaggregation techniques offer promise for solving large-scale optimization models, supply a set of promising methodologies for studying the underlying structure of both univariate and multivariate data sets, and provide a set of tools for manipulating data for different levels of decision makers. In this paper, we develop a general framework for aggregation and disaggregation methodology, survey previous work regarding aggregation and disaggregation techniques for optimization problems, illuminate the appropriate role of aggregation and disaggregation methodology for optimization applications, and propose future research directions.

[1]  G. B. Mathews.  On the Partition of Numbers , 1896 .

[2]  Walter D. Fisher.  On Grouping for Maximum Homogeneity , 1958 .

[3]  Herbert A. Simon,et al.  Aggregation of Variables in Dynamic Systems , 1961 .

[4]  F. d'Epenoux,et al.  A Probabilistic Production and Inventory Problem , 1963 .

[5]  F. Glover.  A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem , 1965 .

[6]  E. Balas.  An Additive Algorithm for Solving Linear Programs with Zero-One Variables , 1965 .

[7]  E. Balas.  Solution of Large-Scale Transportation Problems Through Aggregation , 1965 .

[8]  G. N. Lance,et al.  A General Theory of Classificatory Sorting Strategies: 1. Hierarchical Systems , 1967, Comput. J..

[9]  David G. Luenberger,et al.  Quasi-Convex Programming , 1968 .

[10]  Arthur M. Geoffrion,et al.  An Improved Implicit Enumeration Approach for Integer Programming , 1969, Oper. Res..

[11]  Arthur M. Geoffrion,et al.  Elements of Large Scale Mathematical Programming Part II: Synthesis of Algorithms and Bibliography , 1970 .

[12]  Y. Ijiri.  Fundamental Queries in Aggregation Theory , 1971 .

[13]  Gordon H. Bradley,et al.  Transformation of integer programs to knapsack problems , 1971, Discret. Math..

[14]  K. Zoller.  Optimal Disaggregation of Aggregate Production Plans , 1971 .

[15]  Fred W. Glover,et al.  Aggregating diophantine equations , 1972, Z. Oper. Research.

[16]  G. Nemhauser,et al.  Integer Programming , 2020 .

[17]  M. Padberg.  Equivalent knapsack‐type formulations of bounded integer linear programs: An alternative approach , 1972 .

[18]  Michael R. Anderberg,et al.  Cluster Analysis for Applications , 1973 .

[19]  Arnoldo C. Hax,et al.  Hierarchical integration of production planning and scheduling , 1973 .

[20]  G. Rausser,et al.  Sufficient Conditions for Aggregation of Linear Programming Models , 1973 .

[21]  Jac M. Anthonisse,et al.  A note on equivalent systems of linear diophantine equations , 1973, Z. Oper. Research.

[22]  V. Mabert,et al.  Quadratic Inventory Cost Approximations and the Aggregation of Individual Products , 1973 .

[23]  Harvey J. Greenberg,et al.  The Generalized Penalty-Function/Surrogate Model , 1973, Oper. Res..

[24]  Ivo G. Rosenberg,et al.  Aggregation of equations in integer programming , 1974, Discret. Math..

[25]  Jonathan J. Golovin.  Hierarchical integration of planning and control. , 1975 .

[26]  Alvin C. Egbert,et al.  Analysis of Aggregation Errors in Linear Programming Planning Models , 1975 .

[27]  Fred W. Glover.  New results on equivalent integer programming formulations , 1975, Math. Program..

[28]  J. A. Tomlin,et al.  On scaling linear programming problems , 1975 .

[29]  Ian Masser,et al.  Hierarchical Aggregation Procedures for Interaction Data , 1975 .

[30]  John A. Hartigan,et al.  Clustering Algorithms , 1975 .

[31]  Shao-ju Lee.  Surrogate programming by aggregation , 1975 .

[32]  Henry Gabbay.  Some Issues in Hierarchical Planning. , 1975 .

[33]  Yupo Chan,et al.  A method to simplify network representation in transportation planning , 1976 .

[34]  John G. Kemeny,et al.  Finite Markov chains , 1960 .

[35]  James R. Evans.  A combinatorial equivalence between A class of multicommodity flow problems and the capacitated transportation problem , 1976, Math. Program..

[36]  S. Fienberg,et al.  Estimating the Total Overstatement Error in Accounting Populations , 1977 .

[37]  Stanley Zionts,et al.  Technical Note - Solving Integer Programming Problems by Aggregating Constraints , 1977, Oper. Res..

[38]  Arthur M. Geoffrion.  A priori error bounds for procurement commodity aggregation in logistics planning models , 1977 .

[39]  D. Barr,et al.  An Eigenvector Condition for Markov Chain Lumpability , 1977 .

[40]  Gabriel R. Bitran,et al.  ON THE DESIGN OF HIERARCHICAL PRODUCTION PLANNING SYSTEMS , 1977 .

[41]  Antonio Guccione,et al.  A note on the necessary conditions for exact aggregation of linear programming models , 1977, Math. Program..

[42]  M. Kallio.  Computing bounds for the optimal value in linear programming , 1977 .

[43]  G. Salkin,et al.  Determining appropriate levels of data aggregation in a linear programming model , 1978 .

[44]  Nancy Kay Alcorn Keith,et al.  AGGREGATION IN LARGE-SCALE DISTRIBUTION SYSTEMS. , 1978 .

[45]  D Cullen,et al.  Aggregation in Network Models for Transportation Planning , 1978 .

[46]  G. Gaalman.  Optimal Aggregation of Multi-Item Production Smoothing Models , 1978 .

[47]  Ward Whitt,et al.  Approximations of Dynamic Programs, I , 1978, Math. Oper. Res..

[48]  E. Hillsman,et al.  Errors in measuring distances from populations to service centers , 1978 .

[49]  K. Hinderer.  ON APPROXIMATE SOLUTIONS OF FINITE-STAGE DYNAMIC PROGRAMS , 1978 .

[50]  I. Vakhutinsky,et al.  Iterative Aggregation--A New Approach to the Solution of Large-Scale Problems , 1979 .

[51]  James R. Evans.  MODEL SIMPLIFICATION IN MULTICOMMODITY DISTRIBUTION SYSTEMS THROUGH AGGREGATION , 1979 .

[52]  Ronald L. Rardin,et al.  Some relationships between lagrangian and surrogate duality in integer programming , 1979, Math. Program..

[53]  James R. Evans.  Aggregation in the generalized transportation problem , 1979, Comput. Oper. Res..

[54]  Henry Gabbay,et al.  Optimal aggregation and disaggregation in hierarchical planning , 1979 .

[55]  Paul H. Zipkin.  Bounds for aggregating nodes in network problems , 1980, Math. Program..

[56]  Paul H. Zipkin,et al.  Bounds on the Effect of Aggregating Variables in Linear Programs , 1980, Oper. Res..

[57]  Martin Dyer.  Calculating surrogate constraints , 1980, Math. Program..

[58]  G. W. Milligan,et al.  An examination of the effect of six types of error perturbation on fifteen clustering algorithms , 1980 .

[59]  M. Fisher.  Worst-Case Analysis of Heuristic Algorithms , 1980 .

[60]  Paul H. Zipkin,et al.  Bounds for Row-Aggregation in Linear Programming , 1980, Oper. Res..

[61]  Quirino Paris,et al.  Consistent aggregation of linear complementarity problems , 1980, Math. Program..

[62]  R. Mendelssohn.  Improved Bounds for Aggregated Linear P rog rams , 1980 .

[63]  Gabriel R. Bitran,et al.  Hierarchical Production Planning: A Single Stage System , 1981, Oper. Res..

[64]  L Bach,et al.  The Problem of Aggregation and Distance for Analyses of Accessibility and Access Opportunity in Location-Allocation Models , 1981 .

[65]  R. Plante,et al.  Implementation of Upper Multinomial Bound Using Clustering , 1981 .

[66]  James R. Evans.  The multicommodity assignment problem: a network aggregation heuristic , 1981 .

[67]  Sven Axsäter,et al.  Aggregation of Product Data for Hierarchical Production Planning , 1981, Oper. Res..

[68]  R. Rardin,et al.  Surrogate duality in a branch‐and‐bound procedure , 1981 .

[69]  Arnoldo C. Hax,et al.  Disaggregation and Resource Allocation Using Convex Knapsack Problems with Bounded Variables , 1981 .

[70]  W. Miranker,et al.  Acceleration by aggregation of successive approximation methods , 1982 .

[71]  J. Wijngaard.  On aggregation in production planning , 1982 .

[72]  Paul Zipkin.  Aggregation and disaggregation in convex network problems , 1982, Networks.

[73]  Oscar Barros,et al.  Planning for a Vertically Integrated Forest Industry , 1982, Oper. Res..

[74]  P. Zipkin.  Transportation problems with aggregated destinations when demands are uncertain , 1982 .

[75]  Roy Mendelssohn,et al.  An Iterative Aggregation Procedure for Markov Decision Processes , 1982, Oper. Res..

[76]  Paul H. Zipkin,et al.  Exact and Approximate Cost Functions for Product Aggregates , 1982 .

[77]  S. Axsäter.  Alternative dynamic programming approaches to obtain upper bounds for the economic lot scheduling problem , 1982 .

[78]  K. Boskma.  AGGREGATION AND THE DESIGN OF MODELS FOR MEDIUM-TERM PLANNING OF PRODUCTION , 1982 .

[79]  Gabriel R. Bitran,et al.  Hierarchical Production Planning: A Two-Stage System , 1982, Oper. Res..

[80]  James R. Evans.  A network decomposition/aggregation procedure for a class of multicommodity transportation problems , 1983, Networks.

[81]  Gerhard Knolmayer.  A simulation study of some simplification strategies in the development of product-mix models , 1983 .

[82]  M. Jambu,et al.  Cluster analysis and data analysis , 1985 .

[83]  Richard Winthrop Taylor.  Aggregate programming in large scale linear systems , 1983 .

[84]  J. Mandel,et al.  A local convergence proof for the iterative aggregation method , 1983 .

[85]  Paul J. Schweitzer,et al.  Aggregation Methods for Large Markov Chains , 1983, Computer Performance and Reliability.

[86]  Gur Huberman.  Error bounds for the aggregated convex programming problem , 1983, Math. Program..

[87]  Sven Axsäter,et al.  State aggregation in dynamic programming - An application to scheduling of independent jobs on parallel processors , 1983 .

[88]  Paul H. Zipkin,et al.  An improved disaggregation method for transportation problems , 1983, Math. Program..

[89]  G. W. Stewart,et al.  Computable Error Bounds for Aggregated Markov Chains , 1983, JACM.

[90]  Ravi Kannan,et al.  Polynomial-Time Aggregation of Integer Programming Problems , 1983, JACM.

[91]  P. Bovy,et al.  Network Aggregation Effects upon Equilibrium Assignment Outcomes: An Empirical Investigation , 1983 .

[92]  Françoise Chatelin,et al.  Iterativ Aggregation/Disaggregation Methods , 1983, Computer Performance and Reliability.

[93]  Denis C. Onyekwelu.  Technical Note - Computational Viability of a Constraint Aggregation Scheme for Integer Linear Programming Problems , 1983, Oper. Res..

[94]  Ronald L. Rardin,et al.  Surrogate Dual Multiplier Search Procedures in Integer Programming , 1984, Oper. Res..

[95]  R. Plante,et al.  A Lower Multinomial Bound for the Total Overstatement Error in Accounting Populations , 1984 .

[96]  C. M. Shetty,et al.  Solving Transportation Problems via Aggregation , 1984 .

[97]  J. Birge.  Aggregation bounds in stochastic production problems , 1984 .

[98]  Fred W. Glover,et al.  Aggregation of nonnegative integer-valued equations , 1984, Discret. Appl. Math..

[99]  Jeremy F. Shapiro.  A note on node aggregation and Benders' decomposition , 1984, Math. Program..

[100]  H. Jönsson,et al.  Aggregation and Disaggregation in Hierarchical Production Planning , 1984 .

[101]  D W Hearn.  PRACTICAL AND THEORETICAL ASPECTS OF AGGREGATION PROBLEMS IN TRANSPORTATION PLANNING MODELS , 1984 .

[102]  Joanne Susan Lavin.  Geographic aggregation in physical distribution problems , 1984 .

[103]  S. Axsäter.  Lower Bounds for the Economic Lot Scheduling Problem Using Aggregation , 1984 .

[104]  Paul H. Zipkin.  On the Imbalance of Inventories in Multi-Echelon Systems , 1984, Math. Oper. Res..

[105]  M Mizrach.  Dynamic Models of Detailed and Aggregate Production Networks. , 1985 .

[106]  Pierre-Jacques Courtois,et al.  On time and space decomposition of complex structures , 1985, CACM.

[107]  M. Queyranne,et al.  Budgeting Costs of Nursing in a Hospital , 1985 .

[108]  R. Bemelmans.  The Capacity Aspect of Inventories , 1985 .

[109]  Salah E. Elmaghraby,et al.  On the reduction method for integer linear programs, II , 1985, Discret. Appl. Math..

[110]  Vernon E Francis.  Aggregation of Network Flow Problems. , 1985 .

[111]  Paul J. Schweitzer,et al.  Iterative Aggregation-Disaggregation Procedures for Discounted Semi-Markov Reward Processes , 1985, Oper. Res..

[112]  T. Klastorin.  The p-Median Problem for Cluster Analysis: A Comparative Test Using the Mixture Model Approach , 1985 .

[113]  R. Benveniste.  Solving the Combined Zoning and Location Problem for Several Emergency Units , 1985, The Journal of the Operational Research Society.

[114]  Sang M. Lee,et al.  A Zero-One Goal-Programming Algorithm Using Partitioning and Constraint Aggregation , 1987 .

[115]  H. Greenberg.  On equivalent knapsack problems , 1986, Discret. Appl. Math..

[116]  Andres Weintraub,et al.  Strategic planning in forest industries , 1986 .

[117]  Sven Axsäter,et al.  Aggregating Items in Multi-Level Lot Sizing , 1986 .

[118]  Kyle W. Kindle,et al.  An iterative aggregation-disaggregation algorithm for solving linear equations , 1986 .

[119]  Pitu B. Mirchandani,et al.  “Spatial nodes” in discrete location problems , 1986 .

[120]  Sven Axsäter,et al.  Technical Note - On the Feasibility of Aggregate Production Plans , 1986, Oper. Res..

[121]  Nancy Lea Hyer,et al.  Procedures for the part family/machine group identification problem in cellular manufacturing , 1986 .

[122]  Eugeniusz Toczyłowski.  On aggregation of items in the single-stage lot size scheduling problem , 1986 .

[123]  E. Toczylowski.  On aggregation in a two-dimensional cutting stock scheduling problem , 1986 .

[124]  J. Erschler,et al.  Consistency of the Disaggregation Process in Hierarchical Planning , 1986, Oper. Res..

[125]  J. Frolík.  Note on aggregation in linear programming problems , 1986 .

[126]  H. C. Meal,et al.  Material requirements planning in hierarchical production planning systems , 1987 .

[127]  L. M. Dubkin,et al.  Iterative aggregation theory , 1987 .

[128]  Samuel S. Chiu,et al.  A Method to Calculate Steady-State Distributions of Large Markov Chains by Aggregating States , 1987, Oper. Res..

[129]  G. W. Milligan,et al.  Methodology Review: Clustering Methods , 1987 .

[130]  Richard W. Taylor,et al.  Solving large-scale linear programs by aggregation , 1987, Comput. Oper. Res..

[131]  Robert L. Smith,et al.  Aggregation in Dynamic Programming , 1987, Oper. Res..

[132]  Sven Axsäter,et al.  Disaggregation under Uncertainty in Hierarchical Production Planning , 1988 .

[133]  Harold Greenberg.  A new reduction method in integer programming , 1988, Discret. Appl. Math..

[134]  G. W. Milligan,et al.  A study of standardization of variables in cluster analysis , 1988 .

[135]  Sang M. Lee,et al.  A comparison of a constraint aggregation and partitioning zero-one goal programming algorithm with the lee and Morris algorithm , 1988, Comput. Oper. Res..

[136]  M. Vlach.  OH AGGREGATION OF VARIABLES IN LINEAR PROGRAMMING , 1988, Advances in Mathematical Optimization.

[137]  E. Toczylowski,et al.  Aggregation and disaggregation of end items in a class of multistage production systems , 1988 .

[138]  Hark Hwang,et al.  Clustering algorithms for order picking in an automated storage and retrieval system , 1988 .

[139]  Narinder Nath Kathuria.  Predictive accuracy of aggregate planning LP models , 1988 .

[140]  M. Daskin,et al.  Aggregation effects in maximum covering models , 1990 .

[141]  D. Bertsekas,et al.  Adaptive aggregation methods for infinite horizon dynamic programming , 1989 .

[142]  Robert C. Leachman,et al.  An aggregate model of project-oriented production , 1989, IEEE Trans. Syst. Man Cybern..

[143]  Chao-Hsien Chu.  Cluster analysis in manufacturing cellular formation , 1989 .

[144]  Hanif D. Sherali,et al.  Linear programming and network flows (2nd ed.) , 1990 .