A simulation/metaheuristic approach to newspaper production and distribution supply chain problems

被引:36
作者
Chiang, Wen-Chyuan [1 ]
Russell, Robert [1 ]
Xu, Xiaojing [1 ]
Zepeda, David [2 ]
机构
[1] Univ Tulsa, Collins Coll Business, Tulsa, OK 74104 USA
[2] Univ Minnesota, Carlson Sch Management, Minneapolis, MN 55455 USA
关键词
Stochastic supply chain; Metaheuristic; Simulation; Newspaper logistics; VEHICLE-ROUTING PROBLEM; SOFT TIME WINDOWS; TRAVEL-TIMES; OPERATIONS MANAGEMENT; STOCHASTIC DEMANDS; ALGORITHMS; SIMULATION; LOGISTICS; POINTS;
D O I
10.1016/j.ijpe.2009.03.001
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
In this paper, we examine two-level and three-level Supply chains for a midsize US newspaper in the Midwest that delivers to households and businesses in over 200 zip codes that span across various states. We formally define this problem as an integrated newspaper production and distribution supply chain management problem. Using a combination of model formulation, simulation, and an improvement heuristic we address both the efficiency and robustness Of the Solution by considering the impact of the stochastic nature of various parameters in both production and distribution. A deterministic formulation of the open vehicle routing problem with time windows and zoning constraints is utilized for vehicle scheduling and routing. A generalized network assignment problem is used to generate initial Solutions and a tabu search metaheuristic solution approach is applied to improve Solutions Satisfying Zone constraints and various approximate probabilities of satisfying delivery deadlines. However, the production and distribution process involves stochastic phenomena. We use simulation to evaluate the performance of the proposed Solution. We estimate the customer service level of delivering to locations before 4:00 am. We also discuss improvement procedures if the service level is unsatisfactory. (C) 2009 Elsevier B.V. All rights reserved.
引用
收藏
页码:752 / 767
页数:16
相关论文
共 47 条
[1]   Computational approaches to stochastic vehicle routing problems [J].
Bertsimas, D ;
Chervi, P ;
Peterson, M .
TRANSPORTATION SCIENCE, 1995, 29 (04) :342-352
[2]   A new generation of vehicle routing research: Robust algorithms, addressing uncertainty [J].
Bertsimas, DJ ;
SimchiLevi, D .
OPERATIONS RESEARCH, 1996, 44 (02) :286-304
[3]   A tabu search algorithm for the open vehicle routing problem [J].
Brandao, J .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2004, 157 (03) :552-564
[4]   Vehicle routing problem with time windows, part 1:: Route construction and local search algorithms [J].
Bräysy, I ;
Gendreau, M .
TRANSPORTATION SCIENCE, 2005, 39 (01) :104-118
[5]   Vehicle routing problem with time windows, part II:: Metaheuristics [J].
Bräysy, I ;
Gendreau, M .
TRANSPORTATION SCIENCE, 2005, 39 (01) :119-139
[6]   Scheduling pre-printed newspaper advertising inserts using genetic algorithms [J].
Carter, AE ;
Ragsdale, CT .
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2002, 30 (06) :415-421
[7]   COORDINATION OF PRODUCTION AND DISTRIBUTION PLANNING [J].
CHANDRA, P ;
FISHER, ML .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1994, 72 (03) :503-517
[8]   Solving the vehicle routing problem with stochastic demands using the cross-entropy method [J].
Chepuri, K ;
Homem-de-Mello, T .
ANNALS OF OPERATIONS RESEARCH, 2005, 134 (01) :153-181
[9]  
CHIANG WC, 1997, INFORMS J COMP, V9, P417
[10]  
CHIANG YS, 2001, TRANSPORTATION RES B, V14, P59