Optimization research of the complex network structure supply chain based on simulated annealing and Dijkstra algorithm(基于模拟退火与Dijkstra算法的复杂网状结构供应链最优化研究)
复杂网状结构供应链费用最优化已成为研究的热点问题.基于模拟退火与Dijkstra算法对复杂网状结构供应链费用的优化问题进行了研究.把全国的城市分布作为复杂网状结构,以城市间的距离和建立供应点的费用作为参数,建立数学模型,并进行数值仿真,分别以全1序列、全0序列、随机序列为初始值的选取方式进行模拟,从中确定了最优解,并给出了最优供应链网络....
Main Authors: | , |
---|---|
Format: | Article |
Language: | zho |
Published: |
Zhejiang University Press
2014-03-01
|
Series: | Zhejiang Daxue xuebao. Lixue ban |
Subjects: | |
Online Access: | https://doi.org/10.3785/j.issn.1008-9497.2014.02.006 |
_version_ | 1797235971065905152 |
---|---|
author | LIUJunwei(刘俊玮) WANGZihao(王子豪) |
author_facet | LIUJunwei(刘俊玮) WANGZihao(王子豪) |
author_sort | LIUJunwei(刘俊玮) |
collection | DOAJ |
description | 复杂网状结构供应链费用最优化已成为研究的热点问题.基于模拟退火与Dijkstra算法对复杂网状结构供应链费用的优化问题进行了研究.把全国的城市分布作为复杂网状结构,以城市间的距离和建立供应点的费用作为参数,建立数学模型,并进行数值仿真,分别以全1序列、全0序列、随机序列为初始值的选取方式进行模拟,从中确定了最优解,并给出了最优供应链网络. |
first_indexed | 2024-04-24T16:56:26Z |
format | Article |
id | doaj.art-dc3f3e46852e4b8ebc0f1094bdea97d2 |
institution | Directory Open Access Journal |
issn | 1008-9497 |
language | zho |
last_indexed | 2024-04-24T16:56:26Z |
publishDate | 2014-03-01 |
publisher | Zhejiang University Press |
record_format | Article |
series | Zhejiang Daxue xuebao. Lixue ban |
spelling | doaj.art-dc3f3e46852e4b8ebc0f1094bdea97d22024-03-29T01:58:33ZzhoZhejiang University PressZhejiang Daxue xuebao. Lixue ban1008-94972014-03-0141214915210.3785/j.issn.1008-9497.2014.02.006Optimization research of the complex network structure supply chain based on simulated annealing and Dijkstra algorithm(基于模拟退火与Dijkstra算法的复杂网状结构供应链最优化研究)LIUJunwei(刘俊玮)0WANGZihao(王子豪)1 1.School of Science, Xi'an Electronic and Science University, Xi'an 710126, China( 1.西安电子科技大学理学院,陕西 西安 710126) 2.School of Software, Xi'an Electronic and Science University, Xi'an 710126, China( 2.西安电子科技大学软件学院,陕西 西安 710126)复杂网状结构供应链费用最优化已成为研究的热点问题.基于模拟退火与Dijkstra算法对复杂网状结构供应链费用的优化问题进行了研究.把全国的城市分布作为复杂网状结构,以城市间的距离和建立供应点的费用作为参数,建立数学模型,并进行数值仿真,分别以全1序列、全0序列、随机序列为初始值的选取方式进行模拟,从中确定了最优解,并给出了最优供应链网络.https://doi.org/10.3785/j.issn.1008-9497.2014.02.0060-1规划dijkstra算法模拟退火算法复杂网状结构供应链最优化 |
spellingShingle | LIUJunwei(刘俊玮) WANGZihao(王子豪) Optimization research of the complex network structure supply chain based on simulated annealing and Dijkstra algorithm(基于模拟退火与Dijkstra算法的复杂网状结构供应链最优化研究) Zhejiang Daxue xuebao. Lixue ban 0-1规划 dijkstra算法 模拟退火算法 复杂网状结构 供应链最优化 |
title | Optimization research of the complex network structure supply chain based on simulated annealing and Dijkstra algorithm(基于模拟退火与Dijkstra算法的复杂网状结构供应链最优化研究) |
title_full | Optimization research of the complex network structure supply chain based on simulated annealing and Dijkstra algorithm(基于模拟退火与Dijkstra算法的复杂网状结构供应链最优化研究) |
title_fullStr | Optimization research of the complex network structure supply chain based on simulated annealing and Dijkstra algorithm(基于模拟退火与Dijkstra算法的复杂网状结构供应链最优化研究) |
title_full_unstemmed | Optimization research of the complex network structure supply chain based on simulated annealing and Dijkstra algorithm(基于模拟退火与Dijkstra算法的复杂网状结构供应链最优化研究) |
title_short | Optimization research of the complex network structure supply chain based on simulated annealing and Dijkstra algorithm(基于模拟退火与Dijkstra算法的复杂网状结构供应链最优化研究) |
title_sort | optimization research of the complex network structure supply chain based on simulated annealing and dijkstra algorithm 基于模拟退火与dijkstra算法的复杂网状结构供应链最优化研究 |
topic | 0-1规划 dijkstra算法 模拟退火算法 复杂网状结构 供应链最优化 |
url | https://doi.org/10.3785/j.issn.1008-9497.2014.02.006 |
work_keys_str_mv | AT liujunweiliújùnwěi optimizationresearchofthecomplexnetworkstructuresupplychainbasedonsimulatedannealinganddijkstraalgorithmjīyúmónǐtuìhuǒyǔdijkstrasuànfǎdefùzáwǎngzhuàngjiégòugōngyīngliànzuìyōuhuàyánjiū AT wangzihaowángziháo optimizationresearchofthecomplexnetworkstructuresupplychainbasedonsimulatedannealinganddijkstraalgorithmjīyúmónǐtuìhuǒyǔdijkstrasuànfǎdefùzáwǎngzhuàngjiégòugōngyīngliànzuìyōuhuàyánjiū |