Pattern based learning and optimisation through pricing for bin packing problem
<|reference_start|>Pattern based learning and optimisation through pricing for bin packing problem: As a popular form of knowledge and experience, patterns and their identification have been critical tasks in most data mining applications. However, as far as we are aware, no study has systematically examined the dynamics of pattern values and their reuse under varying conditions. We argue that when problem conditions such as the distributions of random variables change, the patterns that performed well in previous circumstances may become less effective and adoption of these patterns would result in sub-optimal solutions. In response, we make a connection between data mining and the duality theory in operations research and propose a novel scheme to efficiently identify patterns and dynamically quantify their values for each specific condition. Our method quantifies the value of patterns based on their ability to satisfy stochastic constraints and their effects on the objective value, allowing high-quality patterns and their combinations to be detected. We use the online bin packing problem to evaluate the effectiveness of the proposed scheme and illustrate the online packing procedure with the guidance of patterns that address the inherent uncertainty of the problem. Results show that the proposed algorithm significantly outperforms the state-of-the-art methods. We also analysed in detail the distinctive features of the proposed methods that lead to performance improvement and the special cases where our method can be further improved.<|reference_end|>
@article{zhang2024pattern,
    title={Pattern based learning and optimisation through pricing for bin packing
  problem},
    author={Huayan Zhang, Ruibin Bai, Tie-Yan Liu, Jiawei Li, Bingchen Lin,
  Jianfeng Ren},
    journal={arXiv preprint arXiv:2409.04456},
    year={2024},
    archivePrefix={arXiv},
    eprint={2409.04456},
    primaryClass={math.OC cs.AI cs.CV cs.LG}
}