文献知网节
  • 记笔记

An Improved GA for solving multiple depot VRP

Yudong ZHANG1Genlin JI1Shuihua WANG1,2Preetha PHILLIPS3William WANG4Elizabeth LEE5

1. School of Computer Science and Technology,Nanjing Normal University2. School of Electronic Science and Engineering,Nanjing University3. School of Natural Sciences and Mathematics,Shepherd University4. Waynesburg University5. Department of Engineering Technology,Chattanooga State Community College

摘要:Multi-depot vehicle routing problem is a NP-hard combinatorial optimization problem.In this paper,we proposed an improved genetic algorithm(GA),which combined GA with fitnessscaling and local search.The experiments compared the proposed approach with standard GA,simulated annealing,Tabu search,and particle swarm optimization.The results showed that the proposed method was superior to GA,SA,TS,and PSO,w.r.t.solution accuracy.
会议名称:

2015 International Industrial Informatics and Computer Engineering Conference(IIICEC 2015)

会议时间:

2015-01-10

会议地点:

中国陕西西安

  • 专辑:

    电子技术及信息科学

  • 专题:

    自动化技术

  • 分类号:

    TP18

  • 手机阅读
    即刻使用手机阅读
    第一步

    扫描二维码下载

    "移动知网-全球学术快报"客户端

    第二步

    打开“全球学术快报”

    点击首页左上角的扫描图标

    第三步

    扫描二维码

    手机同步阅读本篇文献

  • CAJ下载
  • PDF下载

下载手机APP用APP扫此码同步阅读该篇文章

下载:31 页码:584-587 页数:4 大小:669k

相关推荐
  • 相似文献
  • 读者推荐
  • 相关基金文献
  • 关联作者
  • 相关视频