IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v315y2024i3p1167-1181.html
   My bibliography  Save this article

How to load your auto carrier. A hybrid packing approach for the auto-carrier loading problem

Author

Listed:
  • Jäck, Christian
  • Gönsch, Jochen

Abstract

The distribution of new vehicles is a critical cost factor for automotive original equipment manufacturers (OEMs). While trains are the ideal mode for overland transport, OEMs often opt for road transport via auto carriers due to flexibility reasons or unavailability of rail networks. Auto carriers are specialized trucks equipped with flexible loading platforms. Finding the optimal configuration of platforms can be a difficult task due to passenger vehicles varying in size, shape, and weight. This problem is known as the auto-carrier loading problem (ACLP). The current literature deals with the ACLP on a strategic level with the goal to maximize transport capacities. However, it neglects the resulting increase in operational complexity.

Suggested Citation

  • Jäck, Christian & Gönsch, Jochen, 2024. "How to load your auto carrier. A hybrid packing approach for the auto-carrier loading problem," European Journal of Operational Research, Elsevier, vol. 315(3), pages 1167-1181.
    • Handle: RePEc:eee:ejores:v:315:y:2024:i:3:p:1167-1181
    DOI: 10.1016/j.ejor.2024.01.001
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221724000018
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2024.01.001?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. Zhi-Hua Hu & Yingxue Zhao & Sha Tao & Zhao-Han Sheng, 2015. "Finished-vehicle transporter routing problem solved by loading pattern discovery," Annals of Operations Research, Springer, vol. 234(1), pages 37-56, November.
    2. Wascher, Gerhard & Hau[ss]ner, Heike & Schumann, Holger, 2007. "An improved typology of cutting and packing problems," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1109-1130, December.
    3. Martinez-Sykora, A. & Alvarez-Valdes, R. & Bennell, J.A. & Ruiz, R. & Tamarit, J.M., 2017. "Matheuristics for the irregular bin packing problem with free rotations," European Journal of Operational Research, Elsevier, vol. 258(2), pages 440-455.
    4. Leao, Aline A.S. & Toledo, Franklina M.B. & Oliveira, José Fernando & Carravilla, Maria Antónia & Alvarez-Valdés, Ramón, 2020. "Irregular packing problems: A review of mathematical models," European Journal of Operational Research, Elsevier, vol. 282(3), pages 803-822.
    5. Sun, Yanshuo & Kirtonia, Sajeeb & Chen, Zhi-Long, 2021. "A survey of finished vehicle distribution and related problems from an optimization perspective," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 149(C).
    6. R. Tadei & G. Perboli & F. Della Croce, 2002. "A Heuristic Algorithm for the Auto-Carrier Transportation Problem," Transportation Science, INFORMS, vol. 36(1), pages 55-62, February.
    7. Bennell, Julia A. & Oliveira, Jose F., 2008. "The geometry of nesting problems: A tutorial," European Journal of Operational Research, Elsevier, vol. 184(2), pages 397-415, January.
    8. Wang, Yu & Chen, Feng & Chen, Zhi-Long, 2018. "Pickup and delivery of automobiles from warehouses to dealers," Transportation Research Part B: Methodological, Elsevier, vol. 117(PA), pages 412-430.
    9. Burke, E.K. & Hellier, R.S.R. & Kendall, G. & Whitwell, G., 2007. "Complete and robust no-fit polygon generation for the irregular stock cutting problem," European Journal of Operational Research, Elsevier, vol. 179(1), pages 27-49, May.
    10. Gerald Y. Agbegha & Ronald H. Ballou & Kamlesh Mathur, 1998. "Optimizing Auto-Carrier Loading," Transportation Science, INFORMS, vol. 32(2), pages 174-188, May.
    Full references (including those not matched with items on IDEAS)

    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. Sun, Yanshuo & Kirtonia, Sajeeb & Chen, Zhi-Long, 2021. "A survey of finished vehicle distribution and related problems from an optimization perspective," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 149(C).
    2. Leao, Aline A.S. & Toledo, Franklina M.B. & Oliveira, José Fernando & Carravilla, Maria Antónia & Alvarez-Valdés, Ramón, 2020. "Irregular packing problems: A review of mathematical models," European Journal of Operational Research, Elsevier, vol. 282(3), pages 803-822.
    3. Chehrazad, Sahar & Roose, Dirk & Wauters, Tony, 2022. "A fast and scalable bottom-left-fill algorithm to solve nesting problems using a semi-discrete representation," European Journal of Operational Research, Elsevier, vol. 300(3), pages 809-826.
    4. Bonassa, Antonio Carlos & Cunha, Claudio Barbieri da & Isler, Cassiano Augusto, 2023. "A multi-start local search heuristic for the multi-period auto-carrier loading and transportation problem in Brazil," European Journal of Operational Research, Elsevier, vol. 307(1), pages 193-211.
    5. Igor Kierkosz & Maciej Łuczak, 2019. "A one-pass heuristic for nesting problems," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 29(1), pages 37-60.
    6. Chen, Feng & Wang, Yu, 2020. "Downward compatible loading optimization with inter-set cost in automobile outbound logistics," European Journal of Operational Research, Elsevier, vol. 287(1), pages 106-118.
    7. Gahm, Christian & Uzunoglu, Aykut & Wahl, Stefan & Ganschinietz, Chantal & Tuma, Axel, 2022. "Applying machine learning for the anticipation of complex nesting solutions in hierarchical production planning," European Journal of Operational Research, Elsevier, vol. 296(3), pages 819-836.
    8. Qiang Luo & Yunqing Rao, 2022. "Improved Sliding Algorithm for Generating No-Fit Polygon in the 2D Irregular Packing Problem," Mathematics, MDPI, vol. 10(16), pages 1-18, August.
    9. J A Bennell & J F Oliveira, 2009. "A tutorial in irregular shape packing problems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 93-105, May.
    10. Frank J. Kampas & János D. Pintér & Ignacio Castillo, 2023. "Model Development and Solver Demonstrations Using Randomized Test Problems," SN Operations Research Forum, Springer, vol. 4(1), pages 1-15, March.
    11. Alvarez-Valdes, R. & Martinez, A. & Tamarit, J.M., 2013. "A branch & bound algorithm for cutting and packing irregularly shaped pieces," International Journal of Production Economics, Elsevier, vol. 145(2), pages 463-477.
    12. Kimms, Alf & Király, Hédi, 2023. "An extended model formulation for the two-dimensional irregular strip packing problem considering general industry-relevant aspects," European Journal of Operational Research, Elsevier, vol. 306(3), pages 1202-1218.
    13. Yainier Labrada-Nueva & Martin H. Cruz-Rosales & Juan Manuel Rendón-Mancha & Rafael Rivera-López & Marta Lilia Eraña-Díaz & Marco Antonio Cruz-Chávez, 2021. "Overlap Detection in 2D Amorphous Shapes for Paper Optimization in Digital Printing Presses," Mathematics, MDPI, vol. 9(9), pages 1-22, May.
    14. Lastra-Díaz, Juan J. & Ortuño, M. Teresa, 2024. "Mixed-integer programming models for irregular strip packing based on vertical slices and feasibility cuts," European Journal of Operational Research, Elsevier, vol. 313(1), pages 69-91.
    15. Hagspihl, Thomas & Kolisch, Rainer & Fontaine, Pirmin & Schiffels, Sebastian, 2024. "Apron layout planning–Optimal positioning of aircraft stands," Transportation Research Part B: Methodological, Elsevier, vol. 179(C).
    16. Christian Billing & Florian Jaehn & Thomas Wensing, 2018. "A multiperiod auto-carrier transportation problem with probabilistic future demands," Journal of Business Economics, Springer, vol. 88(7), pages 1009-1028, September.
    17. Iori, Manuel & de Lima, Vinícius L. & Martello, Silvano & Miyazawa, Flávio K. & Monaci, Michele, 2021. "Exact solution techniques for two-dimensional cutting and packing," European Journal of Operational Research, Elsevier, vol. 289(2), pages 399-415.
    18. Eunice López-Camacho & Gabriela Ochoa & Hugo Terashima-Marín & Edmund Burke, 2013. "An effective heuristic for the two-dimensional irregular bin packing problem," Annals of Operations Research, Springer, vol. 206(1), pages 241-264, July.
    19. Umetani, Shunji & Murakami, Shohei, 2022. "Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes," European Journal of Operational Research, Elsevier, vol. 303(3), pages 1009-1026.
    20. Josef Kallrath & Tatiana Romanova & Alexander Pankratov & Igor Litvinchev & Luis Infante, 2023. "Packing convex polygons in minimum-perimeter convex hulls," Journal of Global Optimization, Springer, vol. 85(1), pages 39-59, January.

    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:eee:ejores:v:315:y:2024:i:3:p:1167-1181. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.