IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v146y2006i1p119-13410.1007-s10479-006-0051-6.html
   My bibliography  Save this article

Using error bounds to compare aggregated generalized transportation models

Author

Listed:
  • Igor Litvinchev
  • Socorro Rangel

Abstract

A comparative study of aggregation error bounds for the generalized transportation problem is presented. A priori and a posteriori error bounds were derived and a computational study was performed to (a) test the correlation between the a priori, the a posteriori, and the actual error and (b) quantify the difference of the error bounds from the actual error. Based on the results we conclude that calculating the a priori error bound can be considered as a useful strategy to select the appropriate aggregation level. The a posteriori error bound provides a good quantitative measure of the actual error. Copyright Springer Science+Business Media, LLC 2006

Suggested Citation

  • Igor Litvinchev & Socorro Rangel, 2006. "Using error bounds to compare aggregated generalized transportation models," Annals of Operations Research, Springer, vol. 146(1), pages 119-134, September.
    • Handle: RePEc:spr:annopr:v:146:y:2006:i:1:p:119-134:10.1007/s10479-006-0051-6
    DOI: 10.1007/s10479-006-0051-6
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-006-0051-6
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-006-0051-6?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Paul H. Zipkin, 1980. "Bounds on the Effect of Aggregating Variables in Linear Programs," Operations Research, INFORMS, vol. 28(2), pages 403-418, April.
    2. D. Klingman & A. Napier & J. Stutz, 1974. "NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems," Management Science, INFORMS, vol. 20(5), pages 814-821, January.
    3. Hallefjord, Asa & Jornsten, Kurt O. & Varbrand, Peter, 1993. "Solving large scale generalized assignment problems -- An aggregation / disaggregation approach," European Journal of Operational Research, Elsevier, vol. 64(1), pages 103-114, January.
    4. David F. Rogers & Robert D. Plante & Richard T. Wong & James R. Evans, 1991. "Aggregation and Disaggregation Techniques and Methodology in Optimization," Operations Research, INFORMS, vol. 39(4), pages 553-582, August.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. John Turner, 2012. "The Planning of Guaranteed Targeted Display Advertising," Operations Research, INFORMS, vol. 60(1), pages 18-33, February.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Merrick, James H. & Weyant, John P., 2019. "On choosing the resolution of normative models," European Journal of Operational Research, Elsevier, vol. 279(2), pages 511-523.
    2. Srinivasa, Anand V. & Wilhelm, Wilbert E., 1997. "A procedure for optimizing tactical response in oil spill clean up operations," European Journal of Operational Research, Elsevier, vol. 102(3), pages 554-574, November.
    3. Murwan Siddig & Yongjia Song, 2022. "Adaptive partition-based SDDP algorithms for multistage stochastic linear programming with fixed recourse," Computational Optimization and Applications, Springer, vol. 81(1), pages 201-250, January.
    4. Beltran-Royo, C., 2017. "Two-stage stochastic mixed-integer linear programming: The conditional scenario approach," Omega, Elsevier, vol. 70(C), pages 31-42.
    5. Merrick, James H., 2016. "On representation of temporal variability in electricity capacity planning models," Energy Economics, Elsevier, vol. 59(C), pages 261-274.
    6. Jornsten, Kurt & Leisten, Rainer, 1995. "Decomposition and iterative aggregation in hierarchical and decentralised planning structures," European Journal of Operational Research, Elsevier, vol. 86(1), pages 120-141, October.
    7. Fu Lin & Sven Leyffer & Todd Munson, 2016. "A two-level approach to large mixed-integer programs with application to cogeneration in energy-efficient buildings," Computational Optimization and Applications, Springer, vol. 65(1), pages 1-46, September.
    8. Ali Fattahi & Sriram Dasu & Reza Ahmadi, 2023. "Peak-Load Energy Management by Direct Load Control Contracts," Management Science, INFORMS, vol. 69(5), pages 2788-2813, May.
    9. John Turner, 2012. "The Planning of Guaranteed Targeted Display Advertising," Operations Research, INFORMS, vol. 60(1), pages 18-33, February.
    10. Kremer, Mirko & Schneeweiss, Christoph & Zimmermann, Michael, 2006. "On the validity of aggregate models in designing supply chain contracts," International Journal of Production Economics, Elsevier, vol. 103(2), pages 656-666, October.
    11. Gutierrez, Genaro J. & Kouvelis, Panagiotis & Kurawarwala, Abbas A., 1996. "A robustness approach to uncapacitated network design problems," European Journal of Operational Research, Elsevier, vol. 94(2), pages 362-376, October.
    12. Richard Connors & David Watling, 2015. "Assessing the Demand Vulnerability of Equilibrium Traffic Networks via Network Aggregation," Networks and Spatial Economics, Springer, vol. 15(2), pages 367-395, June.
    13. Minghe Sun, 2005. "Warm-Start Routines for Solving Augmented Weighted Tchebycheff Network Programs in Multiple-Objective Network Programming," INFORMS Journal on Computing, INFORMS, vol. 17(4), pages 422-437, November.
    14. Wilhelm, Wilbert E. & Xu, Kaihong, 2002. "Prescribing product upgrades, prices and production levels over time in a stochastic environment," European Journal of Operational Research, Elsevier, vol. 138(3), pages 601-621, May.
    15. Vicens, E. & Alemany, M. E. & Andres, C. & Guarch, J. J., 2001. "A design and application methodology for hierarchical production planning decision support systems in an enterprise integration context," International Journal of Production Economics, Elsevier, vol. 74(1-3), pages 5-20, December.
    16. Gerald G. Brown & W. Matthew Carlyle, 2020. "Solving the Nearly Symmetric All-Pairs Shortest-Path Problem," INFORMS Journal on Computing, INFORMS, vol. 32(2), pages 279-288, April.
    17. James H. Merrick & John E. T. Bistline & Geoffrey J. Blanford, 2021. "On representation of energy storage in electricity planning models," Papers 2105.03707, arXiv.org, revised May 2021.
    18. Kenneth Carling & Mengjie Han & Johan Håkansson, 2012. "Does Euclidean distance work well when the p-median model is applied in rural areas?," Annals of Operations Research, Springer, vol. 201(1), pages 83-97, December.
    19. Balaji Gopalakrishnan & Seunghyun Kong & Earl Barnes & Ellis Johnson & Joel Sokol, 2011. "A least-squares minimum-cost network flow algorithm," Annals of Operations Research, Springer, vol. 186(1), pages 119-140, June.
    20. Festa, P. & Guerriero, F. & Laganà, D. & Musmanno, R., 2013. "Solving the shortest path tour problem," European Journal of Operational Research, Elsevier, vol. 230(3), pages 464-474.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:146:y:2006:i:1:p:119-134:10.1007/s10479-006-0051-6. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.