Integrated shipment dispatching and packing problems: A case study

Andrea Attanasio*, Antonio Fuduli, Gianpaolo Ghiani, Chefi Triki

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

20 Citations (Scopus)


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
Issue number1
Publication statusPublished - 2007
Externally publishedYes


  • Bin packing
  • Shipment consolidation
  • Vehicle dispatching

ASJC Scopus subject areas

  • Modelling and Simulation
  • Applied Mathematics


Dive into the research topics of 'Integrated shipment dispatching and packing problems: A case study'. Together they form a unique fingerprint.

Cite this