Integrated shipment dispatching and packing problems

A case study

Andrea Attanasio, Antonio Fuduli, Gianpaolo Ghiani, Chefi Triki

Research output: Contribution to journalArticle

11 Citations (Scopus)

Abstract

In this paper we examine a consolidation and dispatching problem motivated by a multinational chemical company which has to decide routinely the best way of delivering a set of orders to its customers over a multi-day planning horizon. Every day the decision to be made includes order consolidation, vehicle dispatching as well as load packing into the vehicles. We develop a heuristic based on a cutting plane framework, in which a simplified Integer Linear Program (ILP) is solved to optimality. Since the ILP solution may correspond to a infeasible loading plan, a feasibility check is performed through a tailored heuristic for a three-dimensional bin packing problem with side constraints. If this test fails, a cut able to remove the infeasible solution is generated and added to the simplified ILP. Then the procedure is iterated. Computational results show that our procedure allows achieving remarkable cost savings.

Original languageEnglish
Pages (from-to)77-85
Number of pages9
JournalJournal of Mathematical Modelling and Algorithms
Volume6
Issue number1
DOIs
Publication statusPublished - 2007

Fingerprint

Dispatching
Packing Problem
Integer Program
Linear Program
Consolidation
Bins
Heuristics
Bin Packing Problem
Cutting Planes
Planning
Packing
Computational Results
Horizon
Optimality
Customers
Costs
Industry
Three-dimensional

Keywords

  • Bin packing
  • Shipment consolidation
  • Vehicle dispatching

ASJC Scopus subject areas

  • Modelling and Simulation
  • Applied Mathematics

Cite this

Integrated shipment dispatching and packing problems : A case study. / Attanasio, Andrea; Fuduli, Antonio; Ghiani, Gianpaolo; Triki, Chefi.

In: Journal of Mathematical Modelling and Algorithms, Vol. 6, No. 1, 2007, p. 77-85.

Research output: Contribution to journalArticle

Attanasio, Andrea ; Fuduli, Antonio ; Ghiani, Gianpaolo ; Triki, Chefi. / Integrated shipment dispatching and packing problems : A case study. In: Journal of Mathematical Modelling and Algorithms. 2007 ; Vol. 6, No. 1. pp. 77-85.
@article{1e8f9c3e3c1b475fbd01f6d5ad508191,
title = "Integrated shipment dispatching and packing problems: A case study",
abstract = "In this paper we examine a consolidation and dispatching problem motivated by a multinational chemical company which has to decide routinely the best way of delivering a set of orders to its customers over a multi-day planning horizon. Every day the decision to be made includes order consolidation, vehicle dispatching as well as load packing into the vehicles. We develop a heuristic based on a cutting plane framework, in which a simplified Integer Linear Program (ILP) is solved to optimality. Since the ILP solution may correspond to a infeasible loading plan, a feasibility check is performed through a tailored heuristic for a three-dimensional bin packing problem with side constraints. If this test fails, a cut able to remove the infeasible solution is generated and added to the simplified ILP. Then the procedure is iterated. Computational results show that our procedure allows achieving remarkable cost savings.",
keywords = "Bin packing, Shipment consolidation, Vehicle dispatching",
author = "Andrea Attanasio and Antonio Fuduli and Gianpaolo Ghiani and Chefi Triki",
year = "2007",
doi = "10.1007/s10852-006-9050-5",
language = "English",
volume = "6",
pages = "77--85",
journal = "Journal of Mathematical Modelling and Algorithms",
issn = "1570-1166",
publisher = "Springer Netherlands",
number = "1",

}

TY - JOUR

T1 - Integrated shipment dispatching and packing problems

T2 - A case study

AU - Attanasio, Andrea

AU - Fuduli, Antonio

AU - Ghiani, Gianpaolo

AU - Triki, Chefi

PY - 2007

Y1 - 2007

N2 - In this paper we examine a consolidation and dispatching problem motivated by a multinational chemical company which has to decide routinely the best way of delivering a set of orders to its customers over a multi-day planning horizon. Every day the decision to be made includes order consolidation, vehicle dispatching as well as load packing into the vehicles. We develop a heuristic based on a cutting plane framework, in which a simplified Integer Linear Program (ILP) is solved to optimality. Since the ILP solution may correspond to a infeasible loading plan, a feasibility check is performed through a tailored heuristic for a three-dimensional bin packing problem with side constraints. If this test fails, a cut able to remove the infeasible solution is generated and added to the simplified ILP. Then the procedure is iterated. Computational results show that our procedure allows achieving remarkable cost savings.

AB - In this paper we examine a consolidation and dispatching problem motivated by a multinational chemical company which has to decide routinely the best way of delivering a set of orders to its customers over a multi-day planning horizon. Every day the decision to be made includes order consolidation, vehicle dispatching as well as load packing into the vehicles. We develop a heuristic based on a cutting plane framework, in which a simplified Integer Linear Program (ILP) is solved to optimality. Since the ILP solution may correspond to a infeasible loading plan, a feasibility check is performed through a tailored heuristic for a three-dimensional bin packing problem with side constraints. If this test fails, a cut able to remove the infeasible solution is generated and added to the simplified ILP. Then the procedure is iterated. Computational results show that our procedure allows achieving remarkable cost savings.

KW - Bin packing

KW - Shipment consolidation

KW - Vehicle dispatching

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

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

U2 - 10.1007/s10852-006-9050-5

DO - 10.1007/s10852-006-9050-5

M3 - Article

VL - 6

SP - 77

EP - 85

JO - Journal of Mathematical Modelling and Algorithms

JF - Journal of Mathematical Modelling and Algorithms

SN - 1570-1166

IS - 1

ER -