首页> 外文OA文献 >Truck routing cut and fill problem in roadworks using integer programming
【2h】

Truck routing cut and fill problem in roadworks using integer programming

机译:使用整数编程,卡车路由切割并填补道路工程中的问题

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

Planning activities of materials distribution in earthworks may represent a gain in the work as a whole. One way to savings in the construction is to minimize the total distance travelled by equipment, for example the trucks between the cut and fill in earthmoving areas. Some studies have been reported on the optimization of material distribution between cut and fill areas, but only a few were applied in real projects considering multiple trucks, moreover they do not do any analysis based on the distance between stations. This paper aims at presenting an integer programming model that minimizes the distance travelled by dump trucks in distribution activities of earthwork materials.  The developed model was based on a classical operational research problem named vehicle routing problem, which focus on the minimization of the travelled way by a fleet of vehicles. The proposed approach was applied in two case studies whose findings highlight significant gains, in terms of flexibility of the planning process. Engineers, planners and analysts have an important computational tool to support decision-making by using this model.
机译:土方制品材料分布的规划活动可能代表整个工作中的收益。节省施工的一种方法是最大限度地减少设备行进的总距离,例如切割和填充地球移动区域之间的卡车。有些研究已经报告了切割和填充区域之间材料分布的优化,但在考虑多个卡车的实际项目中仅应用了一些研究,此外,它们没有根据站之间的距离进行任何分析。本文旨在提出一个整数编程模型,可最大限度地减少自卸卡车在土方材料分销活动中行进的距离。开发的模型基于一个名为车辆路由问题的经典操作研究问题,它专注于通过车辆队列的行进方式最小化。在两种案例研究中应用了拟议的方法,其研究结果在规划过程的灵活性方面突出了显着的收益。工程师,规划人员和分析师有一个重要的计算工具,可以使用此模型来支持决策。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号