In-transit freight consolidation of indivisible shipments

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

Research output: Contribution to journalArticle

Abstract

This paper studies the multi-period freight consolidation problem for a third-party logistics (3PL) provider that transships multiple products from multiple suppliers to a single end customer. The shipments are first transported to select consolidation terminals where the 3PL provider aims to consolidate the inbound shipments so as to reduce costs. This imposes a complex decision problem to the 3PL provider since consolidation may require that the inbound shipments spend more time at the terminals, whereas all shipments have prespecified pickup dates and delivery deadlines. Moreover, the shipments picked up from the suppliers are indivisible, that is, a shipment cannot be split into multiple lots and assigned to separate routes. This paper presents a mixed-integer linear programming model and proposes a heuristic for solving the resulting problem. The proposed heuristic partitions the multi-period problem into multiple subproblems by splitting the planning horizon into smaller mutually exclusive units which makes the planning problem relatively insensitive to the length of the planning horizon and hence scalable. The effectiveness of the proposed heuristic is demonstrated via a real-life problem: a close-to-optimal solution for a 360-day planning problem that could not be solved using commercial solvers due to its size is obtained within two hours.

Original languageEnglish (US)
JournalJournal of the Operational Research Society
DOIs
StatePublished - Jan 1 2019

Fingerprint

Consolidation
Planning
Pickups
Linear programming
Logistics
Freight
Heuristics
Costs
Suppliers

Keywords

  • 3PL
  • delivery time window
  • freight consolidation
  • indivisible shipments
  • temporal decomposition

ASJC Scopus subject areas

  • Management Information Systems
  • Strategy and Management
  • Management Science and Operations Research
  • Marketing

Cite this

In-transit freight consolidation of indivisible shipments. / Hanbazazah, Abdulkader S.; Castro, Luis E.; Erkoc, Murat; Shaikh, Nazrul I.

In: Journal of the Operational Research Society, 01.01.2019.

Research output: Contribution to journalArticle

@article{3508cee903aa4db49880213582fdb887,
title = "In-transit freight consolidation of indivisible shipments",
abstract = "This paper studies the multi-period freight consolidation problem for a third-party logistics (3PL) provider that transships multiple products from multiple suppliers to a single end customer. The shipments are first transported to select consolidation terminals where the 3PL provider aims to consolidate the inbound shipments so as to reduce costs. This imposes a complex decision problem to the 3PL provider since consolidation may require that the inbound shipments spend more time at the terminals, whereas all shipments have prespecified pickup dates and delivery deadlines. Moreover, the shipments picked up from the suppliers are indivisible, that is, a shipment cannot be split into multiple lots and assigned to separate routes. This paper presents a mixed-integer linear programming model and proposes a heuristic for solving the resulting problem. The proposed heuristic partitions the multi-period problem into multiple subproblems by splitting the planning horizon into smaller mutually exclusive units which makes the planning problem relatively insensitive to the length of the planning horizon and hence scalable. The effectiveness of the proposed heuristic is demonstrated via a real-life problem: a close-to-optimal solution for a 360-day planning problem that could not be solved using commercial solvers due to its size is obtained within two hours.",
keywords = "3PL, delivery time window, freight consolidation, indivisible shipments, temporal decomposition",
author = "Hanbazazah, {Abdulkader S.} and Castro, {Luis E.} and Murat Erkoc and Shaikh, {Nazrul I.}",
year = "2019",
month = "1",
day = "1",
doi = "10.1080/01605682.2018.1527191",
language = "English (US)",
journal = "Journal of the Operational Research Society",
issn = "0160-5682",
publisher = "Palgrave Macmillan Ltd.",

}

TY - JOUR

T1 - In-transit freight consolidation of indivisible shipments

AU - Hanbazazah, Abdulkader S.

AU - Castro, Luis E.

AU - Erkoc, Murat

AU - Shaikh, Nazrul I.

PY - 2019/1/1

Y1 - 2019/1/1

N2 - This paper studies the multi-period freight consolidation problem for a third-party logistics (3PL) provider that transships multiple products from multiple suppliers to a single end customer. The shipments are first transported to select consolidation terminals where the 3PL provider aims to consolidate the inbound shipments so as to reduce costs. This imposes a complex decision problem to the 3PL provider since consolidation may require that the inbound shipments spend more time at the terminals, whereas all shipments have prespecified pickup dates and delivery deadlines. Moreover, the shipments picked up from the suppliers are indivisible, that is, a shipment cannot be split into multiple lots and assigned to separate routes. This paper presents a mixed-integer linear programming model and proposes a heuristic for solving the resulting problem. The proposed heuristic partitions the multi-period problem into multiple subproblems by splitting the planning horizon into smaller mutually exclusive units which makes the planning problem relatively insensitive to the length of the planning horizon and hence scalable. The effectiveness of the proposed heuristic is demonstrated via a real-life problem: a close-to-optimal solution for a 360-day planning problem that could not be solved using commercial solvers due to its size is obtained within two hours.

AB - This paper studies the multi-period freight consolidation problem for a third-party logistics (3PL) provider that transships multiple products from multiple suppliers to a single end customer. The shipments are first transported to select consolidation terminals where the 3PL provider aims to consolidate the inbound shipments so as to reduce costs. This imposes a complex decision problem to the 3PL provider since consolidation may require that the inbound shipments spend more time at the terminals, whereas all shipments have prespecified pickup dates and delivery deadlines. Moreover, the shipments picked up from the suppliers are indivisible, that is, a shipment cannot be split into multiple lots and assigned to separate routes. This paper presents a mixed-integer linear programming model and proposes a heuristic for solving the resulting problem. The proposed heuristic partitions the multi-period problem into multiple subproblems by splitting the planning horizon into smaller mutually exclusive units which makes the planning problem relatively insensitive to the length of the planning horizon and hence scalable. The effectiveness of the proposed heuristic is demonstrated via a real-life problem: a close-to-optimal solution for a 360-day planning problem that could not be solved using commercial solvers due to its size is obtained within two hours.

KW - 3PL

KW - delivery time window

KW - freight consolidation

KW - indivisible shipments

KW - temporal decomposition

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

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

U2 - 10.1080/01605682.2018.1527191

DO - 10.1080/01605682.2018.1527191

M3 - Article

AN - SCOPUS:85066475051

JO - Journal of the Operational Research Society

JF - Journal of the Operational Research Society

SN - 0160-5682

ER -