IDEAS home Printed from https://ideas.repec.org/a/spr/operea/v22y2022i5d10.1007_s12351-022-00737-7.html
   My bibliography  Save this article

A safety-driven truck loading problem

Author

Listed:
  • Konstantinos N. Androutsopoulos

    (Athens University of Economics and Business)

  • Eleni Karouti

    (Athens University of Economics and Business)

Abstract

This paper addresses a real-life multi-compartment tank-truck loading problem for fuel distribution. The proposed loading problem incorporates two safety considerations that enhance the balance of the load: i) the maximum axle weight restrictions, and ii) safety loading rules for mitigating the effects from en-route fuel oscillation. Given a route for delivering a set of orders for fuel, the proposed Truck Loading Problem aims to assign the orders to the compartments of a truck under the following load balance restrictions: i) the weight borne by each axle must not exceed certain limits at any stage of the distribution route, and ii) each compartment should be loaded either below 20% or over 80% of its capacity to mitigate fuel oscillation effects. A balanced loading of the orders at the depot does not guarantee that the load will be balanced in all subsequent segments of the delivery route. Therefore, both safety constraints must be checked in every route segment. Two MILP models are developed for the proposed loading problem covering the cases in which the compartments of the truck are equipped or not with flow meters. A major novel feature of the proposed work pertains to the development of a computational method for estimating the load weight distribution over each axle of a rigid truck with more than two axles. A series of computational experiments were performed for exploring the impact of both types of constraints on loading and route efficiency. A major finding is that using a marginal loading flexibility (i.e., deviation of the ordered quantity from the quantity delivered) diminishes any effect of the two constraints on loading efficiency.

