Skip to content

Combinatorial Arcflow Model for the Temporal Bin Packing Problem with Fire-Ups

Notifications You must be signed in to change notification settings

wotzlaff/tbpp-caf

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

21 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Combinatorial Arcflow Model for the Temporal Bin Packing Problem with Fire-Ups

This repository contains compact models for the Temporal Bin Packing Problem with Fire-Ups. The problem was introduced in [1]. Some improvements for the compact models were proposed in [2], [3], [4].

The method in this repository implements the model of a combinatorial flow-based formulation. A description of the details will be published soon [5].

Examples

Results for the benchmark instances can be computed using the script solve_benchmarks.py specifying a subset of instances (a1, a2, b1, b2) and a problem setting (without_fu or with_fu).

Installation

The file environment.yml contains a description of all required packages. You can create a clean Anaconda environment from this file using

conda env create

and activate it using

conda activate grb

Afterwards, use

python -m pip install -e .

to setup a link to the tbpp_caf package such that it can be loaded easily.

Data of Benchmark Instances

The data for the benchmark instances can be found here. After cloning this repository move the data directory to data or create a symbolic link.

References

[1] Aydın, N., Muter, İ., & Birbil, Ş. İ. (2020). Multi-objective temporal bin packing problem: An application in cloud computing. Computers & Operations Research, 121, 104959. https://doi.org/10.1016/j.cor.2020.104959

[2] Martinovic, J., Strasdat, N., & Selch, M. (2021). Compact integer linear programming formulations for the temporal bin packing problem with fire-ups. Computers & Operations Research, 105288. https://doi.org/10.1016/j.cor.2021.105288

[3] Martinovic, J., Strasdat, N., Valério de Carvalho, J., & Furini, F. (2021). Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups. Optimization Letters, 1-26. https://doi.org/10.1007/s11590-021-01825-x

[4] Martinovic, J. & Strasdat, N. (2024). Theoretical Insights and a New Class of Valid Inequalities for the Temporal Bin Packing Problem with Fire-Ups. Pesquisa Operacional, 44, e283503. https://doi.org/10.1590/0101-7438.2023.043.00283503

[5] Martinovic, J., Strasdat, N., Valério de Carvalho, J., & Furini, F. (2023). A Combinatorial Flow-based Formulation for Temporal Bin Packing Problems. European Journal of Operational Research, Volume 307, Issue 2. https://doi.org/10.1016/j.ejor.2022.10.012