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

Romero, Sebastián V.; Osaba, Eneko; Villar-Rodríguez, Esther; Oregi, Izaskun; Ban, Yong-Ling

doi:10.21203/rs.3.rs-2660850/v1

Cited by 8 publications

(4 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…-The use of 3D dimensions, i.e., depth, width, and height, to categorize packages and truck capacities. This line would relate this work to other branches of research, such as the bin packing problem 34 .…”

Section: Discussionmentioning

confidence: 99%

Solving a Real-World Package Delivery Routing Problem Using Quantum Annealers

Osaba,

Villar-Rodriguez,

Asla

2024

Preprint

View full text Add to dashboard Cite

Research focused on the conjunction between quantum computing and routing problems has been very prolific in recent years. Most of the works revolve around classical problems such as the Traveling Salesman Problem or the Vehicle Routing Problem. Even though working on these problems is valuable, it is also undeniable that their academic-oriented nature falls short of real-world requirements. The main objective of this research is to present a solving method for realistic instances, avoiding problem relaxations or technical shortcuts. Instead, a quantum-classical hybrid solver has been developed, coined Q4RPD, that considers a set of real constraints such as a heterogeneous fleet of vehicles, priority deliveries, and capacities characterized by two values: weight and dimensions of the packages. \Q4RPD resorts to the Leap Constrained Quadratic Model Hybrid Solver of D-Wave. To demonstrate the application of Q4RPD, an experimentation composed of six different instances has been conducted, aiming to serve as illustrative examples.

show abstract

Section: Discussionmentioning

confidence: 99%

Solving a Real-World Package Delivery Routing Problem Using Quantum Annealers

Osaba,

Villar-Rodriguez,

Asla

2024

Preprint

View full text Add to dashboard Cite

show abstract

“…This approach utilizes the augmented Lagrangian method to facilitate the incorporation of the packing constraints into the objective function and demonstrates the potential dynamics of quantum computation in solving the mixed palletizing problem. Other instances of quantum computation utilization are presented in [81,82]. In these articles, a hybrid quantum-classical framework for solving 3DBPPs is discussed, while also considering many constraints, such as package and bin dimensions, overweight items, dependencies among item categories, and preferences for item ordering.…”

Section: Quantum Computingmentioning

confidence: 99%

Mixed Palletizing for Smart Warehouse Environments: Sustainability Review of Existing Methods

Daios,

Kladovasilakis,

Kostavelis

2024

Sustainability

View full text Add to dashboard Cite

Mixed palletizing constitutes one of the problems in the logistics domain aroused from the need for fast product movement to satisfy the continuously increasing number of customers with the demand for highly personalized goods. In a demanding environment, such as warehouses, where break bulk and the consolidation of loads take up most of the working time, the automation of mixed palletizing can lead to increased efficiency and speed while keeping errors to a minimum. Space utilization of pallets enables savings in storage and transportation costs, boosting the overall sustainable role of the Supply Chain sector. This paper presents the proposed approaches to mixed palletizing stemming from different fields, with a focus on recent developments in the application of Industry 4.0 technologies. Our research highlights quite a few areas that require attention from researchers.

show abstract

“…An interesting algorithm for calculating the real roots of polynomials was developed by I. Kostin and posted for general use at [21]. The main idea of this algorithm is quite simple and can be summarized in two sentences.…”

Section: Covariance Matrix and Principal Component Extractionmentioning

confidence: 99%

“…The least squares method was applied in the previous section. However, metaheuristic algorithms are also popular recently as, for example, quantum annealers [21], monarch butterfly optimization algorithms [22], slime mould algorithms [23], particle swarm optimization algorithms [24], and string theory algorithms [25]. These algorithms are efficient, however the mathematical guarantee of their convergence is generally not solved.…”

Section: Covariance Matrix and Principal Component Extractionmentioning

confidence: 99%

Approach to Evaluate the Data of Moss Biomonitoring Studies: Preprocessing and Preliminary Ranking

DUCA,

TRAVIN,

ZINICOVSCAIA

2023

ROMJIST

View full text Add to dashboard Cite

This paper, dedicated to Acad. Florin Gheorghe Filip, at his 15th anniversary as the Chairman of the Information Science and Technology Section of the Romanian Academy, suggests an approach to describe the data obtained in biomonitoring studies using mosses, on the example of the Republic of Moldova. In total, 33 moss samples were collected on the territory of Moldova, the elemental composition of which was determined by neutron activation analysis and atomic absorption spectrometry. At the first stage of the work, a correlation analysis was carried out with the ranking of data in the order of decreasing total correlation, which made it possible to preliminarily reduce the number of elements to two factors. At the stage of data sorting, iron, the content of which in the environment can be associated with anthropogenic activity, was chosen as the element determining the rank. The next stage of work was data smoothing using a discrete cosine transform, for which the codes were rewritten and the algorithm was ported to the Excel-VBA environment, which is most suitable for preprocessing and graphical display of experimental data. Also, an algorithm was developed for determining the number of linearly independent (basis) vectors in which the matrix itself can be decomposed. Two principal roots were identified, of which the larger one is several thousand units, and three lower roots, which are less than unit were excluded, since their absolute values differ by two to three or more orders of magnitude downward from the eigenvalues of the influencing components. The paper is dedicated to Acad. Florin Gheorghe Filip, at his 15th anniversary as the Chairman of the Information Science and Technology Section of the Romanian Academy, and at his 75th anniversary.

show abstract

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

Cited by 8 publications

References 28 publications

Solving a Real-World Package Delivery Routing Problem Using Quantum Annealers

Solving a Real-World Package Delivery Routing Problem Using Quantum Annealers

Mixed Palletizing for Smart Warehouse Environments: Sustainability Review of Existing Methods

Approach to Evaluate the Data of Moss Biomonitoring Studies: Preprocessing and Preliminary Ranking

Contact Info

Product

Resources

About