Suggested Citation

  • Konstantinos N. Androutsopoulos & Eleni Karouti, 2022. "A safety-driven truck loading problem," Operational Research, Springer, vol. 22(5), pages 4931-4963, November.
  • Handle: RePEc:spr:operea:v:22:y:2022:i:5:d:10.1007_s12351-022-00737-7
    DOI: 10.1007/s12351-022-00737-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12351-022-00737-7
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s12351-022-00737-7?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. Davies, A. Paul & Bischoff, Eberhard E., 1999. "Weight distribution considerations in container loading," European Journal of Operational Research, Elsevier, vol. 114(3), pages 509-527, May.
    2. Maria Teresa Alonso & Ramon Alvarez-Valdes & Francisco Parreño & Jose Manuel Tamarit, 2016. "Algorithms for Pallet Building and Truck Loading in an Interdepot Transportation Problem," Mathematical Problems in Engineering, Hindawi, vol. 2016, pages 1-11, April.
    3. Yuceer, Umit, 1997. "A multi-product loading problem: a model and solution method," European Journal of Operational Research, Elsevier, vol. 101(3), pages 519-531, September.
    4. Ramos, António G. & Silva, Elsa & Oliveira, José F., 2018. "A new load balance methodology for container loading problem in road transportation," European Journal of Operational Research, Elsevier, vol. 266(3), pages 1140-1152.
    5. Cornillier, Fabien & Boctor, Fayez F. & Laporte, Gilbert & Renaud, Jacques, 2008. "A heuristic for the multi-period petrol station replenishment problem," European Journal of Operational Research, Elsevier, vol. 191(2), pages 295-305, December.
    6. S Limbourg & M Schyns & G Laporte, 2012. "Automatic aircraft cargo load planning," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 63(9), pages 1271-1283, September.
    7. Lim, Andrew & Ma, Hong & Qiu, Chaoyang & Zhu, Wenbin, 2013. "The single container loading problem with axle weight constraints," International Journal of Production Economics, Elsevier, vol. 144(1), pages 358-369.
    8. Lahyani, Rahma & Coelho, Leandro C. & Khemakhem, Mahdi & Laporte, Gilbert & Semet, Frédéric, 2015. "A multi-compartment vehicle routing problem arising in the collection of olive oil in Tunisia," Omega, Elsevier, vol. 51(C), pages 1-10.
    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. I. Gimenez-Palacios & M. T. Alonso & R. Alvarez-Valdes & F. Parreño, 2021. "Logistic constraints in container loading problems: the impact of complete shipment conditions," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 29(1), pages 177-203, April.
    2. Araya, Ignacio & Moyano, Mauricio & Sanchez, Cristobal, 2020. "A beam search algorithm for the biobjective container loading problem," European Journal of Operational Research, Elsevier, vol. 286(2), pages 417-431.
    3. Gajda, Mikele & Trivella, Alessio & Mansini, Renata & Pisinger, David, 2022. "An optimization approach for a complex real-life container loading problem," Omega, Elsevier, vol. 107(C).
    4. Castellucci, Pedro B. & Toledo, Franklina M.B. & Costa, Alysson M., 2019. "Output maximization container loading problem with time availability constraints," Operations Research Perspectives, Elsevier, vol. 6(C).
    5. Silva, Elsa & Ramos, António G. & Oliveira, José F., 2018. "Load balance recovery for multi-drop distribution problems: A mixed integer linear programming approach," Transportation Research Part B: Methodological, Elsevier, vol. 116(C), pages 62-75.
    6. Tino Henke & M. Grazia Speranza & Gerhard Wäscher, 2019. "A branch-and-cut algorithm for the multi-compartment vehicle routing problem with flexible compartment sizes," Annals of Operations Research, Springer, vol. 275(2), pages 321-338, April.
    7. Ostermeier, Manuel & Henke, Tino & Hübner, Alexander & Wäscher, Gerhard, 2021. "Multi-compartment vehicle routing problems: State-of-the-art, modeling framework and future directions," European Journal of Operational Research, Elsevier, vol. 292(3), pages 799-817.
    8. Yan Cheng Hsu & Jose L. Walteros & Rajan Batta, 2020. "Solving the petroleum replenishment and routing problem with variable demands and time windows," Annals of Operations Research, Springer, vol. 294(1), pages 9-46, November.
    9. Paquay, Célia & Limbourg, Sabine & Schyns, Michaël, 2018. "A tailored two-phase constructive heuristic for the three-dimensional Multiple Bin Size Bin Packing Problem with transportation constraints," European Journal of Operational Research, Elsevier, vol. 267(1), pages 52-64.
    10. Samira Mirzaei & Sanne Wøhlk, 2017. "Erratum to: A Branch-and-Price algorithm for two multi-compartment vehicle routing problems," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 6(2), pages 185-218, June.
    11. Gu, Wenjuan & Archetti, Claudia & Cattaruzza, Diego & Ogier, Maxime & Semet, Frédéric & Speranza, M. Grazia, 2024. "Vehicle routing problems with multiple commodities: A survey," European Journal of Operational Research, Elsevier, vol. 317(1), pages 1-15.
    12. Hiba Yahyaoui & Islem Kaabachi & Saoussen Krichen & Abdulkader Dekdouk, 2020. "Two metaheuristic approaches for solving the multi-compartment vehicle routing problem," Operational Research, Springer, vol. 20(4), pages 2085-2108, December.
    13. Çalık, Hatice & Juwet, Marc & Yaman, Hande & Vanden Berghe, Greet, 2023. "Cargo securing under multi-drop and axle weight constraints," European Journal of Operational Research, Elsevier, vol. 307(1), pages 157-176.
    14. Novas, Juan M. & Ramello, Juan Ignacio & Rodríguez, María Analía, 2020. "Generalized disjunctive programming models for the truck loading problem: A case study from the non-alcoholic beverages industry," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 140(C).
    15. Ramos, António G. & Silva, Elsa & Oliveira, José F., 2018. "A new load balance methodology for container loading problem in road transportation," European Journal of Operational Research, Elsevier, vol. 266(3), pages 1140-1152.
    16. Gzara, Fatma & Elhedhli, Samir & Yildiz, Burak C., 2020. "The Pallet Loading Problem: Three-dimensional bin packing with practical constraints," European Journal of Operational Research, Elsevier, vol. 287(3), pages 1062-1074.
    17. Alinaghian, Mahdi & Shokouhi, Nadia, 2018. "Multi-depot multi-compartment vehicle routing problem, solved by a hybrid adaptive large neighborhood search," Omega, Elsevier, vol. 76(C), pages 85-99.
    18. Ostermeier, Manuel & Hübner, Alexander, 2018. "Vehicle selection for a multi-compartment vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 269(2), pages 682-694.
    19. Giménez-Palacios, Iván & Parreño, Francisco & Álvarez-Valdés, Ramón & Paquay, Célia & Oliveira, Beatriz Brito & Carravilla, Maria Antónia & Oliveira, José Fernando, 2022. "First-mile logistics parcel pickup: Vehicle routing with packing constraints under disruption," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 164(C).
    20. Tino Henke & Grazia Speranza & Gerhard Wäscher, 2017. "A Branch-and-Cut Algorithm for the Multi Compartment vehicle Routing Problem with Flexbile Compartment Sizes," FEMM Working Papers 170004, Otto-von-Guericke University Magdeburg, Faculty of Economics and Management.

    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:operea:v:22:y:2022:i:5:d:10.1007_s12351-022-00737-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.

    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: 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.