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

Models and Methods for Merge-in-Transit Operations

Author

Listed:
  • Keely L. Croxton

    (Fisher College of Business, The Ohio State University, Suite 518, Fisher Hall, 2100 Neil Avenue, Colombus, Ohio 43210-1144)

  • Bernard Gendron

    (Département d'informatique et de recherche opérationnelle, and Centre de recherche sur les transports, Université de Montréal, C.P. 6128, succ. Centre-ville, Montreal, Quebec, Canada H3C 3J7)

  • Thomas L. Magnanti

    (School of Engineering, and Sloan School of Management, Massachusetts Institute of Technology, Room 1-206, 77 Massachusetts Avenue, Cambridge, Massachusetts 02139-4307)

Abstract

We develop integer programming formulations and solution methods for addressing operational issues in merge-in-transit distribution systems. The models account for various complex problem features, including the integration of inventory and transportation decisions, the dynamic and multimodal components of the application, and the nonconvex piecewise linear structure of the cost functions. To accurately model the cost functions, we introduce disaggregation techniques that allow us to derive a hierarchy of linear programming relaxations. To solve these relaxations, we propose a cutting-plane procedure that combines constraint and variable generation with rounding and branch-and-bound heuristics. We demonstrate the effectiveness of this approach on a large set of test problems with instances derived from actual data from the computer industry that contain almost 500,000 integer variables.

Suggested Citation

  • Keely L. Croxton & Bernard Gendron & Thomas L. Magnanti, 2003. "Models and Methods for Merge-in-Transit Operations," Transportation Science, INFORMS, vol. 37(1), pages 1-22, February.
    • Handle: RePEc:inm:ortrsc:v:37:y:2003:i:1:p:1-22
    DOI: 10.1287/trsc.37.1.1.12822
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.37.1.1.12822
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.37.1.1.12822?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. Vidal, Carlos J. & Goetschalckx, Marc, 1997. "Strategic production-distribution models: A critical review with emphasis on global supply chain models," European Journal of Operational Research, Elsevier, vol. 98(1), pages 1-18, April.
    2. T. L. Magnanti & R. T. Wong, 1984. "Network Design and Transportation Planning: Models and Algorithms," Transportation Science, INFORMS, vol. 18(1), pages 1-55, February.
    3. Holmberg, Kaj & Ling, Jonas, 1997. "A Lagrangean heuristic for the facility location problem with staircase costs," European Journal of Operational Research, Elsevier, vol. 97(1), pages 63-74, February.
    4. Crainic, Teodor Gabriel & Laporte, Gilbert, 1997. "Planning models for freight transportation," European Journal of Operational Research, Elsevier, vol. 97(3), pages 409-438, March.
    5. Holmberg, Kaj, 1994. "Solving the staircase cost facility location problem with decomposition and piecewise linearization," European Journal of Operational Research, Elsevier, vol. 75(1), pages 41-61, May.
    6. Douglas A. Popken, 1994. "An Algorithm for the Multiattribute, Multicommodity Flow Problem with Freight Consolidation and Inventory Costs," Operations Research, INFORMS, vol. 42(2), pages 274-286, April.
    7. A. Balakrishnan & T. L. Magnanti & R. T. Wong, 1989. "A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design," Operations Research, INFORMS, vol. 37(5), pages 716-740, October.
    Full references (including those not matched with items on IDEAS)

    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. Keely L. Croxton & Bernard Gendron & Thomas L. Magnanti, 2007. "Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs," Operations Research, INFORMS, vol. 55(1), pages 146-157, February.
    2. Melkote, Sanjay & Daskin, Mark S., 2001. "Capacitated facility location/network design problems," European Journal of Operational Research, Elsevier, vol. 129(3), pages 481-495, March.
    3. Jansen, Benjamin & Swinkels, Pieter C. J. & Teeuwen, Geert J. A. & van Antwerpen de Fluiter, Babette & Fleuren, Hein A., 2004. "Operational planning of a large-scale multi-modal transportation system," European Journal of Operational Research, Elsevier, vol. 156(1), pages 41-53, July.
    4. Tue R. L. Christensen & Kim Allan Andersen & Andreas Klose, 2013. "Solving the Single-Sink, Fixed-Charge, Multiple-Choice Transportation Problem by Dynamic Programming," Transportation Science, INFORMS, vol. 47(3), pages 428-438, August.
    5. Kaj Holmberg & Johan Hellstrand, 1998. "Solving the Uncapacitated Network Design Problem by a Lagrangean Heuristic and Branch-and-Bound," Operations Research, INFORMS, vol. 46(2), pages 247-259, April.
    6. Gendron, Bernard, 2002. "A note on "a dual-ascent approach to the fixed-charge capacitated network design problem"," European Journal of Operational Research, Elsevier, vol. 138(3), pages 671-675, May.
    7. Bjorndal, M. H. & Caprara, A. & Cowling, P. I. & Della Croce, F. & Lourenco, H. & Malucelli, F. & Orman, A. J. & Pisinger, D. & Rego, C. & Salazar, J. J., 1995. "Some thoughts on combinatorial optimisation," European Journal of Operational Research, Elsevier, vol. 83(2), pages 253-270, June.
    8. Fragkos, Ioannis & Cordeau, Jean-François & Jans, Raf, 2021. "Decomposition methods for large-scale network expansion problems," Transportation Research Part B: Methodological, Elsevier, vol. 144(C), pages 60-80.
    9. Ping Josephine Xu & Russell Allgor & Stephen C. Graves, 2009. "Benefits of Reevaluating Real-Time Order Fulfillment Decisions," Manufacturing & Service Operations Management, INFORMS, vol. 11(2), pages 340-355, January.
    10. Anne Lange & Werner Delfmann, 2017. "Network concentration indices for less-than-truckload transportation," Transportation, Springer, vol. 44(6), pages 1475-1497, November.
    11. Wang, David Z.W. & Lo, Hong K., 2008. "Multi-fleet ferry service network design with passenger preferences for differential services," Transportation Research Part B: Methodological, Elsevier, vol. 42(9), pages 798-822, November.
    12. Cynthia Barnhart & Hong Jin & Pamela H. Vance, 2000. "Railroad Blocking: A Network Design Application," Operations Research, INFORMS, vol. 48(4), pages 603-614, August.
    13. Christensen, Tue Rauff Lind & Klose, Andreas, 2021. "A fast exact method for the capacitated facility location problem with differentiable convex production costs," European Journal of Operational Research, Elsevier, vol. 292(3), pages 855-868.
    14. Anantaram Balakrishnan & Gang Li & Prakash Mirchandani, 2017. "Optimal Network Design with End-to-End Service Requirements," Operations Research, INFORMS, vol. 65(3), pages 729-750, June.
    15. Tadashi Yamada & Bona Frazila Russ & Jun Castro & Eiichi Taniguchi, 2009. "Designing Multimodal Freight Transport Networks: A Heuristic Approach and Applications," Transportation Science, INFORMS, vol. 43(2), pages 129-143, May.
    16. Ahmad I. Jarrah & Ellis Johnson & Lucas C. Neubert, 2009. "Large-Scale, Less-than-Truckload Service Network Design," Operations Research, INFORMS, vol. 57(3), pages 609-625, June.
    17. Melkote, Sanjay & Daskin, Mark S., 2001. "An integrated model of facility location and transportation network design," Transportation Research Part A: Policy and Practice, Elsevier, vol. 35(6), pages 515-538, July.
    18. B Goldengorin & J Keane & V Kuzmenko & M K-S Tso, 2011. "Optimal supplier choice with discounting," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(4), pages 690-699, April.
    19. Keely L. Croxton & Bernard Gendron & Thomas L. Magnanti, 2003. "A Comparison of Mixed-Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems," Management Science, INFORMS, vol. 49(9), pages 1268-1273, September.
    20. M-G Yoon & J Current, 2008. "The hub location and network design problem with fixed and variable arc costs: formulation and dual-based solution heuristic," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(1), pages 80-89, January.

    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:37:y:2003:i:1:p:1-22. 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.