Solving a new 3d bin packing problem with deep reinforcement learning method

H Hu, X Zhang, X Yan, L Wang, Y Xu - arXiv preprint arXiv:1708.05930, 2017 - arxiv.org
In this paper, a new type of 3D bin packing problem (BPP) is proposed, in which a number of
cuboid-shaped items must be put into a bin one by one orthogonally. The objective is to find …

[HTML][HTML] The evolution of rectangular bin packing problem—A review of research topics, applications, and cited papers

S Mezghani, B Haddar… - Journal of Industrial and …, 2023 - aimsciences.org
Bin packing problem (BPP) is one of the fastest-growing research issues within the field of
combinatorial optimization. Over the last years, several studies carried out various BPP …

Compliant‐based robotic 3D bin packing with unavoidable uncertainties

W Shuai, Y Gao, P Wu, G Cui, Q Zhuang… - IET Control Theory & …, 2023 - Wiley Online Library
Robotic 3D bin packing (R‐3dBPP), aiming to place deformed cases in various sizes in the
container without fences, is a comprehensive application that includes perception, planning …

Arc-flow formulation and branch-and-price-and-cut algorithm for the bin-packing problem with fragile objects

S Wang, S Yao, H Zhang, Q Liu, L Wei - Computers & Operations Research, 2025 - Elsevier
This study introduces an arc-flow formulation and the first branch-and-price-and-cut (BPC)
algorithm designed to solve the bin-packing problem with fragile objects (BPPFO). This …

Just-in-time vehicle scheduling with capacity constraints

N Boysen, D Briskorn, S Emde - Iie Transactions, 2016 - Taylor & Francis
This article treats a scheduling problem where timely departures of vehicles executing Just-
In-Time (JIT) deliveries between a single supplier and a single receiver along with the …

[PDF][PDF] A multi-task selected learning approach for solving new type 3d bin packing problem

H Hu, L Duan, X Zhang, Y Xu, J Wei - arXiv preprint arXiv:1804.06896, 2018 - arxiv.org
This paper studies a new type of 3D bin packing problem (BPP), in which a number of
cuboidshaped items must be put into a bin one by one orthogonally. The objective is to find …

[HTML][HTML] The bin packing problem with item fragmentation: a worst-case analysis

L Bertazzi, B Golden, X Wang - Discrete Applied Mathematics, 2019 - Elsevier
We provide a worst-case analysis of two variants of the classical Bin Packing Problem based
on item splitting: The Bin Packing Problem with Item Fragmentation and the Bin Packing …

[PDF][PDF] Deep Learning at Alibaba.

R Jin - IJCAI, 2017 - ijcai.org
In this talk, I will focus on the applications and the latest development of deep learning
technologies at Alibaba. More specifically, I will discuss (a) how to handle high dimensional …

Bin packing problem: Two approximation algorithms

AN Zehmakan - arXiv preprint arXiv:1508.01376, 2015 - arxiv.org
The Bin Packing Problem is one of the most important optimization problems. In recent
years, due to its NP-hard nature, several approximation algorithms have been presented. It …

[HTML][HTML] Vehicle scheduling under the warehouse-on-wheels policy

M Fliedner, D Briskorn, N Boysen - Discrete Applied Mathematics, 2016 - Elsevier
The warehouse-on-wheels (WOW) policy is a widespread concept to implement material
supply in just-in-time production systems. Instead of storing part inventories directly on the …