We present an algorithm selection benchmark based on optimal search algorithms for solving the container pre-marshalling problem (CPMP), an NP-hard problem from the field of container terminal optimization. Novel features are introduced and then systematically expanded through the recently proposed approach of latent feature analysis. The CPMP benchmark is interesting, as it involves a homogeneous set of parameterized algorithms that nonetheless result in a diverse range of performances. We present computational results using a state-of-the-art portfolio technique, thus providing a baseline for the benchmark.
CITATION STYLE
Tierney, K., & Malitsky, Y. (2015). An algorithm selection benchmark of the container pre-marshalling problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8994, pp. 17–22). Springer Verlag. https://doi.org/10.1007/978-3-319-19084-6_2
Mendeley helps you to discover research relevant for your work.