Bin packing with lexicographic objectives for loading weight- and volume-constrained trucks in a direct-shipping system

Abstract

We consider a packing problem that arises in a direct-shipping system in the food and beverage industry: Trucks are the containers, and products to be distributed are the items. The packing is constrained by two independent quantities, weight (e.g., measured in kg) and volume (number of pallets). Additionally, the products are grouped into the three categories: standard, cooled, and frozen (the latter two require refrigerated trucks). Products of different categories can be transported in one truck using separated zones, but the cost of a truck depends on the transported product categories. Moreover, splitting orders of a product should be avoided so that (un-)loading is simplified. As a result, we seek for a feasible packing optimizing the following objective functions in a strictly lexicographic sense: minimize the (1) total number of trucks; (2) number of refrigerated trucks; (3) number of refrigerated trucks which contain frozen products; (4) number of refrigerated trucks which also transport standard products; (5) and minimize splitting. This is a real-world application of a bin-packing problem with cardinality constraints a.k.a. the two-dimensional vector packing problem with additional constraints. We provide a heuristic and an exact solution approach. The heuristic meta-scheme considers the multi-compartment and item fragmentation features of the problem and applies various problem-specific heuristics. The exact solution algorithm covering all five stages is based on branch-and-price using stabilization techniques exploiting dual-optimal inequalities. Computational results on real-world and difficult self-generated instances prove the applicability of our approach.

Unbalanced penalization: a new approach to encode inequality constraints of combinatorial problems for quantum optimization algorithms

“…there is no pseudo-polynomial algorithm to solve this problem [44]. The problem has many real-world applications such as loading trucks with a weight restriction [45], container scheduling [46], or design of FPGA chips [47]. Its formulation is given by…”

Partial Dominance in Branch-Price-and-Cut for the Basic Multicompartment Vehicle-Routing Problem

“…The basic multiple-compartment vehicle-routing problem (BMCVRP) that we study here assumes that the vehicle fleet is homogeneous and that each vehicle has at least two separate loading spaces (called compartments) of fixed size. It is not allowed to split a customer's demand and load only parts of the demand into different compartments (either because goods are bulky or for operational/handling reasons, see Ostermeier et al (2018); Cherkesly and Gschwind (2020); Heßler et al (2021). The literature on multicompartment vehicle routing is extensive, but excellent surveys are available, e.g., by Coelho and Laporte (2015) and Ostermeier et al (2021).…”

A Reduced Variable Neighborhood Search Approach to the Heterogeneous Vector Bin Packing Problem

“…Within the second type they discussed offline and online vector bin packing, Vector knapsack, Vector scheduling and Vector covering problems. The specific 2DHom-VBPP with different categories of products (standard, cooled and frozen) that require separated zones in a truck while avoiding splitting orders with several goals (minimizing the total number of trucks, the number of refrigerated trucks which contain frozen and standard products and minimizing splitting), was considered by Heßler et al [20]. Another variant of 2DHom-VBPP, where a price of a bin depends on the total mass of items in it, was considered and solved using a memetic algorithm by Hu et al [21].…”