Solving Bin Packing Problems Using VRPSolver Models

Using VRPSolver to efficiently solve the Differential Harvest Problem

“…The binary variables x k a , a ∈ A k , k ∈ K indicates if arc a is used in the graph G k . Similarly to [16], we give in model 2 the following complete formulation used to model DHP with VRPSolver. First, the definition for graphs G k are recalled, then the ILP formulation of the Restricted Master Problem is given as well as the mapping (the M function) link between arcs a ∈ A k and binary variables x k a :…”

New exact and heuristic algorithms to solve the prize-collecting job sequencing problem with one common and multiple secondary resources

“…After performing the previous branching strategy, we may end up with a fractional solution. In that case, we branch over accumulated consumption of resource 0 (Pessoa et al, 2021). Let Q S a be the accumulated consumption of resource 0 at the origin of arc a in schedule S (i.e., the time at which the current occurrence of the job associated with a starts using the main resource).…”

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

“…The authors used the underlying column-generation procedure with the extended master program stabilized by dual-optimal inequalities that were added from the beginning or dynamically. Branch-cut-and-price algorithms, defined as models for VRPSolver (a generic solver for vehicle routing problems) were applied to the classical bin packing problem, as well as vector packing, variable sized bin packing, and variable sized bin packing with optional items by Pessoa et al [28]. A consistent neighborhood search was developed for solving the one-dimensional bin packing problem and then applied to the 2DHom-VBPP by Buljubašić and Vasquez [7].…”