Logic-based Benders decomposition

JN Hooker, G Ottosson - Mathematical Programming, 2003 - Springer
Benders decomposition uses a strategy of``learning from one's mistakes.''The aim of this
paper is to extend this strategy to a much larger class of problems. The key is to generalize …

Heterogeneous multi-depot collaborative vehicle routing problem

Q Zhang, Z Wang, M Huang, Y Yu, SC Fang - Transportation Research Part …, 2022 - Elsevier
Collaborative vehicle routing of multiple logistics providers is an important component of
horizontal logistic collaboration that generates economic and societal benefits. Existing …

Novel formulations and logic-based benders decomposition for the integrated parallel machine scheduling and location problem

Y Li, JF Côté, L Callegari-Coelho… - INFORMS journal on …, 2022 - pubsonline.informs.org
We investigate the discrete parallel machine scheduling and location problem, which
consists of locating multiple machines to a set of candidate locations, assigning jobs from …

[HTML][HTML] Solving the parallel processor scheduling and bin packing problems with contiguity constraints: Mathematical models and computational studies

FB Akçay, M Delorme - European Journal of Operational Research, 2024 - Elsevier
The parallel processor scheduling and bin packing problems with contiguity constraints are
important in the field of combinatorial optimization because both problems can be used as …

Logic-based Benders decomposition for the preemptive flexible job-shop scheduling problem

C Juvin, L Houssin, P Lopez - Computers & Operations Research, 2023 - Elsevier
In this paper, we focus on exact methods to solve the preemptive flexible job-shop
scheduling problem with makespan minimisation objective function. Mathematical and …

Order assignment and scheduling under processing and distribution time uncertainty

Y Li, JF Côté, LC Coelho, C Zhang, S Zhang - European Journal of …, 2023 - Elsevier
In response to increasingly fierce competition and highly customized demands, many
companies adopt a distributed production model but manage their orders in a centralized …

A branch-and-repair method for three-dimensional bin selection and packing in e-commerce

P Fontaine, S Minner - Operations research, 2023 - pubsonline.informs.org
The number of shipped parcels is continuously growing and e-commerce retailers and
logistics service providers are seeking to improve logistics, particularly last-mile delivery …

[HTML][HTML] Exact decomposition approaches for a single container loading problem with stacking constraints and medium-sized weakly heterogeneous items

M Delorme, J Wagenaar - Omega, 2024 - Elsevier
We consider a real-world three-dimensional container loading problem in which the
objective is to maximize the volume of the items packed into a single vehicle. While …

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 shipping services. Our contribution is twofold …

Variable neighborhood genetic algorithm for multi-order multi-bin open packing optimization

J Yang, H Liu, K Liang, L Zhou, J Zhao - Applied Soft Computing, 2024 - Elsevier
In the rapidly evolving e-commerce landscape, efficient packaging and logistics reduce
costs and enhance customer satisfaction. This study addresses the problem of dynamic bin …