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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Agbegha, G.Y., Ballou, R.H., Mathur, K.: Optimizing auto-carrier loading. Transp. Sci. 32(1), 174–188 (1998)
Bertazzi, L., Bertsekas, D.P., Speranza, M.G.: Optimal and neuro-dynamic programming solutions for a stochastic inventory transportation problem. In: Kischka P., Leopold-Wildburger U., Mohring, R.H. Radermacher F.J. (eds.) Models, Methods and Decision Support for Management, pp. 65–78. Physica-Verlag (2001)
Bertazzi, L., Speranza, M.G.: Models and algorithms for the minimization of inventory and transportation costs: a survey. In: Speranza, M.G., Staehly, P. (eds.) New Trends in Distribution Logistics Lecture Notes in Economics and Mathematical Systems, vol. 480, pp. 137–157. Springer, Berlin Heidelberg New York (1999)
Bertazzi, L., Paletta, G., Speranza, M.G.: Minimizing the total cost in an integrated vendor-managed inventory System. J. Heur. 11(5–6) (2005)
Crainic, T.G., Laporte, G.: Planning models for freight transportation. Eur. J. Oper. Res. 97, 409–438 (1997)
Crainic, T.G.: Long-haul freight transportation. In: Hall, R.W. (ed.) Handbook of Transportation Science, pp. 451–516. Kluwer, Norwell, Massachussets (2003)
Dowsland, K.A., Dowsland, W.B.: Packing problems. Eur. J. Oper. Res. 56, 2–14 (1992)
Farvolden, J.M., Powell, W.B.: Subgradient optimization for the service network design problem. Transp. Sci. 28(3), 256–272 (1996)
Golden, B.L., Assad, A.A. (eds.): Vehicle Routing: Methods and Studies. North-Holland, Amsterdam (1988)
Iori, M., Salazar Gonzalez, J.J., Vigo, D.: An exact approach for the vehicle routing problem with two-dimensional loading constraints. Report OR-04-6, University of Bologna, Italy (2004)
Laporte, G.: The vehicle routing problem: an overview of exact and approximate algorithms. Eur. J. Oper. Res. 59, 345–358 (1992)
Lodi, A., Martello, S., Monaci, M.: Two-dimensional packing problems: a survey. Eur. J. Oper. Res. 141(2), 241–252 (2002)
Lodi, A., Martello, S., Vigo, D.: TSpack: a unified tabu search code for multi-dimensional bin packing problems. Ann. Oper. Res. 131(1–4), 203–213 (2004)
Powell, W.B.: A local improvement heuristic for the design of less-than-truckload motor carrier networks. Transp. Sci. 20(4), 246–257 (1986)
Sarmiento, A.M., Nagi, R.: A review of integrated analysis of production distribution systems. IIE Trans. 31, 1061–1074 (1999)
Tadei, R., Perboli, G., Della Croce, F.: A heuristic algorithm for the Auto-Carrier transportation problem. Transp. Sci. 36(1), 55–62 (2002)
Toth, P., Vigo, D. (eds.): The Vehicle Routing Problem Monographs on Discrete Mathematics and Applications S.I.A.M., Philadelpia, Pennsylvania (2002)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Attanasio, A., Fuduli, A., Ghiani, G. et al. Integrated Shipment Dispatching and Packing Problems: a Case Study. J Math Model Algor 6, 77–85 (2007). https://doi.org/10.1007/s10852-006-9050-5
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10852-006-9050-5