检索结果-内蒙古大学图书馆

The semi-online robotic pallet loading problem

COMPUTERS & OPERATIONS RESEARCH 2025年 174卷

作者： Yao, Shaowen Zhang, Tai Zhang, Hao Qiu, Jian Leng, Jiewu Liu, Qiang Wei, Lijun Guangdong Univ Technol Sch Electromech Engn Key Lab Comp Integrated Mfg Syst Guangzhou 510006 Peoples R China Macau Univ Sci & Technol Macau Inst Syst Engn Taipa 999078 Macao Peoples R China Macau Univ Sci & Technol Collaborat Lab Intelligent Sci & Syst Taipa 999078 Macao Peoples R China

The distributor's online pallet loading problem (DPLP), which involves efficiently packing a set of cuboid boxes with various dimensions and unknown order into a minimum number of given sized pallet, is extensively employed in industrial automation and has recently garnered significant attention from the research community. However, the existing online approaches face challenges due to the unpredictable arrival order of boxes and the requirement for fast processing. To address this issue, we introduce anew variant of DPLP, the online pallet loading problem with buffer area, by introducing a buffer area with a predefined capacity within the stacking region. The arrival boxes are initially positioned within the buffer area until the total number of boxes reaches the maximum capacity of the buffer area, then, the boxes in the buffer area are selected and packed into the pallet. We propose a greedy search heuristic to solve the online DPLP with buffer area. Our approach uses an open space approach to represent the residual space and combine simple and guillotine blocks to generate blocks. By minimizing the amount of waste, we select the appropriate box placement. Extensive experimental tests on classical and practical instances shows that our method improves pallet utilization by more than 15% compared to purely online algorithms. Compared with other state-of-the-art algorithms, our method improves the average improvement by 8%. Moreover, our approach exhibits a certain level of generalizability and holds substantial practical value for real-world applications.

关键词： pallet loading problem Online algorithm Greedy heuristic Buffer area

来源：评论

学校读者我要写书评

暂无评论

The G4-heuristic for the pallet loading problem

引用

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY 1996年第4期47卷 511-522页

作者： Scheithauer, G Terno, J TECH UNIV DRESDEN INST NUMER MATHD-01062 DRESDENGERMANY

A new heuristic for the well-known (two-dimensional orthogonal) pallet loading problem (PLP) is proposed in this paper. This heuristic, referred to as G4-heuristic, is based on the definition of the so-called G4-structure of packing patterns. The G4-structure is a generalization of the common used block structure of packing patterns which requires the same orientation of packed boxes within each block The G4-heuristic yields in approximately 99% of the test instances an optimal solution and solves all instances exactly where at most 50 boxes are contained in an optimal packing. Although the algorithm is pseudo-polynomial the computational experiments reported show that also instances with more than 200 packed boxes in an optimal solution can be handled with a small amount of computational time. Moreover, so far there is not known any instance where the gap between optimal value and the value obtained by the G4-heuristic is larger than one box.

关键词： packing pallet loading problem cutting stock problem combinatorial analysis dynamic programming heuristics

来源：评论

学校读者我要写书评

暂无评论

The pallet loading problem: Three-dimensional bin packing with practical constraints

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2020年第3期287卷 1062-1074页

作者： Gzara, Fatma Elhedhli, Samir Yildiz, Burak C. Univ Waterloo Dept Management Sci 200 Univ Ave West Waterloo ON Canada

pallet loading requires the solution of a three-dimensional bin packing problem (3DBPP) with additional requirements. In particular, vertical support and load bearing, which are not enforced in 3DBPP, are essential in practice. In this work, we provide a complete solution approach for pallet loading problems where practical constraints of vertical support, load bearing, planogram sequencing, and weight limits are fully accounted for. Using a layer based column generation approach, we tackle vertical support using second order cone programming, and satisfy load bearing through a graph representation to trace load distribution. Additionally, we use industry data to propose an instance generator that produces realistic items with practical attributes such as support surface, load capacity, weight, and planogram sequence number. Extensive numerical testing reveals the ability of the approach to find high quality solutions for industry size instances in fast computational times. (C) 2020 Elsevier B.V. All rights reserved.

关键词： pallet loading problem Three dimensional bin packing Vertical support Load bearing Layer based column generation

来源：评论

学校读者我要写书评

暂无评论

Revisiting the pallet loading problem using a discrete event system approach to minimise logistic costs

引用

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 2011年第8期49卷 2243-2264页

作者： Zuniga, Catya Angel Piera, Miquel Narciso, Mercedes Autonomous Univ Barcelona Dept Telecommun & Syst Engn Barcelona Spain

