An ILP-based exact approach for solving the variable cost and size bin packing problem with time-dependent cost modeling the shared satellite-based last-mile delivery
| Year of publication: |
2025
|
|---|---|
| Authors: | Bargetto, Roberto ; Bruni, Maria Elena ; Perboli, Guido |
| Published in: |
Computers & operations research : an international journal. - Amsterdam [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 1499736-8. - Vol. 180.2025, Art.-No. 107075, p. 1-12
|
| Subject: | Bin packing | Exact algorithm | Integer linear programming | Last-mile delivery | Variable cost and size bin packing | Theorie | Theory | Packproblem | Packing problem | Algorithmus | Algorithm | Heuristik | Heuristics | Mathematische Optimierung | Mathematical programming |
-
A new branch-and-price-and-cut algorithm for one-dimensional bin-packing problems
Wei, Lijun, (2020)
-
Enhanced pseudo-polynomial formulations for bin packing and cutting stock problems
Delorme, Maxence, (2020)
-
Element-capacity difference algorithm for optimal bin packing
Shah, Deep, (2019)
- More ...
-
A machine learning optimization approach for last-mile delivery and third-party logistics
Bruni, Maria Elena, (2023)
-
Perboli, Guido, (2021)
-
A bi-level approach for last-mile delivery with multiple satellites
Bruni, Maria Elena, (2023)
- More ...