首页> 外文期刊>Journal of Computational and Applied Mathematics >A self-learning approach for optimal detailed scheduling of multi-product pipeline
【24h】

A self-learning approach for optimal detailed scheduling of multi-product pipeline

机译:多产品管道最佳详细调度的自学方法

获取原文
获取原文并翻译 | 示例
           

摘要

Pipeline transportation is cost-optimal in refined product transportation. However, the optimization of multi-product pipeline scheduling is rather complicated due to multi-batch sequent transportation and multi-point delivery. Even though many scholars have conducted researches on the issue, there is hardly a model settling the discontinuous constraints in the model as a result of batch interface migration. Moreover, through investigation, there is no self-learning approach to pipeline scheduling optimization at present. This paper considers batch interface migration and divides the model into time nodes sequencing issue and a mixed-integer linear programming (MILP) model with the known time node sequence. And a self-learning approach is proposed through the combination of fuzzy clustering analysis and ant colony optimization (ACO). This algorithm is capable of self-learning, which greatly improves the calculation speed and efficiency. At last, a real pipeline case in China is presented as an example to illustrate the reliability and practicability of the proposed model. (C) 2017 Elsevier B.V. All rights reserved.
机译:管道运输在精制产品运输中是最佳的。然而,由于多批次的顺序运输和多点递送,多产品管道调度的优化相当复杂。尽管许多学者对该问题进行了研究,但由于批处理界面迁移,几乎没有模型在模型中解决了不连续约束。此外,通过调查,目前没有向流水线调度优化的自学方法。本文考虑批处理界面迁移,并将模型分为时间节点排序问题和具有已知时间节点序列的混合整数线性编程(MILP)模型。通过模糊聚类分析和蚁群优化(ACO)的组合提出了一种自学方法。该算法能够自学习,从而大大提高了计算速度和效率。最后,提出了在中国的真正管道案例作为示例,以说明所提出的模型的可靠性和实用性。 (c)2017年Elsevier B.V.保留所有权利。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号