Daily newspaper distribution planning with integer programming: an application in Turkey

作者：Eraslan Erguen^*; Derya Tusan

来源：Transportation Planning and Technology, 2010, 33(5): 423-433.

DOI：10.1080/03081060.2010.502374

• newspaper distribution planning
• capacitated vehicle routing problem
• integer linear programming
• vehicle scheduling
• time deadlines

This paper concerns the newspaper distribution problem. It addresses the transportation of newspapers from printing plant to newsagents with distribution vehicles under various particular constraints. The objective is to minimize the distance traveled by the vehicles and/or the number of vehicles. In this study, the routes for vehicles of a leading newspaper distributor company in the Turkish press sector are examined. The problem is defined as determining optimal delivery routes for a fleet of homogeneous vehicles, starting and ending at the printing plant that is required to serve a number of geographically dispersed newsagents with known demands under capacity and time constraints, while minimizing the total distribution cost. An integar linear programming model is proposed as a solution using Cplex. Computational results demonstrate that the proposed model is fast and able to find optimal solutions for problem scenarios with up to 55 newsagents within reasonable computing times. It was found that the proposed model reduced the delivery cost by 21% on average when compared to the current manual method. The results show that this model is adequate for medium-sized distribution problems.

• 出版日期2010