Optimal Routing of Cigarette Delivery Vehicle Based on Genetic Algorithm
DOI:
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    On the basis of establishing an optimized model for optimal routing of cigarette delivery vehicle problem, the paper uses techniques such as roulette wheel selection, partially matched crossover and self adaptation for fitness function, designs a genetic algorithm based on natural numbers. At the end of the paper make some experimental calculations using this algorithm. The experimental calculations results demonstrate that the optimal or nearly optimal solutions to the Cigarette Delivery Vehicle routing problem can be easily obtained by using genetic algorithm.

    Reference
    Related
    Cited by
Get Citation

叶安新.基于遗传算法的烟草配送车路径优化问题.计算机系统应用,2011,20(4):241-244

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:July 23,2010
  • Revised:September 01,2010
  • Adopted:
  • Online:
  • Published:
Article QR Code
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-3
Address:4# South Fourth Street, Zhongguancun,Haidian, Beijing,Postal Code:100190
Phone:010-62661041 Fax: Email:csa (a) iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063