The Solving of Vehicle Routing Problem Based on Hybrid Harmony Search Algorithm

被引：0
|
作者：
Zhao, Zaixing [1 ]
Wan, Fucai [2 ]
机构：
[1] Shenyang Univ, Key Lab Mfg Ind Integrated Automat, Shenyang, Liaoning, Peoples R China
[2] Shenyang Univ, Coll Informat Engn, Shenyang, Liaoning, Peoples R China
来源：
2011 INTERNATIONAL CONFERENCE ON INTELLIGENT COMPUTATION AND INDUSTRIAL APPLICATION (ICIA2011), VOL IV | 2011年
关键词：
Harmony search algorithm; vehicle routing; Genetic algorithm;
D O I：
暂无
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
This paper proposes a hybrid harmony search algorithm for solving vehicle routing problems. This hybrid harmony search algorithm is based on genetic algorithm and harmony search algorithm respective characteristics, By using genetic algorithm to create the initial harmony memory, and introducing the selection and crossover operation into the new harmony improvisation process to generate and improve multiple solutions. Discussed the detailed process, and finally compared the results with basic harmony search algorithm, demonstrated that the hybrid harmony search algorithm performed more study and more exactly than basic harmony search algorithm.
引用
收藏
页码：378 / 381
页数：4
相关论文
共 5 条
  • [1] Geem Z.W., 2005, AM J APPL SCI, V2, P1552, DOI DOI 10.3844/AJASSP.2005.1552.1557
  • [2] Mourkousis G., 2003, International Journal of Computational Intelligence and Applications, V3, P1, DOI 10.1142/S1469026803000835
  • [3] Thangiah S. R., 1991, Proceedings. Seventh IEEE Conference on Artificial Intelligence Applications (Cat. No.91CH2967-8), P322, DOI 10.1109/CAIA.1991.120888
  • [4] Wang Dong, 2008, SYSTEMS ENG
  • [5] An assignment-based local search method for solving vehicle routing problems
    Zeng, L
    Ong, HL
    Ng, KM
    [J]. ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2005, 22 (01) : 85 - 104
1