Online risk-aware pattern adjustment for bin packing problem

Huayan Zhang

doi:10.1016/j.eswa.2025.131074

Online risk-aware pattern adjustment for bin packing problem

2026-01-10

0

PRE

AI

DOI：10.1016/j.eswa.2025.131074

Original

Original request for help

Save

Abstract

En 中文

• A novel method for handling forecast errors in the online bin packing problem. • Risk evaluation of packing patterns based on shadow price analysis. • Formalises the pattern update problem as a Stochastic Multiple Knapsack Problem (SMKP). • Efficient solution of the SMKP using a tailored Fast Genetic Algorithm (FGA) and the Gurobi solver. • State-of-the-art performance demonstrated through comprehensive experiments.

Online risk-aware pattern adjustment for bin packing problem

Abstract

Journal

Organization