IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v46y1998i2p231-246.html
   My bibliography  Save this article

A Scaling Algorithm for Multicommodity Flow Problems

Author

Listed:
  • Rina R. Schneur

    (PTCG, Inc., Burlington, Massachusetts)

  • James B. Orlin

    (Massachusetts Institute of Technology, Cambridge, Massachusetts)

Abstract

We present a penalty-based algorithm that solves the multicommodity flow problem as a sequence of a finite number of scaling phases. The basis of the algorithm is simple and consists of iteratively detecting and sending flow around negative cost cycles. Two parameters control the algorithm's behavior: the penalty parameter and the scaling parameter. In the ε-scaling phase, where ε is a function of the penalty and scaling parameters, the algorithm determines an ε-optimal solution; a solution in which complementary slackness conditions are satisfied to within ε. We analyze the performance of the algorithm from both the theoretical and practical perspectives. The computational results support the theoretical behavior of the algorithm. They also demonstrate the efficiency of the algorithm for solving problem instances of different structure and size.

Suggested Citation

  • Rina R. Schneur & James B. Orlin, 1998. "A Scaling Algorithm for Multicommodity Flow Problems," Operations Research, INFORMS, vol. 46(2), pages 231-246, April.
    • Handle: RePEc:inm:oropre:v:46:y:1998:i:2:p:231-246
    DOI: 10.1287/opre.46.2.231
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.46.2.231
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.46.2.231?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. Jeff L. Kennington, 1978. "A Survey of Linear Cost Multicommodity Network Flows," Operations Research, INFORMS, vol. 26(2), pages 209-236, April.
    2. Cynthia Barnhart & Yosef Sheffi, 1993. "A Network-Based Primal-Dual Heuristic for the Solution of Multicommodity Network Flow Problems," Transportation Science, INFORMS, vol. 27(2), pages 102-117, May.
    3. A. Ali & R. Helgason & J. Kennington & H. Lall, 1980. "Technical Note—Computational Comparison among Three Multicommodity Network Flow Algorithms," Operations Research, INFORMS, vol. 28(4), pages 995-1000, August.
    4. Judith M. Farvolden & Warren B. Powell & Irvin J. Lustig, 1993. "A Primal Partitioning Solution for the Arc-Chain Formulation of a Multicommodity Network Flow Problem," Operations Research, INFORMS, vol. 41(4), pages 669-693, August.
    5. Cynthia Barnhart, 1993. "Dual‐ascent methods for large‐scale multicommodity flow problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 40(3), pages 305-324, April.
    6. Bertsimas, Dimitris & Orlin, James B., 1953-., 1991. "A technique for speeding up the solution of the Lagrangean dual," Working papers 3278-91., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    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. Cohn, Amy & Davey, Melinda & Schkade, Lisa & Siegel, Amanda & Wong, Caris, 2008. "Network design and flow problems with cross-arc costs," European Journal of Operational Research, Elsevier, vol. 189(3), pages 890-901, September.
    2. Bar-Gera, Hillel, 2010. "Traffic assignment by paired alternative segments," Transportation Research Part B: Methodological, Elsevier, vol. 44(8-9), pages 1022-1046, September.
    3. Hong Zheng, 2015. "Adaptation of Network Simplex for the Traffic Assignment Problem," Transportation Science, INFORMS, vol. 49(3), pages 543-558, August.
    4. Khodakaram Salimifard & Sara Bigharaz, 2022. "The multicommodity network flow problem: state of the art classification, applications, and solution methods," Operational Research, Springer, vol. 22(1), pages 1-47, March.
    5. Dial, Robert B., 2000. "Minimal-revenue congestion pricing Part II: An efficient algorithm for the general case," Transportation Research Part B: Methodological, Elsevier, vol. 34(8), pages 645-665, November.

    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. Garg, Manish & Smith, J. Cole, 2008. "Models and algorithms for the design of survivable multicommodity flow networks with general failure scenarios," Omega, Elsevier, vol. 36(6), pages 1057-1071, December.
    2. 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.
    3. Kaj Holmberg & Di Yuan, 2003. "A Multicommodity Network-Flow Problem with Side Constraints on Paths Solved by Column Generation," INFORMS Journal on Computing, INFORMS, vol. 15(1), pages 42-57, February.
    4. Antonio Frangioni & Giorgio Gallo, 1999. "A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems," INFORMS Journal on Computing, INFORMS, vol. 11(4), pages 370-393, November.
    5. Rémy Dupas & Eiichi Taniguchi & Jean-Christophe Deschamps & Ali G. Qureshi, 2020. "A Multi-commodity Network Flow Model for Sustainable Performance Evaluation in City Logistics: Application to the Distribution of Multi-tenant Buildings in Tokyo," Sustainability, MDPI, vol. 12(6), pages 1-18, March.
    6. Hongbin Liu & Guopeng Song & Tianyu Liu & Bo Guo, 2022. "Multitask Emergency Logistics Planning under Multimodal Transportation," Mathematics, MDPI, vol. 10(19), pages 1-25, October.
    7. Pengfei Zhang & Neng Fan, 2017. "Analysis of budget for interdiction on multicommodity network flows," Journal of Global Optimization, Springer, vol. 67(3), pages 495-525, March.
    8. A. Ouorou & P. Mahey & J.-Ph. Vial, 2000. "A Survey of Algorithms for Convex Multicommodity Flow Problems," Management Science, INFORMS, vol. 46(1), pages 126-147, January.
    9. Richard D. McBride, 1998. "Advances in Solving the Multicommodity-Flow Problem," Interfaces, INFORMS, vol. 28(2), pages 32-41, April.
    10. Raymond K. Cheung & B. Muralidharan, 2000. "Dynamic Routing for Priority Shipments in LTL Service Networks," Transportation Science, INFORMS, vol. 34(1), pages 86-98, February.
    11. Zhang, M. & Pel, A.J., 2016. "Synchromodal hinterland freight transport: Model study for the port of Rotterdam," Journal of Transport Geography, Elsevier, vol. 52(C), pages 1-10.
    12. Bennett, Derek P. & Yano, Candace A., 2004. "A decomposition approach for an equipment selection and multiple product routing problem incorporating environmental factors," European Journal of Operational Research, Elsevier, vol. 156(3), pages 643-664, August.
    13. Sarah Root & Amy Cohn, 2008. "A novel modeling approach for express package carrier planning," Naval Research Logistics (NRL), John Wiley & Sons, vol. 55(7), pages 670-683, October.
    14. Xin Wang & Teodor Gabriel Crainic & Stein W. Wallace, 2019. "Stochastic Network Design for Planning Scheduled Transportation Services: The Value of Deterministic Solutions," INFORMS Journal on Computing, INFORMS, vol. 31(1), pages 153-170, February.
    15. Kraft, Edwin R. & Srikar, Bellur N. & Phillips, Robert L., 2000. "Revenue Management in Railroad Applications," Journal of the Transportation Research Forum, Transportation Research Forum, vol. 39(1).
    16. P. Chardaire & G. P. McKeown & S. A. Verity-Harrison & S. B. Richardson, 2005. "Solving a Time-Space Network Formulation for the Convoy Movement Problem," Operations Research, INFORMS, vol. 53(2), pages 219-230, April.
    17. P. Chardaire & A. Lisser, 2002. "Simplex and Interior Point Specialized Algorithms for Solving Nonoriented Multicommodity Flow Problems," Operations Research, INFORMS, vol. 50(2), pages 260-276, April.
    18. Leo Liberti, 2015. "Optimization and sustainable development," Computational Management Science, Springer, vol. 12(3), pages 371-395, July.
    19. Naga V. C. Gudapati & Enrico Malaguti & Michele Monaci, 2022. "Network Design with Service Requirements: Scaling-up the Size of Solvable Problems," INFORMS Journal on Computing, INFORMS, vol. 34(5), pages 2571-2582, September.
    20. Barnett, Doug & Binkley, James K. & McCarl, Bruce A., 1984. "Port Elevator Capacity And National And World Grain Shipments," Western Journal of Agricultural Economics, Western Agricultural Economics Association, vol. 9(1), pages 1-13, July.

    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:inm:oropre:v:46:y:1998:i:2:p:231-246. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.