期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

系统优化的嵌套分割算法及其改进 被引量：3

Nested Partitions Method and Its Improvement in System Optimization
在线阅读 下载PDF
导出
摘要 介绍了嵌套分割算法(NPM)的基本思想,并提出了一种改进方法以提高其收敛速度.分析了改进算法的可行性,并通过一个优化算例进行了验证. In order to improve the optimization efficiency of Nested Partitions Method (NPM), this paper introduced the main ideas of NPM and proposed the way to improve the NPM to accelerate its convergence rate. The paper presented a sample of improved algorithm (simulated annealing based nested partitions, SANP) and introduced its implementation procedure. Moreover, it analysed the feasibility of the improved algorithm and verified the algorithm through an optimization example.
作者 路晓伟 蒋馥 路晓伟 蒋馥
机构地区 上海交通大学安泰管理学院
出处 《上海交通大学学报》 EI CAS CSCD 北大核心 2004年第3期394-397,共4页 Journal of Shanghai Jiaotong University
基金 国家自然科学基金资助项目(70271038)
关键词 嵌套分割算法 系统优化 系统仿真 Algorithms Convergence of numerical methods Numerical methods Simulated annealing
分类号 N945.15 [自然科学总论—系统科学]
  • 相关文献

参考文献6

  • 1[1]Shi L, O′lafsson S. Nested partitions method for global optimization[J]. Operations Research, 2000,48(3):390-407.
  • 2[2]O′lafsson S, Shi L. An integrated framework for deterministic and stochastic optimization[DB/OL]. http://www.informs-cs.org, 1997. 358-365.
  • 3[3]Shi L, O′lafsson S, Sun N. New parallel randomized algorithms for the traveling salesman problem[J]. Computers & Operations Research, 1999,26:371-394.
  • 4[4]Shi L, Chen C H, Yücesan E. Simultaneous simulation experiments and nested partition for discrete resource allocation in supply chain management[DB/OL].http://www.informs-cs.org, 1999. 395-401.
  • 5[5]Shi L, O′lafsson S, Chen Q. An optimization framework for product design[J]. Management Science, 2001, 47(12):1681-1692.
  • 6[6]Shi L, O′lafsson S, Chen Q. A new hybrid optimization algorithm[J]. Computers & Industrial Engineering, 1999, 36: 409-426.

同被引文献28

  • 1徐香玲,傅卫平,李德信,谢敬,刘韬.基于专家系统的自动化立体仓库出入库调度研究[J].物流技术,2005,24(2):38-40. 被引量：25
  • 2Oarey M R, Johnson D S. Computers and Intractability: A Guide to the Theory of N-P-Completeness [M]. San Francisco, USA: Freeman WH, 1979.
  • 3Croes G A. A Method for Solving Traveling Salesman Problems [J]. Operations Research (S0030-364X), 1958, 6(6): 791-812.
  • 4Lin S. Computer Solutions to the Traveling Salesman Problem [J]. Bell System Technical Journal (S0005-8580), 1965, 44(10): 2245-2269.
  • 5Lin S, Kemighan B W. An Effective Heuristic Algorithm for the Traveling Salesman Problem [J]. Operations Research (S0030-364X), 1973, 21 (2): 498-516.
  • 6Olafsson S, Leyuan Shi. An Integrated Framework for Deterministic and Stochastic Optimization [C]// Proceedings of the 1997 Winter Simulation Conference. USA: IEEE, 1997: 358-365.
  • 7Liang P, Yuupeng Pan, Leyuan Sift. Nested Partitions Method for the Local Pickup and Delivery Problem [C]// Automation Science and Engineering, 2006. CASE '06. IEEE International Conference. USA: IEEE, 2006: 375-380.
  • 8Leyuan Sin, Hwang P Q. A Method for Real-time Scheduling Problems [C]//Object-Oriented Real-Time Dependable Systems, 1997. Proceedings. Third International Workshop. USA: IEEE, 1997:172-176.
  • 9Leyuan Shi. Nested Partition Method for Global Optimization [J]. Operations Research (S0030-364X), 2000, 48(3): 390-407.
  • 10GONG Wenbo, HO Yuchi, ZHAI Wengang. Stochastic comparison algorithm for discrete optimization with estimation [ J ]. SIAM Journal on Optimization, 1999,10(2):384-404.

引证文献3

二级引证文献12

上海交通大学学报
2004年 第3期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部