Tug scheduling for hinterland barge transport: A branch-and-price approach

L Zhen, K Wang, S Wang, X Qu - European Journal of Operational …, 2018 - Elsevier
In a hinterland barge transport system, barges are usually not self-propelled and need to be
towed or pushed by tugs. This study investigates a tug-scheduling problem at a seaport that …

Integrated warehouse assignment and carton configuration optimization using deep clustering-based evolutionary algorithms

JN Das, MK Tiwari, AK Sinha, V Khanzode - Expert systems with …, 2023 - Elsevier
A rapid rise in e-commerce has forced logistic companies to invest in efficiency and reduce
last-mile delivery costs. A significant part of last-mile delivery operations is the cartonization …

A branch-and-price algorithm for the two-dimensional vector packing problem

L Wei, M Lai, A Lim, Q Hu - European Journal of Operational Research, 2020 - Elsevier
The two-dimensional vector packing problem is a well-known generalization of the classical
bin packing problem. It considers two attributes for each item and bin. Two capacity …

Lower and upper bounding procedures for the bin packing problem with concave loading cost

M Haouari, M Mhiri - European Journal of Operational Research, 2024 - Elsevier
We address the one-dimensional bin packing problem with concave loading cost (BPPC),
which commonly arises in less-than-truckload ship** services. Our contribution is twofold …

Contextual bandits learning-based branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with conflicts and time windows

Y Chen, M Gao, Z Zhang, J Li, MIM Wahab… - … Research Part E …, 2025 - Elsevier
A two-dimensional vector packing problem with conflicts and time windows (2DVPPCTW) is
investigated in this study. It consists of packing items into the minimum number of bins, and …

Stabilized branch-and-price algorithms for vector packing problems

K Heßler, T Gschwind, S Irnich - European Journal of Operational Research, 2018 - Elsevier
This paper considers packing and cutting problems in which a packing/cutting pattern is
constrained independently in two or more dimensions. Examples are restrictions with …

An exact algorithm for two-dimensional vector packing problem with volumetric weight and general costs

T Wang, Q Hu, A Lim - European Journal of Operational Research, 2022 - Elsevier
The volumetric weight of a package has become an essential factor in calculating the
delivery cost of shipments in the international logistics market. In this work, we extend the …

Single batch machine scheduling with dual setup times for autoclave molding manufacturing

S Zheng, N **e, Q Wu - Computers & Operations Research, 2021 - Elsevier
Batch scheduling involves a machine that can process several jobs simultaneously. The
existing literature mainly focuses on the batch-size-dependent setup time. However, setup …

An exact approach for bi-objective non-identical batch processing machines scheduling

S Zheng, N **e, Q Wu - Annals of Operations Research, 2025 - Springer
Batch scheduling aims to allocate jobs into several batches on batch-processing machines,
and thus increases the production efficiency and has pervasive applications. This paper …

Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows

M Gao, Y Chen, J Li, MIM Wahab - Computers & Operations Research, 2023 - Elsevier
This paper introduces the two-dimensional vector packing problem with time windows
(2DVPPTW). It packs all items into identical bins to minimize the number of used bins. Items …