首页> 外文会议>International Conference on Intelligent Systems: Theories and Applications >Gas-filling stations procurement problem with time windows using a heterogeneous fleet of full tankers
【24h】

Gas-filling stations procurement problem with time windows using a heterogeneous fleet of full tankers

机译:使用不同种类的满载油轮车队的时间窗口的加气站采购问题

获取原文

摘要

In this paper, we address the problem of procurement related to the supply of liquefied petroleum gas (LPG). We are interested in the issue of shipping large quantities of bulk gas (butane and propane) from storage terminals to filling stations storage capacities using a fleet of tankers. The procurement goal is the assignment of quantities of gas to be transferred for each filling station; then, the shipping of these quantities with a heterogeneous fleet of tankers which respects the time schedule of those stations. After a review of literature for the classes of vehicle routing problem with backhauls in oil and gas procurement problems, we will present an integer linear programming formulation (ILP), then, we attempt to solve the problem using a solver, following this by testing and discussing results.
机译:在本文中,我们解决了与液化石油气(LPG)供应有关的采购问题。我们对使用大量油轮将大量散装气体(丁烷和丙烷)从存储码头运输到加油站的存储能力感兴趣。采购目标是分配每个加油站要输送的气体数量;然后,使用不同种类的油轮船队运送这些数量的货物,这要遵守这些加油站的时间表。在回顾了有关石油和天然气采购问题中回程的车辆路径问题的文献之后,我们将提出一个整数线性规划公式(ILP),然后,我们尝试使用求解器来解决该问题,然后通过测试和讨论结果。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号