数学建模(送货线路设计问题)

上传者: p1026 | 上传时间: 2021-08-12 10:07:43 | 文件大小: 1.56MB | 文件类型: RAR
摘 要:  探讨了定位———运输路线安排问题的解决方法,提出一种首先用启发式规则将客户集聚类,从而划 分出若干客户子类;然后,用混沌搜索算法求解LRP 的优化方法. 提出将用于聚类分析的启发式规则和混沌 搜索算法结合的混合算法求解物流配送路径优化问题是有效的. 由于混沌序列具有随机性与遍历性,容易寻 找全局最优解,从而避免了传统优化方法中的“局部最优现象”的发生. 计算机仿真实例证明了该算法简洁、 实用、性能良好,有利于解决带有约束的非线性物流配送路径LRP 优化问题. 关键词:  聚类分析; 混沌; 混沌搜索算法; 定位———运输路线安排问题(LRP) ; 物流配送; 优化

文件下载

资源详情

[{"title":"( 26 个子文件 1.56MB ) 数学建模(送货线路设计问题)","children":[{"title":"B题(送货线路设计问题)","children":[{"title":"建模课件","children":[{"title":"相关C语言算法","children":[{"title":"AdjMGraph.c <span style='color:#111;'> 786B </span>","children":null,"spread":false},{"title":"FloydTest.c <span style='color:#111;'> 998B </span>","children":null,"spread":false},{"title":"Dijkstra.h <span style='color:#111;'> 1.08KB </span>","children":null,"spread":false},{"title":"AdjMGraph.h <span style='color:#111;'> 2.53KB </span>","children":null,"spread":false},{"title":"AdjMGraphTraverse.h <span style='color:#111;'> 1.58KB </span>","children":null,"spread":false},{"title":"SeqList.h <span style='color:#111;'> 1.43KB </span>","children":null,"spread":false},{"title":"AdjMGraphTraverse.c <span style='color:#111;'> 665B </span>","children":null,"spread":false},{"title":"邻接表的图","children":[{"title":"GraphTest.c <span style='color:#111;'> 1.05KB </span>","children":null,"spread":false},{"title":"AdjLGraph.h <span style='color:#111;'> 2.13KB </span>","children":null,"spread":false}],"spread":true},{"title":"PrimTest.c <span style='color:#111;'> 868B </span>","children":null,"spread":false},{"title":"SeqCQueue.h <span style='color:#111;'> 1.22KB </span>","children":null,"spread":false},{"title":"AdjMGraphCreate.h <span style='color:#111;'> 481B </span>","children":null,"spread":false},{"title":"Prim.h <span style='color:#111;'> 834B </span>","children":null,"spread":false},{"title":"DijkstraTest.c <span style='color:#111;'> 899B </span>","children":null,"spread":false}],"spread":false},{"title":"第8章1.ppt <span style='color:#111;'> 808.50KB </span>","children":null,"spread":false},{"title":"图的矩阵表示及习题.doc <span style='color:#111;'> 204.00KB </span>","children":null,"spread":false},{"title":"A2008.doc <span style='color:#111;'> 58.00KB </span>","children":null,"spread":false},{"title":"road1.m <span style='color:#111;'> 948B </span>","children":null,"spread":false},{"title":"floyd.m <span style='color:#111;'> 299B </span>","children":null,"spread":false},{"title":"road2.m <span style='color:#111;'> 86B </span>","children":null,"spread":false},{"title":"第8章2.ppt <span style='color:#111;'> 1.19MB </span>","children":null,"spread":false},{"title":"road3.m <span style='color:#111;'> 209B </span>","children":null,"spread":false},{"title":"floyd,dijkstra.doc <span style='color:#111;'> 140.50KB </span>","children":null,"spread":false}],"spread":true},{"title":"送货线路设计问题.doc <span style='color:#111;'> 326.00KB </span>","children":null,"spread":false},{"title":"送货.pdf <span style='color:#111;'> 289.69KB </span>","children":null,"spread":false},{"title":"送货策略.doc <span style='color:#111;'> 462.50KB </span>","children":null,"spread":false}],"spread":true}],"spread":true}]

评论信息

  • zgszwp :
    算法比较复杂,还需要仔细的研究研究
    2012-07-31

免责申明

【只为小站】的资源来自网友分享,仅供学习研究,请务必在下载后24小时内给予删除,不得用于其他任何用途,否则后果自负。基于互联网的特殊性,【只为小站】 无法对用户传输的作品、信息、内容的权属或合法性、合规性、真实性、科学性、完整权、有效性等进行实质审查;无论 【只为小站】 经营者是否已进行审查,用户均应自行承担因其传输的作品、信息、内容而可能或已经产生的侵权或权属纠纷等法律责任。
本站所有资源不代表本站的观点或立场,基于网友分享,根据中国法律《信息网络传播权保护条例》第二十二条之规定,若资源存在侵权或相关问题请联系本站客服人员,zhiweidada#qq.com,请把#换成@,本站将给予最大的支持与配合,做到及时反馈和处理。关于更多版权及免责申明参见 版权及免责申明