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 …

[HTML][HTML] Data-driven preference-based routing and scheduling for activity-based freight transport modelling

A Nadi, N Yorke-Smith, M Snelder, JWC Van Lint… - … Research Part C …, 2024 - Elsevier
Understanding preferences and behaviours in road freight transport is valuable for planning
and analysis. This paper proposes a data-driven vehicle routing and scheduling approach …

A branch-and-cut algorithm for the time-dependent vehicle routing problem with time windows and combinatorial auctions

J Wei, M Poon, Z Zhang - Computers & Operations Research, 2024 - Elsevier
The urban logistics industry typically faces traffic congestion problems that result in variation
of travel times across the day and impose a great challenge in routing design. While …

Manual and robotic storage and picking systems: a literature review

A Silva, LC Coelho, M Darvish… - … : Information Systems and …, 2024 - Taylor & Francis
The rising of e-commerce demands an increase in the performance of warehousing
systems, which are being redesigned to deal with a mass volume of demands to be fulfilled …

Logic-based benders decomposition: theory and applications

J Hooker - 2023 - books.google.com
This book is the first comprehensive guide to logic-based Benders decomposition (LBBD), a
general and versatile method for breaking large, complex optimization problems into …

An accelerated benders decomposition algorithm for the solution of the multi-trip time-dependent vehicle routing problem with time windows

A Fragkogios, Y Qiu, GKD Saharidis… - European Journal of …, 2024 - Elsevier
The logistics companies executing the last mile delivery of goods in urban areas deal every
day with the problem of routing their vehicles, while taking into account multiple trips per …