A redesigned benders decomposition approach for large-scale in-transit freight consolidation operations

Abdulkader S. Hanbazazah, Luis E. Abril, Nazrul I. Shaikh, Murat Erkoc

Research output: Contribution to journalArticlepeer-review

3 Scopus citations


The growth in online shopping and third-party logistics has caused a revival of interest in finding optimal solutions to the large-scale, in-transit freight consolidation problem. Given the shipment date, size, origin, destination, and due dates of multiple shipments distributed over space and time, the problem requires determining when to consolidate some of these shipments into one shipment at an intermediate consolidation point so as to minimize shipping costs while satisfying the due date constraints. In this article, the authors develop a mixed-integer programming formulation for a multi-period freight consolidation problem that involves multiple products, suppliers, and potential consolidation points. Benders decomposition is then used to replace a large number of integer freight-consolidation variables by a small number of continuous variables that reduce the size of the problem without impacting optimality. The results show that Benders decomposition provides a significant scale-up in the performance of the solver. The authors demonstrate their approach using a large-scale case with more than 27.5 million variables and 9.2 million constraints.

Original languageEnglish (US)
Pages (from-to)1-15
Number of pages15
JournalInternational Journal of Information Systems and Supply Chain Management
Issue number2
StatePublished - Apr 1 2018


  • Benders Decomposition
  • Freight Consolidation
  • Mathematical Programming
  • Third Party Logistics

ASJC Scopus subject areas

  • Management Information Systems
  • Information Systems


Dive into the research topics of 'A redesigned benders decomposition approach for large-scale in-transit freight consolidation operations'. Together they form a unique fingerprint.

Cite this