A differential evolution algorithm with ternary search tree for solving the three-dimensional packing problem

Huang, Ying; Lai, L. K W; Li, Wei; Wang, Hui

doi:10.1016/j.ins.2022.05.063

Cited by 22 publications

(9 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The primary goal is to find an arrangement of the items within the container(s) that optimises a specific objective function, often related to space efficiency [5][6][7]. This problem is of practical importance in the field of logistics and transportation, where efficient cargo loading can lead to cost savings and improved overall supply chain efficiency [8][9][10]. There are different variants of the CLP, including the Pallet Loading Problem, and the 2D and 3D packing problems.…”

Section: Optimisation Problems: Container and Pallet Loading Problemsmentioning

confidence: 99%

Volumetric Techniques for Product Routing and Loading Optimisation in Industry 4.0: A Review

Lopes,

Trovati,

Pereira

2024

Future Internet

View full text Add to dashboard Cite

Industry 4.0 has become a crucial part in the majority of processes, components, and related modelling, as well as predictive tools that allow a more efficient, automated and sustainable approach to industry. The availability of large quantities of data, and the advances in IoT, AI, and data-driven frameworks, have led to an enhanced data gathering, assessment, and extraction of actionable information, resulting in a better decision-making process. Product picking and its subsequent packing is an important area, and has drawn increasing attention for the research community. However, depending of the context, some of the related approaches tend to be either highly mathematical, or applied to a specific context. This article aims to provide a survey on the main methods, techniques, and frameworks relevant to product packing and to highlight the main properties and features that should be further investigated to ensure a more efficient and optimised approach.

show abstract

Section: Optimisation Problems: Container and Pallet Loading Problemsmentioning

confidence: 99%

Volumetric Techniques for Product Routing and Loading Optimisation in Industry 4.0: A Review

Lopes,

Trovati,

Pereira

2024

Future Internet

View full text Add to dashboard Cite

show abstract

“…For example, Huang et al [5] combined a Differential Evolution (DE) algorithm with a ternary search tree model. They used a ternary tree model to generate a set of suboptimal solutions as the initial population for DE, with the goal of solving the 3D bin packing problem.…”

Section: D Bin Packing Problemmentioning

confidence: 99%

Online 3D Packing Problem Based on Bi-Value Guidance

Qi¹,

Zhang²

2023

JCC

View full text Add to dashboard Cite

The online 3D packing problem has received increasing attention in recent years due to its practical value. However, the problem itself possesses some peculiar properties, such as sequential decision-making and the large size of the state space, which have made the use of reinforcement learning with Markov decision processes a popular approach for solving this problem. In this paper, we focus on the problem of high variance in value estimation caused by reward uncertainty in the presence of highly uncertain dynamics. To address this, proposed a solution based on auxiliary tasks and intrinsic rewards for the online 3D bin packing problem, guided by a binary-valued network, to assist the agent in learning the policy within the framework of actor-critic deep reinforcement learning. Specifically, the maintenance of two-valued networks and the utilization of multi-valued network estimates are employed to replace the original value estimates, aiming to provide better guidance for the learning of policy networks. Experimentally, it has been demonstrated that our model can achieve more robust learning and outperform previous works in terms of performance.

show abstract

“…Generate block b s //the sizes are el • l,ew • w,eh • h, including el • ew•, eh pieces of class i goods (10) Put b s into set FSB i (11) N � 􏽐 i N i // N i is the number of simple goods blocks in each set FSB i , N is the total number of blocks eventually generated (12) if N > num K (13) for goods in each category i (14) num � max(N i /N × num K , 1) (15) Select the top num blocks in each category of goods block set FSB i and put them into set FSB S (16) else put all the blocks in set FSB i into set FSB S (17) return FSB S ALGORITHM 2: Simple block construction algorithm (Taking heavy goods set as an example).…”

Section: Selection Of Goods Blocksmentioning

confidence: 99%

“…Lei Dingyou et al proposed a mixed and balanced loading method of railway containers for light and heavy goods based on the central skeleton idea, but they did not include the load capacity utilization rate into the optimization objective [ 16 ]. Huang et al proposed a novel technique that combines a differential evolution algorithm with a ternary search tree model to solve the three-dimensional container loading problem [ 17 ]. Zhang et al proposed an optimization method for balanced loading layout of railway container mixed goods, but stability constraints such as full support are not involved [ 18 ].…”

Section: Introductionmentioning

confidence: 99%

Optimization of Railway Mixed Goods Loading Layout considering Stability

Wang

Yao

Zhang

et al. 2022

Computational Intelligence and Neuroscience

View full text Add to dashboard Cite

It is well known that stability, center-of-gravity balance, and concentrated-weight are key factors of the transportation safety. The reasonable formulation of the loading layout scheme ensures the safety of shipment based on fully utilizing the effective volume and load capacity of freight vehicles. This paper takes the railway mixed goods loading layout as the research object, considering the constraints such as goods loading center-of-gravity balance, the allowable moment of concentrated-weight, supporting and goods placement mode, and taking the maximum comprehensive utilization rates for both effective volume and load capacity of freight vehicle as the optimization objective, an optimization model of railway mixed goods balanced and anticoncentrated-weight loading layout considering stability is built. Additionally, this paper designs mixed goods classified and simple/general goods block composition methods. We improve the representation and selection of layout space, construct goods block selection algorithm based on the greedy d-step lookahead tree search and goods block evaluation function and propose a goods block placement strategy and update rules of layout space after goods block placement. An optimization algorithm of railway mixed goods balanced and anticoncentrated-weight load layout considering stability is designed. The results show that the formulated scheme not only ensures that the goods meet the full support constraints, but also the comprehensive utilization rate of the effective volume and load capacity of the vehicle is not less than 89%, and the probability of meeting the loading center-of-gravity balance and allowable moment of concentrated-weight are as high as 99% and 99.47%, respectively. The proposed method realizes the balanced and anticoncentrated-weight loading of railway mixed goods, ensures the safe, stable, and efficient goods loading, and provides decision support for the safe loading layout of railway goods.

show abstract

A differential evolution algorithm with ternary search tree for solving the three-dimensional packing problem

Cited by 22 publications

References 23 publications

Volumetric Techniques for Product Routing and Loading Optimisation in Industry 4.0: A Review

Volumetric Techniques for Product Routing and Loading Optimisation in Industry 4.0: A Review

Online 3D Packing Problem Based on Bi-Value Guidance

Optimization of Railway Mixed Goods Loading Layout considering Stability

Contact Info

Product

Resources

About