Abstract
The integration of production and distribution decisions presents a challenging problem for manufacturers trying to optimize their supply chain. At the planning level, the immediate goal is to coordinate production, inventory, and delivery to meet customer demand so that the corresponding costs are minimized. Achieving this goal provides the foundations for streamlining the logistics network and for integrating other operational and financial components of the system. In this paper, a model is presented that includes a single production facility, a set of customers with time varying demand, a finite planning horizon, and a fleet of vehicles for making the deliveries. Demand can be satisfied from either inventory held at the customer sites or from daily product distribution. In the most restrictive case, a vehicle routing problem must be solved for each time period. The decision to visit a customer on a particular day could be to restock inventory, meet that day’s demand or both. In a less restrictive case, the routing component of the model is replaced with an allocation component only.
A procedure centering on reactive tabu search is developed for solving the full problem. After a solution is found, path relinking is applied to improve the results. A novel feature of the methodology is the use of an allocation model in the form of a mixed integer program to find good feasible solutions that serve as starting points for the tabu search. Lower bounds on the optimum are obtained by solving a modified version of the allocation model. Computational testing on a set of 90 benchmark instances with up to 200 customers and 20 time periods demonstrates the effectiveness of the approach. In all cases, improvements ranging from 10–20% were realized when compared to those obtained from an existing greedy randomized adaptive search procedure (GRASP). This often came at a three- to five-fold increase in runtime, however.
Article PDF
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Avoid common mistakes on your manuscript.
References
Abdelmaguid, T. F., & Dessouky, M. M. (2006). A genetic algorithm approach to the integrated inventory–distribution problem. International Journal of Production Research, 44(21), 4445–4464.
Anily, S., & Federgruen, A. (1993). Two-echelon distribution systems with vehicle routing costs and central inventories. Operations Research, 41(1), 37–47.
Bard, J. F., Huang, L., Jaillet, P., & Dror, M. (1998). A decomposition approach to the inventory routing problem with satellite facilities. Transportation Science, 32(2), 189–203.
Boudia, M., Louly, M. A. O., & Prins, C. (2006). A memetic algorithm with population management for a production–distribution problem. In A. Doglui, G. Morel, C.E. Pereira (Eds.), 12th IFAC symposium on information control problems in manufacturing (Vol. 3, pp. 541–546). Saint-Etienne, France, 17–19 May.
Boudia, M., Louly, M. A. O., & Prins, C. (2007). A reactive grasp and path relinking for a combined production–distribution problem. Computers & Operations Research, 34(11), 3402–3419.
Carlton, B. W., & Barnes, J. W. (1996). Solving the traveling salesman problem with time windows using tabu search. IIE Transactions on Scheduling & Logistics, 28(8), 617–629.
Cetinkaya, S., Mutlu, F., & Lee, C.-Y. (2006). A comparison of outbound dispatch policies for integrated inventory and transportation decisions. European Journal of Operational Research, 171(3), 1094–1112.
Chandra, P., & Fisher, M. L. (1994). Coordination of production and distribution planning. European Journal of Operational Research, 72(3), 503–517.
Dror, M., & Ball, M. (1987). Inventory/routing: reduction from an annual to a short period problem. Naval Research Logistics Quarterly, 34(4), 891–905.
Federgruen, A., & Tzur, M. (1999). Time-partitioning heuristics: application to one warehouse, multiitem, multiretailer lot-sizing problems. Naval Research Logistics, 46(5), 463–486.
Gaudioso, M., & Paletta, G. (1992). A heuristic for the periodic vehicle routing problem. Transportation Science, 26(2), 86–92.
Glover, F., & Laguna, M. (1997). Tabu search. Norwell: Kluwer.
Golden, B., Assad, A., & Dahl, R. (1984). Analysis of a large scale vehicle routing problem with an inventory component. Large Scale Systems, 7(2-3), 181–190.
Gutiérrez, J., Sedeño-Noda, A., Colebrook, M., & Sicilia, J. (2007). A polynomial algorithm for the production/ordering planning problem with limited storage. Computers & Operations Research, 34(4), 934–937.
Herer, Y. T., Tzur, M., & Yucesan, E. (2006). The multilocation transshipment problem. IIE Transactions on Scheduling & Logistics, 38, 185–200.
Laporte, G. (1992). The vehicle routing problem: An overview of exact and approximate algorithms. European Journal of Operational Research, 59(3), 345–358.
Lei, L., Liu, S., Ruszczynski, A., & Park, S. (2006). On the integrated production, inventory, and distribution routing problem. IIE Transactions on Scheduling & Logistics, 38(11), 955–970.
Mourgaya, M., & Vanderbeck, F. (2007). Column generation based heuristic for tactical planning in multi-period vehicle routing. European Journal of Operational Research, 183(3), 1028–1041.
Nananukul, N. (2008). Lot-sizing and inventory routing for a production–distribution supply chain. PhD dissertation, Graduate Program in Operations Research & Industrial Engineering, The University of Texas, Austin.
O’Brien, C., & Tang, O. (Eds.) (2006). Integrated enterprise and supply chain management. International Journal of Production Economics, 101 (special issue).
Parthanadee, P., & Logendran, R. (2006). Periodic product distribution from multi-depots under limited supplies. IIE Transactions on Scheduling & Logistics, 38(11), 1009–1026.
Pochet, Y., & Wolsey, L. A. (2006). Production planning by mixed integer programming. New York: Springer.
Resende, M. G. C., & Ribeiro, C. C. (2005). GRASP with path-relinking: recent advances and applications. In T. Ibaraki, K. Nonobe, & M. Yagiura (Eds.), Metaheuristics: progress as real problem solvers (pp. 29–63). New York: Springer.
Villegas, F. A., & Smith, N. R. (2006). Supply chain dynamics: analysis of inventory vs. order oscillations trade-off. International Journal of Production Research, 44(6), 1037–1054.
Zhao, Q.-H., Wang, S.-Y., & Lai, K. K. (2007). A partition approach to the inventory/routing problem. European Journal of Operational Research, 177(2), 786–802.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Bard, J.F., Nananukul, N. The integrated production–inventory–distribution–routing problem. J Sched 12, 257–280 (2009). https://doi.org/10.1007/s10951-008-0081-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10951-008-0081-9