IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v75y2024i5p896-906.html
   My bibliography  Save this article

Multi-objective optimization of the auto-carrier loading and routing problem in an automotive logistics company

Author

Listed:
  • Biao Yuan
  • Yuwei Lu
  • Kangzhou Wang
  • Xiaoshuai Peng

Abstract

This paper presents a real-world auto-carrier loading and routing problem encountered by an automotive logistics company in China. The problem requires determining a set of routes for auto-carriers to transport vehicles from warehouses to dealers subject to several loading and routing constraints. Four objectives are considered, including the maximization of the number of loaded urgent vehicles and the number of loaded vehicles, and the minimization of the number of visits to dealers and travel distance. To solve such a multi-objective problem, we develop a two-stage iterated local search heuristic with the lexicographic optimization principle. Expressly, we assume that all vehicles are stored in one warehouse and solve the resulting problem as the first stage. Then the best-found solution is improved by considering the multiple warehouse constraints in the second stage. The effectiveness of the proposed heuristic is validated by comparing it with a commercial solver and the company’s approach. Moreover, computational results provide managerial insights for decision-makers when considering the objectives and their priorities in different scenarios.

Suggested Citation

  • Biao Yuan & Yuwei Lu & Kangzhou Wang & Xiaoshuai Peng, 2024. "Multi-objective optimization of the auto-carrier loading and routing problem in an automotive logistics company," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 75(5), pages 896-906, May.
    • Handle: RePEc:taf:tjorxx:v:75:y:2024:i:5:p:896-906
    DOI: 10.1080/01605682.2023.2218882
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01605682.2023.2218882
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/01605682.2023.2218882?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.

    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:taf:tjorxx:v:75:y:2024:i:5:p:896-906. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tjor .

    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.