×

Integrating multi-product production and distribution in newspaper logistics. (English) Zbl 1278.90051

Summary: This paper presents a tabu search metaheuristic to aid in the coordination and synchronization of the production and delivery of multi-product newspapers to bulk delivery locations. The problem is modeled as an open vehicle routing problem with time windows and zoning constraints. The methodology is applied to the newspaper production and distribution problem in a major metropolitan area. Computational results are presented and show significant improvement relative to an existing newspaper company’s operations.

MSC:

90B06 Transportation, logistics and supply chain management
90B30 Production models
90C59 Approximation methods and heuristics in mathematical programming
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Chandra, P.; Fisher, M. L., Coordination of production and distribution planning, European Journal of Operational Research, 72, 503-517 (1994) · Zbl 0805.90051
[2] Cohen, M. A.; Lee, H. L., Strategic analysis of integrated production-distribution systems: models and methods, Operations Research, 36, 2, 216-228 (1988)
[3] Ishii, K.; Takahashi, K.; Muramatsu, R., Integrated production, inventory and distribution systems, International Journal of Production Research, 26, 3, 473-482 (1988)
[4] Pyke, D. F.; Cohen, M. A., Multiproduct integrated production-distribution systems, European Journal of Operational Research, 74, 18-49 (1994) · Zbl 0803.90072
[5] Viswanathan, S.; Mathur, K., Integrating routing and inventory decisions in one-warehouse multiretailer multiproduct distribution systems, Management Science, 43, 3, 294-312 (1997) · Zbl 0888.90055
[6] Chiang, W.; Russell, R., Integrating purchasing and routing in a propane gas supply chain, European Journal of Operational Research, 154, 710-729 (2004) · Zbl 1053.90007
[7] Sariklis, D.; Powell, S., A heuristic method for the open vehicle routing problem, Journal of Operational Research Society, 51, 564-573 (2000) · Zbl 1055.90530
[8] Brandao, J., A tabu search algorithm for the open vehicle routing problem, European Journal of Operational Research, 157, 552-564 (2004) · Zbl 1068.90026
[9] Tarantilis, C. D.; Kiranoudis, C. T.; Ioannou, G.; Prastacos, G. P., Solving the open vehicle routing problem via a single parameter metaheuristic algorithm, Journal of Operational Research Society, 56, 588-596 (2005) · Zbl 1095.90016
[10] Fu, Z.; Eglese, R. W.; Li, L. Y.O., A new tabu search heuristic for the open vehicle routing problem, Journal of Operational Research Society, 56, 267-274 (2005) · Zbl 1114.90003
[11] Pisinger D, Ropke S. A general heuristic for the vehicle routing problems. Computers and Operations Research, in press, doi:10.1016/j.cor.2005.09.0112.; Pisinger D, Ropke S. A general heuristic for the vehicle routing problems. Computers and Operations Research, in press, doi:10.1016/j.cor.2005.09.0112. · Zbl 1144.90318
[12] Li F, Golden B, Wasil E. The open vehicle routing problem: algorithms, large-scale test problems, and computational results. Computers and Operations Research, in press, doi:10.1016/j.cor.2005.11.018..; Li F, Golden B, Wasil E. The open vehicle routing problem: algorithms, large-scale test problems, and computational results. Computers and Operations Research, in press, doi:10.1016/j.cor.2005.11.018.. · Zbl 1185.90173
[13] Fisher, M.; Jaikumar, R., A generalized assignment heuristic for vehicle routing, Networks, 11, 109-124 (1981)
[14] Solomon, M., Algorithms for the vehicle routing and scheduling problems with time window constraints, Operations Research, 21, 498-516 (1987)
[15] Chiang, W.; Russell, R., A reactive tabu search metaheuristic for the vehicle routing problem with time windows, INFORMS Journal on Computing, 9, 417-430 (1997) · Zbl 0901.90088
[16] Osman, I., Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem, Annals of Operations Research, 40, 421-452 (1993) · Zbl 0775.90153
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.