IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-981-33-4359-7_7.html
   My bibliography  Save this book chapter

Auto-carrier Transport Routing Problem with Loading Constraint

In: Liss 2020

Author

Listed:
  • Xiqing Yang

    (Beijing Jiaotong University)

  • Wenliang Bian

    (Beijing Jiaotong University)

  • Hanping Hou

    (Beijing Jiaotong University)

  • Xiying Yang

    (Beijing Jiaotong University)

Abstract

Vehicle logistics refers to the whole process of rapid delivery of vehicles distributed by logistics company according to customer orders. Auto-carriers are used as the transportation tool, which efficiency and loading rate directly determine the logistics cost. Compared with traditional vehicle routing problems, route planning of auto-carriers also needs to consider how to load the vehicles, which has higher requirements for the model formulation. In this paper we provide a three-dimensional loading constraint and build a multi-objective mixed integer programming model based on the minimum total cost, the minimum number of auto-carriers and the shortest total driving distance. We use Gurobi as a solver to pre-process multiple constraints and solve the model. The experimental results show that the model can find the optimal solution efficiently and the algorithm can give an accurate solution in a limited time, which indicates that the method designed in this paper is feasible and even optimal for certain problem scales.

Suggested Citation

  • Xiqing Yang & Wenliang Bian & Hanping Hou & Xiying Yang, 2021. "Auto-carrier Transport Routing Problem with Loading Constraint," Springer Books, in: Shifeng Liu & Gábor Bohács & Xianliang Shi & Xiaopu Shang & Anqiang Huang (ed.), Liss 2020, pages 91-105, Springer.
    • Handle: RePEc:spr:sprchp:978-981-33-4359-7_7
    DOI: 10.1007/978-981-33-4359-7_7
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:spr:sprchp:978-981-33-4359-7_7. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.