IDEAS home Printed from https://ideas.repec.org/a/wsi/apjorx/v34y2017i06ns0217595917500336.html
   My bibliography  Save this article

A Combined Matheuristic for the Piecewise Linear Multicommodity Network Flow Problem

Author

Listed:
  • Naoto Katayama

    (Faculty of Distribution and Logistics Systems, Ryutsu Keizai University, Ibaraki, Japan)

Abstract

Multicommodity network problems appear in numerous applications, such as telecommunications, logistics, transportation, distribution and production planning networks. The piecewise linear multicommodity network flow problem is a multicommodity network flow problem with piecewise linear costs corresponding to multiple resources, such as communication lines, vehicles and production lines. In the present paper, for the piecewise linear multicommodity network continuous flow problem, we present a path-based formulation and an arc-based formulation, and develop a combined matheuristic approach, which combines capacity scaling, a column and row generation technique, restricted branch-and-bound and a local branch method.

Suggested Citation

  • Naoto Katayama, 2017. "A Combined Matheuristic for the Piecewise Linear Multicommodity Network Flow Problem," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 34(06), pages 1-24, December.
    • Handle: RePEc:wsi:apjorx:v:34:y:2017:i:06:n:s0217595917500336
    DOI: 10.1142/S0217595917500336
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595917500336
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595917500336?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. 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. 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.
    3. 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.
    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. Wang, Danni & Xiao, Fan & Zhou, Lei & Liang, Zhe, 2020. "Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation," European Journal of Operational Research, Elsevier, vol. 286(2), pages 547-563.

    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. Bernard Gendron & Luis Gouveia, 2017. "Reformulations by Discretization for Piecewise Linear Integer Multicommodity Network Flow Problems," Transportation Science, INFORMS, vol. 51(2), pages 629-649, May.
    2. Fortz, Bernard & Gouveia, Luís & Joyce-Moniz, Martim, 2017. "Models for the piecewise linear unsplittable multicommodity flow problems," European Journal of Operational Research, Elsevier, vol. 261(1), pages 30-42.
    3. Pan, Shenle & Ballot, Eric & Fontane, Frédéric, 2013. "The reduction of greenhouse gas emissions from freight transport by pooling supply chains," International Journal of Production Economics, Elsevier, vol. 143(1), pages 86-94.
    4. Hu, Qian & Lim, Andrew & Zhu, Wenbin, 2015. "The two-dimensional vector packing problem with piecewise linear cost function," Omega, Elsevier, vol. 50(C), pages 43-53.
    5. 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.
    6. Jose L. Andrade-Pineda & David Canca & Pedro L. Gonzalez-R, 2017. "On modelling non-linear quantity discounts in a supplier selection problem by mixed linear integer optimization," Annals of Operations Research, Springer, vol. 258(2), pages 301-346, November.
    7. 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.
    8. Nowak, Maciek & Hewitt, Mike & Bachour, Hussam, 2019. "Mileage bands in freight transportation," European Journal of Operational Research, Elsevier, vol. 272(2), pages 549-564.
    9. Juan Pablo Vielma & Shabbir Ahmed & George Nemhauser, 2010. "Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions," Operations Research, INFORMS, vol. 58(2), pages 303-315, April.
    10. Ya Ping Fang & Kaiwen Meng & Xiao Qi Yang, 2012. "Piecewise Linear Multicriteria Programs: The Continuous Case and Its Discontinuous Generalization," Operations Research, INFORMS, vol. 60(2), pages 398-409, April.
    11. 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.
    12. Andrew P. Armacost & Cynthia Barnhart & Keith A. Ware & Alysia M. Wilson, 2004. "UPS Optimizes Its Air Network," Interfaces, INFORMS, vol. 34(1), pages 15-25, February.
    13. 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.
    14. Hadas, Yuval & Laor, Amir, 2013. "Network design model with evacuation constraints," Transportation Research Part A: Policy and Practice, Elsevier, vol. 47(C), pages 1-9.
    15. K. Ramacandra Rao & Subhro Mitra & Joseph Szmerekovsky, 2021. "Bus Transit Network Structure Selection With Multiple Objectives," International Journal of Operations Research and Information Systems (IJORIS), IGI Global, vol. 12(4), pages 1-13, October.
    16. Christensen, Tue R.L. & Labbé, Martine, 2015. "A branch-cut-and-price algorithm for the piecewise linear transportation problem," European Journal of Operational Research, Elsevier, vol. 245(3), pages 645-655.
    17. Lingxun Kong & Christos T. Maravelias, 2020. "On the Derivation of Continuous Piecewise Linear Approximating Functions," INFORMS Journal on Computing, INFORMS, vol. 32(3), pages 531-546, July.
    18. Bell, Michael G.H. & Pan, Jing-Jing & Teye, Collins & Cheung, Kam-Fung & Perera, Supun, 2020. "An entropy maximizing approach to the ferry network design problem," Transportation Research Part B: Methodological, Elsevier, vol. 132(C), pages 15-28.
    19. Linos F. Frantzeskakis & Hanan Luss, 1999. "The network redesign problem for access telecommunications networks," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(5), pages 487-506, August.
    20. Anne Lange & Werner Delfmann, 2017. "Network concentration indices for less-than-truckload transportation," Transportation, Springer, vol. 44(6), pages 1475-1497, November.

    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:wsi:apjorx:v:34:y:2017:i:06:n:s0217595917500336. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/apjor/apjor.shtml .

    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.