IDEAS home Printed from https://ideas.repec.org/a/taf/marpmg/v51y2024i3p392-419.html
   My bibliography  Save this article

A bi-objective programming model for loading finished-vehicles in containers with adjustable brackets

Author

Listed:
  • Zhijia Tan
  • Shuai Shao
  • Zhixin Wang
  • Hua Wang
  • Linghui Han

Abstract

The containerized transportation mode has attracted more attention from many finished-vehicle (FV) logistics companies and ocean carriers which can provide door-to-door service and organize the multi-model transportation. This paper considers the FV loading problem for a carrier who uses containerized transportation mode. To increase the loading factor of containers and guarantee the safety of vehicles from damage, an adjustable bracket is introduced to place two-layer vehicles by tilting the upper pallet. A bi-objective programming problem is proposed in the sense of maximizing the safety margins of vehicles by setting the configuration of an adjustable bracket and the locations of the vehicles on the pallets. For any given combination of two vehicle types, we proved that the Pareto frontier of the bi-objective programming problem is a line and the Pareto optimal slope of the upper pallet can be determined by a maximization problem. With the Pareto frontier, the general FV loading problem with multiple vehicle types can be modeled as an integer programming problem and calculated by traditional programming algorithms. Areal loading task for the COSCO was adopted to depict our model and method.

Suggested Citation

  • Zhijia Tan & Shuai Shao & Zhixin Wang & Hua Wang & Linghui Han, 2024. "A bi-objective programming model for loading finished-vehicles in containers with adjustable brackets," Maritime Policy & Management, Taylor & Francis Journals, vol. 51(3), pages 392-419, April.
    • Handle: RePEc:taf:marpmg:v:51:y:2024:i:3:p:392-419
    DOI: 10.1080/03088839.2021.1958020
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03088839.2021.1958020
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/03088839.2021.1958020?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:marpmg:v:51:y:2024:i:3:p:392-419. 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/TMPM20 .

    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.