Algorithm run logs for 2D strip packing problem

This dataset comprises run logs for algorithms solving 2-dimensional (regular) strip packing problem (2DSP). The 2DSP consists in placing rectangles on an infinite strip of a given width without rectangle overlap and without rectangle rotation. The length of the occupied strip must be minimized. An algorithm run log records how quality of the solution is improved over the algorithm runtime. This kind of logs is used in the studies on performance of algorithms solving 2DSP. The logs are collected in file: results.7z Directory structure The above results.7z archive comprises subdirectories for 49 tested algorithms solving 2DSP, from algorithm name blDA, . . . to algorithm name skTS1. Names of the directories are short names of the algorithms. Directory content Each directory comprises 3306 log files. Each file has name with structure: number_algorithm.log where: number – is the number of the solved instance, algorithm – is the long technical name of the algorithm. The long technical name refers to the same algorithm as the short name of the subdirectory. Example of a log file name: 3305_SHgg_widthDsc_bestFit.log The solved instances from range 0 to 1999 are available from: https://doi.org/10.5281/zenodo.17436228 . Instances with numbers above 2000 are not included in the above repository, as the rights to them belong to their respective authors. File format Logs are text files with at least one line. Each line comprises two numbers: - time when solution was obtained in ns, - length of the strip (objective function). For example, top 3 lines of file 3305_SKts_1_215_215.log are: 129994 239 23006022 232 69730246 231 . . .