Purpose: This paper studies a 3-dimensional pallet loading problem considering interlock stacking pattern, box dimensions, humidity, and storage time, where overlapping and overhanging are not allowed. Despite the importance of this problem in the literature, our work provides the first method...

People sometimes exhibit a costly preference for humans relative to algorithms, which is often defined as a domain-general algorithm aversion. I propose it is instead driven by biased evaluations of self and other humans, which occurs more narrowly in domains where identity is threatened and...

This paper proposes a branch-and-bound algorithm (B&B) for the proactive scheduling problem, which incorporates a degree of anticipation for variability in practical projects. First, the resource-constrained proactive scheduling model is formulated. Second, solving its resource-unconstrained...

The Steiner tree problem aims to determine a minimum edge-weighted tree spanning a given set of terminal vertices from a given graph. As a popular model for numerous practical applications, the problem has been the object of two important competitions (the 11th DIMACS Challenge in 2014 and the...

Artificial intelligence (AI) developments enable human capability to deliver the same outcome at a lower cost. This research performs a high-level matching between AI solutions and challenges within the port area by developing a novel academic approach. This way, the matching is carried out more...