Skip to main content

Logic-Based Benders Decomposition for an Inter-modal Transportation Problem

  • 764 Accesses

Part of the Lecture Notes in Computer Science book series (LNTCS,volume 12735)


This paper studies a real-life inter-modal freight transportation problem, comprised by three consecutive stages: disposition where orders are picked up by trucks, transferred and unloaded to a set of warehouses in Central and Eastern Europe, inter-region transport where the orders are packed into trailers, which are shipped to warehouses in Turkey using different inter-region transport modes, and last-mile delivery where the orders unloaded at the warehouses in Turkey are picked up by vans and delivered to their final destination. The objective is to minimise total transport and tardiness cost. After restricting the routes in the disposition stage, we formulate a mixed-integer linear program that captures the entire delivery process. Then, we propose a Benders’ decomposition and prove the validity of a set of optimality cuts and of a subproblem relaxation. We show the impact of this approach on large-scale real instances under user-imposed time limits. We further strengthening the master problem with a set of valid inequalities and speed up the solution of the subproblem using Constraint Programming.


  • Inter-modal transportation
  • Pickup and delivery planning
  • Benders decomposition
  • Integer programming
  • Constraint programming

This research has been supported by the EU through the COG-LO Horizon 2020 project, grant number 769141 and the GSRI through the i@transport project, grant number T2E\(\mathrm {\Delta }\)K00345.

This is a preview of subscription content, access via your institution.

Buying options

USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/978-3-030-78230-6_20
  • Chapter length: 17 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
USD   84.99
Price excludes VAT (USA)
  • ISBN: 978-3-030-78230-6
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   109.99
Price excludes VAT (USA)


  1. Aardal, K.: Reformulation of capacitated facility location problems: how redundant information can help. Ann. Oper. Res. 82, 289–308 (1998)

    MathSciNet  CrossRef  Google Scholar 

  2. Ahkamiraad, A., Wang, Y.: Capacitated and multiple cross-docked vehicle routing problem with pickup, delivery, and time windows. Comput. Ind. Eng. 119, 76–84 (2018)

    CrossRef  Google Scholar 

  3. Azizi, V., Hu, G.: Multi-product pickup and delivery supply chain design with location-routing and direct shipment. Int. J. Prod. Res. 226, 107648 (2020)

    Google Scholar 

  4. Benders, J.F.: Partitioning procedures for solving mixed-variables programming problems. Numer. Math. 4, 238–252 (1962)

    MathSciNet  CrossRef  Google Scholar 

  5. Hooker, J.N.: Planning and scheduling by logic-based benders decomposition. Oper. Res. 55(3), 588–602 (2007)

    MathSciNet  CrossRef  Google Scholar 

  6. Hooker, J.N., Ottosson, G.: Logic-based Benders decomposition. Math. Program. A 96, 33–60 (2003)

    MathSciNet  CrossRef  Google Scholar 

  7. Li, J., Li, Y., Pardalos, P.M.: Multi-depot vehicle routing problem with time windows under shared depot resources. J. Comb. Optim. 31(2), 515–532 (2014).

    MathSciNet  CrossRef  MATH  Google Scholar 

  8. Mahéo, A., Kilby, P., Hentenryck, P.V.: Benders decomposition for the design of a hub and shuttle public transit system. Transp. Sci. 53(1), 77–88 (2019)

    CrossRef  Google Scholar 

  9. Moccia, L., Cordeau, J.-F., Ropke, S., Valentini, M.P.: Modeling and solving a multimodal transportation problem with flexible-time and scheduled services. Networks 57(1), 53–68 (2011)

    MathSciNet  CrossRef  Google Scholar 

  10. Rahmaniani, R., Crainic, T.G., Gendreau, M., Rei, W.: The Benders decomposition algorithm: a literature review. Eur. J. Oper. Res. 259(3), 801–817 (2017)

    MathSciNet  CrossRef  Google Scholar 

  11. Rousseau, L.-M., Gendreau, M., Pesant, G., Focacci, F.: Solving VRPTWs with constraint programming based column generation. Ann. Oper. Res. 130, 199–216 (2004)

    MathSciNet  CrossRef  Google Scholar 

  12. Wu, T.-H., Low, C., Bai, J.-W.: Heuristic solutions to multi-depot location-routing problems. Comput. Oper. Res. 29, 1393–1415 (2002)

    CrossRef  Google Scholar 

  13. Xiong, G., Wang, Y.: Best routes selection in multimodal networks using multi-objective genetic algorithm. J. Comb. Optim. 28(3), 655–673 (2012).

    MathSciNet  CrossRef  MATH  Google Scholar 

  14. Yu, V.F., Jewpanya, P., Redi, A.A.N.P.: Open vehicle routing problem with cross-docking. Comput. Ind. Eng. 94, 6–17 (2016)

    CrossRef  Google Scholar 

Download references

Author information

Authors and Affiliations


Corresponding author

Correspondence to Ioannis Avgerinos .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Verify currency and authenticity via CrossMark

Cite this paper

Avgerinos, I., Mourtos, I., Zois, G. (2021). Logic-Based Benders Decomposition for an Inter-modal Transportation Problem. In: Stuckey, P.J. (eds) Integration of Constraint Programming, Artificial Intelligence, and Operations Research. CPAIOR 2021. Lecture Notes in Computer Science(), vol 12735. Springer, Cham.

Download citation

  • DOI:

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-78229-0

  • Online ISBN: 978-3-030-78230-6

  • eBook Packages: Computer ScienceComputer Science (R0)