IDEAS home Printed from https://ideas.repec.org/h/spr/lnopch/978-981-97-4045-1_33.html
   My bibliography  Save this book chapter

Bi-objective Hub Location-Allocation Problem with Time Window Constraint

In: Liss 2023

Author

Listed:
  • Yihuan Yang

    (Beijing Jiaotong University)

  • Xiaochun Lu

    (Beijing Jiaotong University)

Abstract

This paper proposed a bi-objective programming model to address the hub location-allocation problem international logistics enterprises faced. The model considers high time requirement of express export business and includes a time window constraint that considers the sum of transport vehicle departure time, vehicle driving time, sorting time of service center, and the latest arrival time of vehicles at the port. The model aims to minimize the total transportation cost and construction costs while maximizing the service level. Firstly, to predict vehicle transportation costs, a binary regression equation was constructed using distance and volume as independent variables, based on the sklearn machine learning library. The resulting mixed integer programming model was then solved using the Gurobi solver. Using operational data from international logistics enterprises in Guangdong Province, two site selection schemes were obtained, prioritizing either total cost or service level. The results of the study indicate that the location scheme prioritizing total cost can effectively reduce costs, while the scheme prioritizing service level can ensure that the service level remains unaffected by the addition of new service centers.

Suggested Citation

  • Yihuan Yang & Xiaochun Lu, 2024. "Bi-objective Hub Location-Allocation Problem with Time Window Constraint," Lecture Notes in Operations Research, in: Daqing Gong & Yixuan Ma & Xiaowen Fu & Juliang Zhang & Xiaopu Shang (ed.), Liss 2023, pages 427-439, Springer.
    • Handle: RePEc:spr:lnopch:978-981-97-4045-1_33
    DOI: 10.1007/978-981-97-4045-1_33
    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:lnopch:978-981-97-4045-1_33. 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.