This paper presents a new challenging modelling approach to support different heuristics to tackle the pallet loading problem (PLP). A discrete event system model to tackle the PLP is specified using the coloured Petri net formalism in order to integrate the model with the industrial context in which the PLP must be solved. New events can be formalised in the model to implement different heuristics to consider the upstream (production) and downstream (transport) influence of the palletising activity in the logistic flow. A state space analysis is performed to evaluate the different solutions to fit the maximum number of boxes on a rectangular pallet, supporting the inherent box diversity (heterogeneous palletising problems) of present production and distribution logistic systems. The heuristics implemented show that acceptable occupancy results can be obtained without requiring the exhaustive evaluation of the different feasible combination. The results demonstrate that it outperforms other approaches which have been suggested for this type of problem. Potentially useful extensions of the work are discussed.

关键词： pallet loading problem logistics coloured Petri nets reachability tree heuristics

来源：评论

学校读者我要写书评

暂无评论

A fast algorithm for identifying minimum size instances of the equivalence classes of the pallet loading problem

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2014年第3期237卷 794-801页

作者： Lu, Yiping Cha, Jianzhong Beijing Jiaotong Univ Sch Mech Elect & Control Engn Beijing 100044 Peoples R China

In this paper, a novel and fast algorithm for identifying the Minimum Size Instance (MSI) of the equivalence class of the pallet loading problem (PLP) is presented. The new algorithm is based on the fact that the PLP instances of the same equivalence class have the property that the aspect ratios of their items belong to an open interval of real numbers. This interval characterises the PLP equivalence classes and is referred to as the Equivalence Ratio Interval (ERI) by authors of this paper. The time complexity of the new algorithm is two polynomial orders lower than that of the best known algorithm. The authors of this paper also suggest that the concept of MSI and its identifying algorithm can be used to transform the non-integer PLP into its equivalent integer MSI. (C)2014 Elsevier B.V. All rights reserved.

关键词： Packing pallet loading problem Equivalence class

来源：评论

学校读者我要写书评

暂无评论

The minimum size instance of a pallet loading problem equivalence class

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2007年第1期179卷 17-26页

作者： Martins, Gustavo H. A. Dell, Robert F. USN Postgrad Sch Operat Res Dept Monterey CA 93943 USA Brazilian Navy Ctr Naval Syst Anal BR-20000 Rio De Janeiro Brazil

The pallet loading problem (PLP) maximizes the number of identical rectangular boxes placed within a rectangular pallet. Boxes may be rotated 90 degrees so long as they are packed with edges parallel to the pallet's edges, i.e., in an orthogonal packing. This paper defines the Minimum Size Instance (MSI) of an equivalence class of PLP, and shows that every class has one and only one MSI. We develop bounds on the dimensions of box and pallet for the MSI of any class. Applying our new bounds on MSI dimensions, we present an algorithm for MSI generation and use it to enumerate all 3,080,730 equivalence classes with an area ratio (pallet area divided by box area) smaller than 101 boxes. Previous work only provides bounds on the ratio of box dimensions and only considers a subset of all classes presented here. (c) 2006 Elsevier B.V. All rights reserved.

关键词： packing pallet loading problem

来源：评论

学校读者我要写书评

暂无评论

A two-phase algorithm for the manufacturer's pallet loading problem

A two-phase algorithm for the manufacturer's pallet loading ...

引用

IEEE International Conference on Industrial Engineering and Engineering Management

作者： Wu, K. C. Ting, C. J. Yuan Ze Univ Dept Ind Engn & Management Chungli Taiwan

ISBN: (纸本)9781424415281

We propose a two-phase algorithm for solving the manufacturer's pallet loading problem (MPLP). A new integer linear programming model is developed to obtain the maximum number of items that could be packed onto a pallet in the first phase. The solution obtained in the first phase is then adopted to generate a layout pattern for the MPLP with a constraint programming model in the second phase. The computational results indicate that this algorithm can solve difficult instances to the optimality within reasonable computational times.

关键词： pallet loading problem cutting and packing mathematical programming supply chain management

来源：评论

学校读者我要写书评

暂无评论

Mixed reality-based online 3D pallet loading problem to achieve augmented intelligence in e-fulfilment processes

引用

OPERATIONS MANAGEMENT RESEARCH 2023年 1-16页

