This paper addresses an inconsistency in various definitions of supported non‐dominated points within multi‐objective integer linear optimization problems (MOILPs). MOILP problems are known to contain supported and unsupported non‐dominated points, with the latter typically outnumbering...

For some NP-hard lotsizing problems, many different heuristics exist, but they have different solution qualities and computation times depending on the characteristics of the instance. The computation times of the individual heuristics increase significantly with the problem size, so that...

This study focuses on optimizing last-mile delivery in e-commerce by balancing cost efficiency and customer preferences, particularly for mixed perishable and non-perishable goods distribution. As online grocery shopping grows, ensuring the timely and efficient delivery of perishable products...