Imbalance between fast-growing transport demand and limited network supply has resulted in severe congestion in many transport networks. Increasing network supply or reducing transport demand could mitigate congestion, but these remedies are usually associated with high implementation cost....

Inspired by an old adage "Gold corner, silver side and strawy void", and improved by a new observation "Maximum value in diamond cave", a new heuristic approach is proposed for solving the three-dimensional single container loading problem. Differing from several previous approaches, its key...

This paper investigates the relationships between coherent (convex) risk measures and Choquet expectations under the g-expectations framework. We deduce that convex risk measures can be dominated by Choquet expectations if, and only if they are coherent risk measures.

Packing problems are a type of fundamental global optimization problem with many real-world applications. In this paper, we propose a new variant of three-dimensional (3D) packing problem, called the Single Cylindrical Packing Problem with Cylindrical Items (SCPP-CI), which involves packing as...

The rectangle packing area minimization problem is a key sub-problem of floorplanning in VLSI design. This problem places a set of axis aligned two-dimensional rectangular items of given sizes onto a rectangular plane such that no two items overlap and the area of the enveloping rectangle is...