基于表上作业原理的运输问题计算机寻优算法
作者:
作者单位:

作者简介:

通讯作者:

中图分类号:

C93-03;TP391

基金项目:

河南省重点研发与推广专项(192102210223);河南省高等学校重点科研资助项目(19A410001)。


Computer-aided optimization algorithm for solving transportation problems based on table-manipulation principle
Author:
Affiliation:

Fund Project:

  • 摘要
  • |
  • 图/表
  • |
  • 访问统计
  • |
  • 参考文献
  • |
  • 相似文献
  • |
  • 引证文献
  • |
  • 资源附件
  • |
  • 文章评论
    摘要:

    针对运输问题寻优的高度复杂性,提出了一种基于表上作业原理的计算机寻优算法。在算法中,采用"最小元素法"获取初始基可行解,采用"位势法"获取检验数数组,采用"递归过程"获取闭合回路数组,根据闭合回路数组和基可行解获取调整量,根据闭合回路数组、调整量对基可行解进行调整,通过While循环不断寻优直到最小检验数非负。While循环退出时,若存在0检验数,则任选一个0检验数,以其为起点寻找一个闭合回路数组,通过调整得到随机最优解。应用案例表明,该算法实现了表上作业求解过程的计算机程序化,提高了计算效率、确保了计算准确性。

    Abstract:

    Aimed at getting the optimal solution of transportation problems, a computer-aided optimization algorithm based on table-manipulation principle is proposed. In the algorithm, the minimum element method is used to get an initial basic feasible solution;the potential method is adopted to get the array of check numbers and the recursive process is applied to get the closed loop array. Then the adjusting quantity is got according to the closed loop array and basic feasible solution, a new feasible solution is got after the feasible solution is adjusted according to the closed loop array and adjusting quantity, and the While loop is used to get the optimal solution until the minimum check number is not less than 0. After the While loop exits, if there are one or more 0 check numbers in the array of check numbers, one 0 check number is selected randomly to get a random optimum solution through above process. Case study shows that by the proposed computer-aided optimization algorithm, the computerization of the table-manipulation process is realized, thus improving the calculation efficiency and ensuring calculation accuracy.

    参考文献
    相似文献
    引证文献
引用本文

沈玲,曾强,常梦辉.基于表上作业原理的运输问题计算机寻优算法[J].重庆大学学报,2019,42(10):92-105.

复制
分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:2019-05-01
  • 最后修改日期:
  • 录用日期:
  • 在线发布日期: 2019-11-02
  • 出版日期: