• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Transportation planning and technology >Daily newspaper distribution planning with integer programming: an application in Turkey
【24h】

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

机译：使用整数编程的每日报纸发行计划：在土耳其的应用

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

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.
机译：本文涉及报纸发行问题。它解决了在各种特定限制下使用分发工具将报纸从印刷厂运输到报社的问题。目的是使车辆行驶的距离和/或车辆的数量最小化。在这项研究中，研究了土耳其新闻界一家领先的报纸发行公司的车辆路线。问题的定义是确定一组同构车辆的最佳交付路线，从开始和结束于印刷厂开始，该印刷厂需要在容量和时间限制下为具有已知需求的多个地理位置分散的报社提供服务，同时使总发行成本降至最低。提出了一个整数线性规划模型作为使用Cplex的解决方案。计算结果表明，所提出的模型快速且能够在合理的计算时间内找到多达55个新闻代理的问题方案的最佳解决方案。结果发现，与当前的手动方法相比，该模型平均降低了21％的交付成本。结果表明，该模型适用于中等规模的配送问题。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号