Bin packing and cutting stock problems: Mathematical models and exact algorithms

Delorme, Maxence; Iori, Manuel; Martello, Silvano

doi:10.1016/j.ejor.2016.04.030

Cited by 308 publications

(233 citation statements)

References 101 publications

Supporting

Mentioning

222

Contrasting

Unclassified

Order By: Relevance

“…The library provides the 3 840 instances that were randomly generated for the computational experiments reported in [98] …”

Section: Randomly Generated Instancesmentioning

confidence: 99%

“…The code was implemented in Pascal, and can be obtained from the authors, using the address provided in the library. Worth is mentioning that, in spite of its 'age', this program is still working and quite effective (see [98]): at the time of writing, it can be run using compiler fpc (version 3.0.0 for x86 64);…”

Section: Branch-and-boundmentioning

confidence: 99%

“…As the library has been enriched by also providing versions based on the freeware solver SCIP, in Section 3.4 we provide new experiments aiming at evaluating the computational difference between the two versions. In addition, we describe new test instances, that appeared after the publication of [98], and present the corresponding computational experiments.…”

mentioning

confidence: 99%

“…Two recent surveys on exact methods (Delorme et al [98]) and approximation algorithms (Coffman et al [75]) consider in total over 230 different references. In the next section we introduce the computer codes and the visual solver provided by the BPPLIB.…”

mentioning

confidence: 99%

“…In the next section we introduce the computer codes and the visual solver provided by the BPPLIB. In Section 3.3 we describe the available benchmarks: some of them were used in [98] for the computational evaluations of the different exact approaches, using commercial solver Cplex when needed. As the library has been enriched by also providing versions based on the freeware solver SCIP, in Section 3.4 we provide new experiments aiming at evaluating the computational difference between the two versions.…”

mentioning

confidence: 99%

See 4 more Smart Citations

Mathematical models and decomposition algorithms for cutting and packing problems

Delorme¹

2017

4OR-Q J Oper Res

Self Cite

View full text Add to dashboard Cite

“…The library provides the 3 840 instances that were randomly generated for the computational experiments reported in [98] …”

Section: Randomly Generated Instancesmentioning

confidence: 99%

Section: Branch-and-boundmentioning

confidence: 99%

mentioning

confidence: 99%

mentioning

confidence: 99%

mentioning

confidence: 99%

See 3 more Smart Citations

Mathematical models and decomposition algorithms for cutting and packing problems

Delorme¹

2017

4OR-Q J Oper Res

Self Cite

View full text Add to dashboard Cite

Cutting Stock Problem (CSP) applied to Structural Optimization for the minimum waste cost

Cucuzza,

Domaneschi,

Rosso

et al. 2023

ce papers

View full text Add to dashboard Cite

In this study, an optimization method to design simple truss structures for the evaluation of the optimal stock of existing elements is introduced. To achieve this goal, the well‐known Bin Packing Problem (BPP) will be implemented within the structural optimization procedure. Specifically, among all the BPP variants, one of the most common applications in real‐world cases is the Cutting Stock Problem (CSP) in which the objective is to produce dj copies of each item type j by employing the minimum number of bins. In the civil engineering field, structural optimization is often employed aiming to improve the load‐bearing capacity of the structure itself, i.e. maximization of the performance ratio through the minimization of the structure weight. However, this goal doesn't guarantee maximum efficiency in terms of minimization of waste during the industrial production phase. To overcome these limits, authors propose a stock‐constrained structural optimization in which a heuristic search technique is adopted and the best arrangement of bars whit the lowest cut‐off waste is obtained for a 10‐bar‐truss case study. For completeness reasons, a comparison between the solution obtained by the classic minimum weight optimization problem and the stock‐constrained one is discussed.

show abstract

Same‐day deliveries in omnichannel retail: Integrated order picking and vehicle routing with vehicle‐site dependencies

Schubert

Kühn

Holzapfel

2020

Naval Research Logistics

View full text Add to dashboard Cite

Currently, the most common delivery mode offered in online retailing is next‐day delivery. Retailers, however, are investigating whether same‐day deliveries can be offered to online and store customers in order to meet increasing customer requirements. The present paper considers an integrated order picking and vehicle routing problem assuming same‐day delivery in the field of omnichannel retailing. Within this context the paper focuses on the picking and delivery process for large durable consumer goods, for example, consumer electronics and home appliances with the option of associated installation services at the customer's home as well as store deliveries for click‐and‐collect customers and the short‐term replenishment of store inventory. We develop a decision support model and a general variable neighborhood search‐based algorithm that tackle the problem described by considering the tradeoff between picking and delivery costs while ensuring customers' delivery time windows. The results show the benefits of an integrated solution approach amounting to approx. 13% total cost savings on average, compared to a sequential approach typically applied in retail practice. A case study from an internationally operating omnichannel retailer demonstrates the advantages and applicability of the modeling and solution approach suggested.

show abstract

Bin packing and cutting stock problems: Mathematical models and exact algorithms

Cited by 308 publications

References 101 publications

Mathematical models and decomposition algorithms for cutting and packing problems

Mathematical models and decomposition algorithms for cutting and packing problems

Cutting Stock Problem (CSP) applied to Structural Optimization for the minimum waste cost

Same‐day deliveries in omnichannel retail: Integrated order picking and vehicle routing with vehicle‐site dependencies

Contact Info

Product

Resources

About