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 journalArticle

3 Citations (Scopus)

Abstract

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
Volume11
Issue number2
DOIs
StatePublished - Apr 1 2018

Fingerprint

Consolidation
Decomposition
Integer programming
Freight transportation
Logistics
Benders decomposition
Freight
Costs
Due dates

Keywords

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

ASJC Scopus subject areas

  • Management Information Systems
  • Information Systems

Cite this

A redesigned benders decomposition approach for large-scale in-transit freight consolidation operations. / Hanbazazah, Abdulkader S.; Abril, Luis E.; Shaikh, Nazrul I; Erkoc, Murat.

In: International Journal of Information Systems and Supply Chain Management, Vol. 11, No. 2, 01.04.2018, p. 1-15.

Research output: Contribution to journalArticle

@article{13937c4a671544e9ba970986466763b3,
title = "A redesigned benders decomposition approach for large-scale in-transit freight consolidation operations",
abstract = "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.",
keywords = "Benders Decomposition, Freight Consolidation, Mathematical Programming, Third Party Logistics",
author = "Hanbazazah, {Abdulkader S.} and Abril, {Luis E.} and Shaikh, {Nazrul I} and Murat Erkoc",
year = "2018",
month = "4",
day = "1",
doi = "10.4018/IJISSCM.2018040101",
language = "English (US)",
volume = "11",
pages = "1--15",
journal = "International Journal of Information Systems and Supply Chain Management",
issn = "1935-5726",
publisher = "The Information Resources Management Association (IRMA)",
number = "2",

}

TY - JOUR

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

AU - Hanbazazah, Abdulkader S.

AU - Abril, Luis E.

AU - Shaikh, Nazrul I

AU - Erkoc, Murat

PY - 2018/4/1

Y1 - 2018/4/1

N2 - 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.

AB - 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.

KW - Benders Decomposition

KW - Freight Consolidation

KW - Mathematical Programming

KW - Third Party Logistics

UR - http://www.scopus.com/inward/record.url?scp=85042911512&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85042911512&partnerID=8YFLogxK

U2 - 10.4018/IJISSCM.2018040101

DO - 10.4018/IJISSCM.2018040101

M3 - Article

AN - SCOPUS:85042911512

VL - 11

SP - 1

EP - 15

JO - International Journal of Information Systems and Supply Chain Management

JF - International Journal of Information Systems and Supply Chain Management

SN - 1935-5726

IS - 2

ER -