Skip to main content
SpringerLink
Log in

A tailored adaptive large neighborhood search algorithm for the air cargo partitioning problem with a piecewise linear cost function

  • Optimization
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

Motivated by a leading Chinese multinational manufacturer’s practical air cargo logistics activities, we investigate an air cargo partitioning problem with a piecewise linear cost function (ACPP-PLC). In this problem, the charging policy chooses the higher value between the actual weight and the volumetric weight of the cargo as the chargeable weight, where the volumetric weight is calculated from the cargo’s volume according to a particular conversion factor. The variable transportation cost is then computed using a piecewise linear cost function of the chargeable weight. We formulate the ACPP-PLC as a mixed-integer linear programming model and propose a tailored adaptive large neighborhood search (TALNS) algorithm, combining the adaptive large neighborhood search algorithm and the tabu search heuristic in a single framework. Numerical experiments show that the proposed TALNS can generate high-quality solutions for all the instances in a much shorter time than the off-the-shelf solver CPLEX. Additional experiments are also conducted to analyze the effects of critical ingredients of the TALNS algorithm.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Algorithm 1
Algorithm 2
Algorithm 3
Algorithm 4
Algorithm 5
Fig. 4
Fig. 5

Similar content being viewed by others

Data availibility

All data generated or analyzed during this study are available from the corresponding author’s website https://sites.google.com/site/chun123cheng/instances.

Notes

  1. https://en.wikipedia.org/wiki/CPLEX

  2. https://www.gurobi.com/

References

  • Alvarez-Valdés R, Parreño F, Tamarit JM (2015) Lower bounds for three-dimensional multiple-bin-size bin packing problems. OR Spectrum 37(1):49–74

    Article  MathSciNet  MATH  Google Scholar 

  • Buljubašić M, Vasquez M (2016) Consistent neighborhood search for one-dimensional bin packing and two-dimensional vector packing. Comput Oper Res 76:12–21

    Article  MathSciNet  MATH  Google Scholar 

  • Caprara A, Toth P (2001) Lower bounds and algorithms for the 2-dimensional vector packing problem. Discret Appl Math 111(3):231–262

    Article  MathSciNet  MATH  Google Scholar 

  • Côté JF, Haouari M, Iori M (2019) A primal decomposition algorithm for the two-dimensional bin packing problem. arXiv preprint arXiv:1909.06835

  • Crainic TG, Perboli G, Tadei R (2009) Ts2pack: a two-level tabu search for the three-dimensional bin packing problem. Eur J Oper Res 195(3):744–760

    Article  MATH  Google Scholar 

  • Cui YP, Cui Y, Tang T (2015) Sequential heuristic for the two-dimensional bin-packing problem. Eur J Oper Res 240(1):43–53

    Article  MathSciNet  MATH  Google Scholar 

  • Cui YP, Yao Y, Zhang D (2018) Applying triple-block patterns in solving the two-dimensional bin packing problem. J Oper Res Soc 69(3):402–415

    Article  Google Scholar 

  • Delorme M, Iori M, Martello S (2016) Bin packing and cutting stock problems: mathematical models and exact algorithms. Eur J Oper Res 255(1):1–20

    Article  MathSciNet  MATH  Google Scholar 

  • Dyckhoff H (1990) A typology of cutting and packing problems. Eur J Oper Res 44(2):145–159

    Article  MathSciNet  MATH  Google Scholar 

  • D’Angelo G, Palmieri F (2021) Gga: a modified genetic algorithm with gradient-based local search for solving constrained optimization problems. Inf Sci 547:136–162

    Article  MathSciNet  MATH  Google Scholar 

  • D’Angelo G, Palmieri F, Robustelli A (2022) Artificial neural networks for resources optimization in energetic environment. Soft Comput 26(4):1779–1792

    Article  Google Scholar 

  • Epstein L, Levin A (2012) Bin packing with general cost structures. Math Program 132(1–2):355–391

    Article  MathSciNet  MATH  Google Scholar 

  • Epstein L, Levin A, Van Stee R (2007) Multi-dimensional packing with conflicts. In: International symposium on fundamentals of computation theory, Springer, pp 288–299

  • Faroe O, Pisinger D, Zachariasen M (2003) Guided local search for the three-dimensional bin-packing problem. INFORMS J Comput 15(3):267–283

    Article  MathSciNet  MATH  Google Scholar 

  • Fleszar K, Charalambous C (2011) Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem. Eur J Oper Res 210(2):176–184

    Article  MathSciNet  MATH  Google Scholar 

  • Gendreau M, Laporte G, Semet F (2004) Heuristics and lower bounds for the bin packing problem with conflicts. Comput Oper Res 31(3):347–358

    Article  MathSciNet  MATH  Google Scholar 

  • Hu Q, Lim A, Zhu W (2015) The two-dimensional vector packing problem with piecewise linear cost function. Omega 50:43–53

    Article  Google Scholar 

  • Hu Q, Wei L, Lim A (2018) The two-dimensional vector packing problem with general costs. Omega 74:59–69

    Article  Google Scholar 

  • Kramer R, Dell’Amico M, Iori M (2017) A batching-move iterated local search algorithm for the bin packing problem with generalized precedence constraints. Int J Prod Res 55(21):6288–6304

    Article  Google Scholar 

  • Kucukyilmaz T, Kiziloz HE (2018) Cooperative parallel grouping genetic algorithm for the one-dimensional bin packing problem. Comput Indus Eng 125:157–170

    Article  Google Scholar 

  • Leung JYT, Li CL (2008) An asymptotic approximation scheme for the concave cost bin packing problem. Eur J Oper Res 191(2):582–586

    Article  MATH  Google Scholar 

  • Li CL, Chen ZL (2006) Bin-packing problem with concave costs of bin utilization. Naval Res Log (NRL) 53(4):298–308

    Article  MathSciNet  MATH  Google Scholar 

  • Li Z, Bookbinder JH, Elhedhli S (2012) Optimal shipment decisions for an airfreight forwarder: formulation and solution methods. Transp Res C Emerg Technol 21(1):17–30

    Article  Google Scholar 

  • Lodi A, Martello S, Vigo D (2004) Tspack: a unified tabu search code for multi-dimensional bin packing problems. Ann Oper Res 131(1–4):203–213

    Article  MathSciNet  MATH  Google Scholar 

  • López-Ibáñez M, Dubois-Lacoste J, Cáceres LP, Birattari M, Stützle T (2016) The Irace package: iterated racing for automatic algorithm configuration. Oper Res Perspect 3:43–58

    MathSciNet  Google Scholar 

  • Martello S, Pisinger D, Vigo D (2000) The three-dimensional bin packing problem. Oper Res 48(2):256–267

    Article  MathSciNet  MATH  Google Scholar 

  • Masson R, Vidal T, Michallet J, Penna PHV, Petrucci V, Subramanian A, Dubedout H (2013) An iterated local search heuristic for multi-capacity bin packing and machine reassignment problems. Expert Syst Appl 40(13):5266–5275

    Article  Google Scholar 

  • Muritiba AEF, Iori M, Malaguti E, Toth P (2010) Algorithms for the bin packing problem with conflicts. INFORMS J Comput 22(3):401–415

    Article  MathSciNet  MATH  Google Scholar 

  • Paquay C, Schyns M, Limbourg S (2016) A mixed integer programming formulation for the three-dimensional bin packing problem deriving from an air cargo application. Int Trans Oper Res 23(1–2):187–213

    Article  MathSciNet  MATH  Google Scholar 

  • Pisinger D, Sigurd M (2007) Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem. INFORMS J Comput 19(1):36–51

    Article  MathSciNet  MATH  Google Scholar 

  • Polyakovskiy S, M’Hallah R (2018) A hybrid feasibility constraints-guided search to the two-dimensional bin packing problem with due dates. Eur J Oper Res 266(3):819–839

    Article  MathSciNet  MATH  Google Scholar 

  • Quiroz-Castellanos M, Cruz-Reyes L, Torres-Jimenez J, Gómez C, Huacuja HJF, Alvim AC (2015) A grouping genetic algorithm with controlled gene transmission for the bin packing problem. Comput Oper Res 55:52–64

  • Ropke S, Pisinger D (2006) An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp Sci 40(4):455–472

    Article  Google Scholar 

  • Serairi M, Haouari M (2018) A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem. RAIRO-Oper Res 52(2):391–414

    Article  MathSciNet  MATH  Google Scholar 

  • Spieksma FC (1994) A branch-and-bound algorithm for the two-dimensional vector packing problem. Comput Oper Res 21(1):19–25

    Article  MATH  Google Scholar 

  • Wei L, Lai M, Lim A, Hu Q (2020) A branch-and-price algorithm for the two-dimensional vector packing problem. Eur J Oper Res 281(1):25–35

    Article  MathSciNet  MATH  Google Scholar 

  • Wei L, Luo Z, Baldacci R, Lim A (2020) A new branch-and-price-and-cut algorithm for one-dimensional bin-packing problems. INFORMS J Comput 32(2):428–443

    Article  MathSciNet  MATH  Google Scholar 

  • Wu CX, Liao MH, Karatas M, Chen SY, Zheng YJ (2020) Real-time neural network scheduling of emergency medical mask production during covid-19. Appl Soft Comput 97:106790

    Article  Google Scholar 

  • Wu Y, Li W, Goh M, de Souza R (2010) Three-dimensional bin packing problem with variable bin height. Eur J Oper Res 202(2):347–355

    Article  MathSciNet  MATH  Google Scholar 

  • Zudio A, da Silva Costa DH, Masquio BP, Coelho IM, Pinto PED (2018) BRKGA/VND hybrid algorithm for the classic three-dimensional bin packing problem. Electronic Notes Discrete Math 66:175–182

    Article  MathSciNet  MATH  Google Scholar 

