首页> 外文会议>Business Engineering and Industrial Applications Colloquium (BEIAC), 2012 IEEE >Hybrid genetic algorithm for coordinated production and transportation planning problem
【24h】

Hybrid genetic algorithm for coordinated production and transportation planning problem

机译:求解混合生产与运输计划问题的混合遗传算法

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

摘要

A hybrid genetic algorithm is proposed to solve a coordinated production and transportation problem. The problem considered is a mixed integer linear programming problem, which coordinates the production planning of finished products and intermediate products in a process industry, also consists of transportation between the facilities that produces intermediates and finished products. The results obtained by GA are then compared with results obtained by CPLEX solver. Computational results show that as the problem size increase in terms of number of products or time periods, GA can provide a good quality feasible solution in a reasonable time. Furthermore, incorporating the feasible solution from the MIP solver into GA's initial population decreases the total cost by about 39%.
机译:提出了一种混合遗传算法来解决生产和运输协调问题。所考虑的问题是混合整数线性规划问题,该问题协调过程工业中成品和中间产品的生产计划,还包括生产中间产品和成品的设施之间的运输。然后将GA获得的结果与CPLEX求解器获得的结果进行比较。计算结果表明,随着问题数量(按产品数量或时间段)的增加,GA可以在合理的时间内提供优质可行的解决方案。此外,将来自MIP求解器的可行解决方案整合到GA的初始种群中,可使总成本降低约39%。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号