paper-with-me

Papers

Solving Logistic-Oriented Bin Packing Problems Through a Hybrid Quantum-Classical Approach

2023-08-05 · Sebastián V. Romero, Eneko Osaba, Esther Villar-Rodriguez, Antón Asla

The Bin Packing Problem is a classic problem with wide industrial applicability. In fact, the efficient packing of items into bins is one of the toughest challenges in many logistic corporations and is a critical issue for reducing storage costs or improving vehicle space allocation. In this work, we resort to our previously published quantum-classical framework known as Q4RealBPP, and elaborate on the solving of real-world oriented instances of the Bin Packing Problem. With this purpose, this paper gravitates on the following characteristics: i) the existence of heterogeneous bins, ii) the extension of the framework to solve not only three-dimensional, but also one- and two-dimensional instances of the problem, iii) requirements for item-bin associations, and iv) delivery priorities. All these features have been tested in this paper, as well as the ability of Q4RealBPP to solve real-world oriented instances.

📄 PDF Abstract BibTeX arXiv:2308.02787

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Hybrid Approach for Solving Real-World Bin Packing Problem Instances Using Quantum Annealers

2023-03-01 · Sebastián V. Romero, Eneko Osaba, Esther Villar-Rodriguez, Izaskun Oregi 외

Efficient packing of items into bins is a common daily task. Known as Bin Packing Problem, it has been intensively studied in the field of artificial intelligence, thanks to the wide interest from industry and logistics.…

Solving Packing Problems by Conditional Query Learning

2019-09-25 · Dongda Li, Changwei Ren, Zhaoquan Gu, Yuexuan Wang 외

Neural Combinatorial Optimization (NCO) has shown the potential to solve traditional NP-hard problems recently. Previous studies have shown that NCO outperforms heuristic algorithms in many combinatorial optimization pro…

Combinatorial Optimization

A Data-Driven Column Generation Algorithm For Bin Packing Problem in Manufacturing Industry

2022-02-25 · Jiahui Duan, Xialiang Tong, Fei Ni, Zhenan He 외

The bin packing problem exists widely in real logistic scenarios (e.g., packing pipeline, express delivery), with its goal to improve the packing efficiency and reduce the transportation cost. In this NP-hard combinatori…

Combinatorial Optimization

A Multi-task Selected Learning Approach for Solving 3D Flexible Bin Packing Problem

2018-04-17 · Lu Duan, Haoyuan Hu, Yu Qian, Yu Gong 외

A 3D flexible bin packing problem (3D-FBPP) arises from the process of warehouse packing in e-commerce. An online customer's order usually contains several items and needs to be packed as a whole before shipping. In part…

3D Bin PackingCombinatorial Optimization

QOPTLib: a Quantum Computing Oriented Benchmark for Combinatorial Optimization Problems

2024-04-24 · Eneko Osaba, Esther Villar-Rodriguez

In this paper, we propose a quantum computing oriented benchmark for combinatorial optimization. This benchmark, coined as QOPTLib, is composed of 40 instances equally distributed over four well-known problems: Traveling…

Combinatorial OptimizationTraveling Salesman Problem