IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v37y1990i2p327-340.html
   My bibliography  Save this article

A relaxation/decomposition algorithm for the fixed charged network problem

Author

Listed:
  • Bala Shetty

Abstract

This article makes use of relaxation in conjunction with decomposition for the solution of a fixed charge network problem. The solution technique exploits the underlying network structure. The solution approach is via the solution of a series of problem relaxation and bound adjustments. Upper bounds on the optimal objective value are obtained by use of a decomposition of the problem based on parametric changes in variable upper bounds. The Lagrangian dual provides a lower bound on the optimal objective as well as an initial allocation for the upper bounding procedure. The algorithm has been tested on 112 randomly generated problems with up to 1500 nodes, 6600 arcs, and 3000 fixed charge arcs. These test results demonstrate that even for relatively large problems, when certain convergence requirements are relaxed, our algorithm can be very effective in generating near‐optimal solutions. We obtain integer solutions that were, on the average, well within 2% of the optimum in approximately 1% of the time required by XMP to solve the continuous relaxation.

Suggested Citation

  • Bala Shetty, 1990. "A relaxation/decomposition algorithm for the fixed charged network problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(2), pages 327-340, April.
    • Handle: RePEc:wly:navres:v:37:y:1990:i:2:p:327-340
    DOI: 10.1002/1520-6750(199004)37:23.0.CO;2-U
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/1520-6750(199004)37:23.0.CO;2-U
    Download Restriction: no
    File URL: https://libkey.io/10.1002/1520-6750(199004)37:23.0.CO;2-U?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
    ---><---

    References listed on IDEAS

    as
    1. L. Cooper & C. Drebes, 1967. "An approximate solution method for the fixed charge problem," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 14(1), pages 101-113.
    2. Marshall L. Fisher, 1981. "The Lagrangian Relaxation Method for Solving Integer Programming Problems," Management Science, INFORMS, vol. 27(1), pages 1-18, January.
    3. Richard S. Barr & Fred Glover & Darwin Klingman, 1981. "A New Optimization Method for Large Scale Fixed Charge Transportation Problems," Operations Research, INFORMS, vol. 29(3), pages 448-463, June.
    4. Ali, A. Iqbal & Allen, Ellen P. & Barr, Richard S. & Kennington, Jeffery L., 1986. "Reoptimization procedures for bounded variable primal simplex network algorithms," European Journal of Operational Research, Elsevier, vol. 23(2), pages 256-263, February.
    5. Michel L. Balinski, 1961. "Fixed‐cost transportation problems," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 8(1), pages 41-54, March.
    6. R. L. Rardin & V. E. Unger, 1976. "Solving fixed charge network problems with group theory‐based penalties," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 23(1), pages 67-84, March.
    7. A. M. Geoffrion, 1969. "An Improved Implicit Enumeration Approach for Integer Programming," Operations Research, INFORMS, vol. 17(3), pages 437-454, June.
    8. David I. Steinberg, 1970. "The fixed charge problem," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 17(2), pages 217-235, June.
    9. Ali, Agha Iqbal & Kennington, Jeff & Shetty, Bala, 1988. "The equal flow problem," European Journal of Operational Research, Elsevier, vol. 36(1), pages 107-115, July.
    10. David R. Denzler, 1969. "An approximative algorithm for the fixed charge problem," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 16(3), pages 411-416, September.
    11. Egon Balas, 1965. "An Additive Algorithm for Solving Linear Programs with Zero-One Variables," Operations Research, INFORMS, vol. 13(4), pages 517-546, 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. Erika Buson & Roberto Roberti & Paolo Toth, 2014. "A Reduced-Cost Iterated Local Search Heuristic for the Fixed-Charge Transportation Problem," Operations Research, INFORMS, vol. 62(5), pages 1095-1106, October.

    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. Alexey Sorokin & Vladimir Boginski & Artyom Nahapetyan & Panos M. Pardalos, 2013. "Computational risk management techniques for fixed charge network flow problems with uncertain arc failures," Journal of Combinatorial Optimization, Springer, vol. 25(1), pages 99-122, January.
    2. Gurwinder Singh & Amarinder Singh, 2021. "Solving fixed-charge transportation problem using a modified particle swarm optimization algorithm," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 12(6), pages 1073-1086, December.
    3. Yixin Zhao & Torbjörn Larsson & Elina Rönnberg & Panos M. Pardalos, 2018. "The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation," Journal of Global Optimization, Springer, vol. 72(3), pages 517-538, November.
    4. 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.
    5. Mazzola, Joseph B. & Neebe, Alan W., 1999. "Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type," European Journal of Operational Research, Elsevier, vol. 115(2), pages 285-299, June.
    6. Gaudioso, Manlio & Monaco, Maria Flavia & Sammarra, Marcello, 2021. "A Lagrangian heuristics for the truck scheduling problem in multi-door, multi-product Cross-Docking with constant processing time," Omega, Elsevier, vol. 101(C).
    7. Manfred Padberg, 2005. "Classical Cuts for Mixed-Integer Programming and Branch-and-Cut," Annals of Operations Research, Springer, vol. 139(1), pages 321-352, October.
    8. Thomas L. Magnanti, 2021. "Optimization: From Its Inception," Management Science, INFORMS, vol. 67(9), pages 5349-5363, September.
    9. Hasan Pirkul, 1987. "A heuristic solution procedure for the multiconstraint zero‐one knapsack problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 34(2), pages 161-172, April.
    10. Monique Guignard & Ellis Johnson & Kurt Spielberg, 2005. "Logical Processing for Integer Programming," Annals of Operations Research, Springer, vol. 140(1), pages 263-304, November.
    11. Kurt Spielberg, 2007. "IP over 40+ Years at IBM Scientific Centers and Marketing," Annals of Operations Research, Springer, vol. 149(1), pages 195-208, February.
    12. Jiang, Bo & Tzavellas, Hector, 2023. "Optimal liquidity allocation in an equity network," International Review of Economics & Finance, Elsevier, vol. 85(C), pages 286-294.
    13. Sanjiv Sarin & Mark H. Karwan & Ronald L. Rardin, 1987. "A new surrogate dual multiplier search procedure," Naval Research Logistics (NRL), John Wiley & Sons, vol. 34(3), pages 431-450, June.
    14. Kraft, Edwin R., 2002. "Scheduling railway freight delivery appointments using a bid price approach," Transportation Research Part A: Policy and Practice, Elsevier, vol. 36(2), pages 145-165, February.
    15. Jesús Sáez Aguado, 2009. "Fixed Charge Transportation Problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems," Annals of Operations Research, Springer, vol. 172(1), pages 45-69, November.
    16. Jeffery L. Kennington & Charles D. Nicholson, 2010. "The Uncapacitated Time-Space Fixed-Charge Network Flow Problem: An Empirical Investigation of Procedures for Arc Capacity Assignment," INFORMS Journal on Computing, INFORMS, vol. 22(2), pages 326-337, May.
    17. Wolosewicz, Cathy & Dauzère-Pérès, Stéphane & Aggoune, Riad, 2015. "A Lagrangian heuristic for an integrated lot-sizing and fixed scheduling problem," European Journal of Operational Research, Elsevier, vol. 244(1), pages 3-12.
    18. M Diaby & A L Nsakanda, 2006. "Large-scale capacitated part-routing in the presence of process and routing flexibilities and setup costs," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(9), pages 1100-1112, September.
    19. Ogbe, Emmanuel & Li, Xiang, 2017. "A new cross decomposition method for stochastic mixed-integer linear programming," European Journal of Operational Research, Elsevier, vol. 256(2), pages 487-499.
    20. Mutsunori Yagiura & Toshihide Ibaraki & Fred Glover, 2004. "An Ejection Chain Approach for the Generalized Assignment Problem," INFORMS Journal on Computing, INFORMS, vol. 16(2), pages 133-151, May.

    More about this item

    Statistics

    Access and download statistics

    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:wly:navres:v:37:y:1990:i:2:p:327-340. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    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.