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
AN - SCOPUS:84991037363
SN - 1570-1166
VL - 6
SP - 77
EP - 85
JO - Journal of Mathematical Modelling and Algorithms
JF - Journal of Mathematical Modelling and Algorithms
IS - 1
ER -