Download references

Funding

This research was supported by the National Natural Science Foundation of China [Nos. 72101049, 72232001, 71971090, 71821001], the Natural Science Foundation of Liaoning Province [No. 2023-BS-091], the Fundamental Research Funds for the Central Universities [No. DUT23RC(3)045], and the Major Project of the National Social Science Foundation [No. 22 &ZD151]. The authors are thankful to the editor and anonymous referees for their helpful comments.

Author information

Authors and Affiliations

  1. School of Management, Huazhong University of Science and Technology, Wuhan, 430074, China

    Xin Jin & Hu Qin

  2. School of Economics and Management, Dalian University of Technology, Dalian, 116024, China

    Chun Cheng

Authors
  1. Xin Jin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hu Qin
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Chun Cheng
    View author publications

    You can also search for this author in PubMed Google Scholar

Contributions

All the authors contributed to the study conception and design. The study direction and specific problem definition were proposed by Hu Qin. The algorithm and mathematical model were implemented by Xin Jin,. The original manuscript was written by Chun Cheng and Xin Jin. The manuscript was revised by Chun Cheng.

Corresponding author

Correspondence to Chun Cheng.

Ethics declarations

Conflict of interest

The authors report there are no competing interests to declare.

Informed consent

Informed consent was obtained from all individual participants included in the study.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Jin, X., Qin, H. & Cheng, C. A tailored adaptive large neighborhood search algorithm for the air cargo partitioning problem with a piecewise linear cost function. Soft Comput 27, 17639–17656 (2023). https://doi.org/10.1007/s00500-023-09033-8

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-023-09033-8

Keywords

Search

Navigation