首页> 外文会议>International conference on transportation engineering >A COMBINATORIAL OPTIMIZATION SELECTION METHOD OF LOGISTICS CHAIN
【24h】

A COMBINATORIAL OPTIMIZATION SELECTION METHOD OF LOGISTICS CHAIN

机译:物流链组合优化选择方法

获取原文

摘要

The structure and optimization of logistics chain is an important issue in the field of logistics planning and optimization. A multi-graph choice model of logistics chain which is used to choose multi-logistics nodes and paths in the same region is built on the condition of the logistics node and path all spending costs. Through the method that create virtual node, the original problem is transformed to a shortest path problem of which minimum costs is the optimization objective. This problem can be solved by using the modified Dijkstra algorithm. At last, an example is giving to prove the effectiveness of this combinatorial optimization method.
机译:物流链的结构和优化是物流规划与优化领域的一个重要问题。用于选择多个物流节点和相同区域中的路径的物流链的多图选择模型是在物流节点和路径的条件下建立了所有支出成本。通过创建虚拟节点的方法,原始问题被转换为最小成本的最短路径问题是优化目标。通过使用修改的DIJKSTRA算法可以解决这个问题。最后,一个例子正在给出这种组合优化方法的有效性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号