Bin Packing Problem with Item Time Window Conflict Dependent Profits

被引：0
作者：
Ren J. [1 ]
机构：
[1] Business School, Hohai University, Jiangsu, Nanjing
来源：
Applied Mathematics and Nonlinear Sciences | 2024年 / 9卷 / 01期
关键词：
Boxing problem; GRASP-VND algorithm; Iterative local search; Time window; Time-dependent profit;
D O I：
10.2478/amns-2024-0708
中图分类号：
学科分类号：
摘要：
The problem of packing with items with conflicting time-window dependence on profit considering departure time is studied in the context of consolidation of goods in transport, which is a practical problem in the logistics industry. The objective is to select the loading plan that is most profitable based on the volume and time windows of the items. The time windows of items in the same box must intersect, and the intersection of the items’ time windows affects the box’s departure time and hence the profit-dependent time. The problem is identified as an integer programming model for decision making, and two modeling strategies are proposed to address it by improving the GRASP heuristic. Multi-class examples are used in experiments to confirm that the improved algorithm can solve the problem efficiently, find the near-optimal solution in a shorter time, and enhance customer satisfaction. © 2023 Jiayue Ren, published by Sciendo.
引用
收藏
相关论文
共 21 条
  • [1] Su J.-N., Zhao X.-H., Procurement management based on integrated supply chain, (2004)
  • [2] Shekarian M., Parast M.M., An integrative approach to supply chain disruption risk and resilience management: a literature review, International Journal of Logistics Research and Applications, 24, 5, pp. 427-455, (2021)
  • [3] Hipolito T., Nabais J.L., Carmona-Benitez R., Botto M.A., Negenborn R.R., A centralised model predictive control framework for logistics manage- ment of coordinated supply chains of perishable goods, International Journal of Systems Science: Operations & Logistics, 9, 1, pp. 1-21, (2022)
  • [4] Baldi M.M., Manerba D., Perboli G., Tadei R., A generalised bin packing problem for parcel delivery in last-mile logistics, European Journal of Operational Research, 274, 3, pp. 990-999, (2019)
  • [5] Crainic T.G., Fomeni F.D., Rei W., Multi-period bin packing model and effective constructive heuristics for corridor-based logistics capacity planning, Computers & Operations Research, 132, (2021)
  • [6] Hammaer P., Rader D.J., Efficient methods for solving quadratic 0-1 knapsack INFOR, Information Systems and Operational Research, 35, 3, pp. 170-182, (1997)
  • [7] Fernandes Muritiba A.E., Iori M., Malaguti E., Toth P., Algorithms for the bin packing problem with conflicts, Informs Journal on computing, 22, 3, pp. 401-415, (2010)
  • [8] Su J.L., Huang S.C., Fan K.S., Chen J.R., Lee S.K., An approach method on route selection of transportation of toxic substances using hazard potential analysis. Potential analysis, SAFETY AND RELIABILITY FOR MANAGING RISK, VOLS 1-3, Proceedings and Monographs in Engineering Water European Safety and Reliability Conference (ESREL 2006), (2006)
  • [9] Sadykov R., Vanderbeck F., Bin packing with conflicts: a generic branch-and- price algorithm, INFORMS Journal on Computing, 25, 2, pp. 244-255, (2013)
  • [10] Moura Santos L.F.O., Iwayama R.S., Cavalcanti L.B., Turi L.M., de Souza Morais F.E., Mormilho G., Cunha C.B., A vari- able neighbourhood search algorithm for the bin packing problem with compatible categories, Expert Systems with Applications, 124, pp. 209-225, (2019)
123