期刊文献+

基于Prüfer数编码的演化计算方法研究——多阶段物流网络优化问题研究 被引量:1

Study on Evolutionary Computation Based on Prüfer Number——Multi-stage Logistic Network Optimization
下载PDF
导出
摘要 运用演化计算求解多阶段物流网络优化问题的关键是其编码问题。论文运用Prüfer数对其进行编码,针对Syarif等人方法中的不足,提出了一种改进的Prüfer数解码方法,避免了不可行解的产生,提高了解码的效率。在此基础上,一种新的基于Prüfer数编码的演化计算方法被提出,通过算例分析,该方法的可行性和有效性得到了充分的证明。 Network encoding is the key of application evolutionary computation to the optimization of multi-stage logistic network,In this paper,Prüfer number is used to encode the network,According to the shortcoming of Syarif's method,an improved decoding method is put forward,avoiding the infeasible solution and enhancing the efficiency, Furthermore,a new evolutionary computation algorithm based on Prüfer number is put forward,its feasibility and efficiency are proved by a numerical example.
出处 《计算机工程与应用》 CSCD 北大核心 2005年第31期5-7,85,共4页 Computer Engineering and Applications
基金 国家985机械工程一级学科建设项目"物流系统及智能化子项目"基金资助(编号:221906006)
关键词 演化计算 多阶段物流网络 Prüfer数 evolutionary computation,multi-stage logistic network,prüfer number
  • 相关文献

参考文献5

  • 1Gen M,Cheng R.Genetic algorithms and engineering design[M].NewYork: Wiley, 1997.
  • 2Gen M,Cheng R.Genetic algorithms and engineering optimization[M].New York :Wiley ,2000.
  • 3Syarif A,Yun Y S,Gen M.Study on multistage logistic chain network: a spanning tree-based genetic algorithm approach[J].Computers & Industrial Engineering, 2002 ;43: 299~314.
  • 4Syarif A,Gen M.Solving exclusionary side constrained transportation problem by using a hybrid spanning tree-based genetic algorithm[J]. Journal of Intelligent Manufacturing,2003; 14(3-4) :389~399.
  • 5Zhou G,Gen M.A genetic algorithm approach on tree-like telecommu nication network design problem[J].Journal of the Operational Research Society, 2003; 54 (3): 248~254.

同被引文献16

  • 1Dilek Tuzun, Laura I. A two-phase tabu search approach to the location routing problem [J]. European Journal of Operational Research (S0377-2217), 1999, 116(1): 87-99.
  • 2Wu Tai-His, Low Chinyao, Bai Jiunn-Wei. Heuristic solutions to multi-depot location-routing problems [J]. Computers & Operation Research (S0305-0548), 2002, 29(10): 1393-1415.
  • 3Gen Mitsuo, Cheng Runwei. Genetic algorithms and engineering design [M]. New York, USA: Wiley, 1997.
  • 4Gen Mitsuo, Cheng Runwei. Genetic algorithms and engineering optimization [M]. New York, USA: Wiley, 2000.
  • 5Syarif A, Yun Youngsu, Gen Mitsuo. Study on mutli-stage logistic chain network: a spanning tree-based genetic algorithm approach [J]. Computers & Industrial Engineering (S0360-8352), 2002, 43(1): 299-314.
  • 6Syarif A, Gen Mitsuo. Solving exclusionary side constrained transportation problem by using a hybird spanning tree-based genetic algorithm [J]. Journal of Intelligent Manufacturing (S0956-5515), 2003, 14(3): 389-399.
  • 7Ferreira C. Gene expression programming: A new adaptive algorithm for solving problems [J]. Complex System (S0219-5259), 2001, 13(2): 87-129.
  • 8Ferreira C. Gene Expression Programming in Problem Solving [C]// Invited Tutorial of the 6th Online World Conference on Soft Computing in industrial Applications. Berlin, Germany: Springer, 2001: 10-24.
  • 9Kumar V, Deo N, Kumar N. Parallel generation of random trees and connected graphs [Z]//Congressus Numerantium. Winnipeg, Canada: University of Manitoba, 1998, 130: 7-18.
  • 10Stomatapoll.普吕弗序列.(2005-10-26)[2011-8-10].http://zh.wikipedia.org/wiki/普吕弗序列.

引证文献1

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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