IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/830632.html
   My bibliography  Save this article

Optimization of Hybrid Hub-and-Spoke Network Operation for Less-Than-Truckload Freight Transportation considering Incremental Quantity Discount

Author

Listed:
  • Weiya Chen
  • Kaixian He
  • Xiaoping Fang

Abstract

This paper presents a mixed integer linear programming model (MILP) for optimizing the hybrid hub-and-spoke network operation for a less-than-truckload transportation service. The model aims to minimize the total operation costs (transportation cost and transfer cost), given the determined demand matrix, truck load capacity, and uncapacitated road transportation. The model also incorporates an incremental quantity discount function to solve the reversal of the total cost and the total demand. The model is applied to a real case of a Chinese transportation company engaged in nationwide freight transportation. The numerical example shows that, with uncapacitated road transportation, the total costs and the total vehicle trips of the hybrid hub-and-spoke network operation are, respectively, 8.0% and 15.3% less than those of the pure hub-and-spoke network operation, and the assumed capacity constraints in an extension model result in more target costs on the hybrid hub-and-spoke network. The two models can be used to support the decision making in network operations by transportation and logistics companies.

Suggested Citation

  • Weiya Chen & Kaixian He & Xiaoping Fang, 2014. "Optimization of Hybrid Hub-and-Spoke Network Operation for Less-Than-Truckload Freight Transportation considering Incremental Quantity Discount," Mathematical Problems in Engineering, Hindawi, vol. 2014, pages 1-9, September.
    • Handle: RePEc:hin:jnlmpe:830632
    DOI: 10.1155/2014/830632
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2014/830632.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/MPE/2014/830632.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2014/830632?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
    ---><---

    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:hin:jnlmpe:830632. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    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.