IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v27y1993i2p102-117.html
   My bibliography  Save this article

A Network-Based Primal-Dual Heuristic for the Solution of Multicommodity Network Flow Problems

Author

Listed:
  • Cynthia Barnhart

    (Massachusetts Institute of Technology, Cambridge, Massachusetts 02139)

  • Yosef Sheffi

    (Massachusetts Institute of Technology, Cambridge, Massachusetts 02139)

Abstract

In this paper, we present a primal-dual, heuristic solution approach for large-scale multicommodity network flow problems. The original problem is solved indirectly by repeatedly solving restated feasibility problems. Restrictions on problem size imposed by exact methods are overcome by solving the restated problems with a pure network-based heuristic procedure. To control the heuristic solution process, the network-based procedure is embedded within an iterative primal-dual framework. At each iteration, feasible dual solutions are generated, the dual objective function value strictly ascends, and primal solutions that are measurably closer to feasibility are determined. The algorithm terminates when the heuristic network-based procedure cannot determine an improved primal solution or when optimality is achieved. To demonstrate the effectiveness of the network-based solution strategy, a large-scale freight assignment problem encountered in the trucking industry is formulated as a multicommodity network flow problem. Two linear programming based, exact solution strategies (a primal-dual algorithm and a price-directive algorithm) are unable to achieve even an initial solution for this problem due to excessive memory requirements. The network-based heuristic, however, determines an optimal solution. We compare the performance of the new heuristic with that of the exact procedures using a set of smaller test problems. The effects of problem formulation and congestion are evaluated for each of the alternative solution strategies.

Suggested Citation

  • 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.
    • Handle: RePEc:inm:ortrsc:v:27:y:1993:i:2:p:102-117
    DOI: 10.1287/trsc.27.2.102
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.27.2.102
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.27.2.102?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
    ---><---

    Citations

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


    Cited by:

    1. 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.
    2. 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.
    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. 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.
    5. Hall, Randolph W., 1999. "Stochastic freight flow patterns: implications for fleet optimization," Transportation Research Part A: Policy and Practice, Elsevier, vol. 33(6), pages 449-465, August.
    6. 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.
    7. K L Poh & K W Choo & C G Wong, 2005. "A heuristic approach to the multi-period multi-commodity transportation problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(6), pages 708-718, June.
    8. Lin, Cheng-Chang, 2001. "The freight routing problem of time-definite freight delivery common carriers," Transportation Research Part B: Methodological, Elsevier, vol. 35(6), pages 525-547, July.
    9. 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.
    10. 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).
    11. Rina R. Schneur & James B. Orlin, 1998. "A Scaling Algorithm for Multicommodity Flow Problems," Operations Research, INFORMS, vol. 46(2), pages 231-246, April.
    12. Shaileshh Bojja Venkatakrishnan & Mohammad Alizadeh & Pramod Viswanath, 2018. "Costly circuits, submodular schedules and approximate Carathéodory Theorems," Queueing Systems: Theory and Applications, Springer, vol. 88(3), pages 311-347, April.
    13. Dong Liang & Wilbert E. Wilhelm, 2013. "Dual‐ascent and primal heuristics for production‐assembly‐distribution system design," Naval Research Logistics (NRL), John Wiley & Sons, vol. 60(1), pages 1-18, February.
    14. 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.

    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:inm:ortrsc:v:27:y:1993:i:2:p:102-117. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.