作者： Yang, T. T. Tsang, Y. P. Wu, C. H. Chung, K. T. Lee, C. K. M. Yuen, S. S. M. Queen Mary Univ London Sch Engn & Mat Sci London England Hong Kong Polytech Univ Dept Ind & Syst Engn Kowloon Hong Kong Peoples R China Hang Seng Univ Hong Kong Dept Supply Chain & Informat Management Shatin Hong Kong Peoples R China Hong Kong Polytech Univ Coll Profess & Continuing Educ Kowloon Hong Kong Peoples R China

pallet loading operations support palletisation and truckload optimisation for e-fulfilment processes. Currently, the pallet loading problem is optimised offline using available cargo information, which is advantageous compared to typical freight operations but results in inefficiency when handling fragmented e-commerce orders. This research develops a mixed reality-based online pallet loading system (MROPLS) supported by deep reinforcement learning technology and online algorithms that dynamically decide cargo placements and orientations without prior information for pallet loading operations. The MROPLS proposes a 3-dimensional maximal-rectangle non-guillotine cutting strategy combined with a deep Q-network to increase space utilisation effectively. This approach is achieved using the lookahead algorithm, which predicts upcoming packages in the online pallet loading process and optimises package spatial location and orientation decision-making. We conduct simulation experiments to verify the system's feasibility and performance by considering SF Express, DHL and Royal Mail package and ISO pallet sizes. The interaction effects between package types, pallet sizes and lookahead values were found and summarised to determine optimal system settings. With the aid of MROPLS, human intelligence in the online pallet loading process can be augmented, resulting in optimal palletisation in warehouse automation.

关键词： Deep reinforcement learning pallet loading problem E-fulfilment Online algorithm Mixed reality

来源：评论

学校读者我要写书评

暂无评论

Impact of box ratio and pinwheel pattern on the pallet loading problem

引用

Journal of Southeast University(English Edition) 2009年第2期25卷 267-270页

作者：伊俊敏王笃鹏周晶南京大学工程管理学院南京210093 华东交通大学工业工程与物流系南昌330013

The pinwheel pattern as a suitable and advantageous alternative for the loading implementation of the pallet loading problem （PLP） is identified after a survey on the loading pattern. The definitions, elements, categories, generating algorithms of the pinwheel pattern are discussed and a uniform symmetric pinwheel notation is proposed. Based on the forming geometry of a pinwheel, the pinwheel structure is analyzed in terms of the innate box ratio, the box/block orientation and the box number by combinatorial and geometrical methods. A revised data set for the PLP with an area ratio range from 1 to 76 and a box ratio range from 1 to 10 is proposed. All pinwheel instances with this data set are calculated, and box ratio range is obtained for each possible pinwheel pattern, which can be found for all non-prime numbers of boxes. And a high box ratio makes an optimal pinwheel pattern more likely appear. Results identify the impact of the above pinwheel pattern and the box ratio on the pallet loading problem.

关键词： packing pallet loading problem loading pattern box ratio pinwheel pattern

来源：评论

学校读者我要写书评

暂无评论

A Two-Phase Algorithm to Solve a 3-Dimensional pallet loading problem

引用

Procedia Manufacturing 2019年 39卷 1474-1481页

作者： Manjeet Singh Najat Almasarwah Gürsel Süer Solutions Design DHL Supply Chain Westerville OH 43082 USA Department of Industrial and Systems Engineering Ohio University Athens OH 45701 USA

The pallet loading problem (PLP) is an NP-hard problem and is generally tackled by attempting to maximize the number of boxes that can be loaded orthogonally on a pallet. Several methods have been proposed in the literature that focus on maximizing the volume utilization and stability of the pallet. In this paper, a two-phase algorithm is proposed to solve a 3-dimensional PLP while considering humidity, and storage time. In the first phase, the boxes should fit completely within the pallet without any overhang, i.e. the edges of the boxes should be parallel to the edges of the pallet, where the boxes can be rotated by 90 o . In the second phase, the number of horizontal layers per pallet is calculated based on three parameters, i.e. maximum allowable height, maximum allowable weight, and dynamic compressive strength of boxes at the bottom layer. The maximum allowable height and maximum allowable weight for the pallet are known. The dynamic compressive strength represents the compressive strength of a box under real conditions. It is a function of the static compressive strength (strength under lab conditions), humidity, storage time etc. Here, static compressive strength of a pallet is calculated using the modified McKee formula. The horizontal layers are loaded using the same pattern to avoid overlapping. Results show the efficiency of the two-phase algorithm in maximizing the number of boxes per pallet (i.e. pallet utilization) and stability.

关键词： pallet loading problem heuristics dynamic compressive strength pallet utilization overhang overlap pallet strength

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：