Optimization of Perishable Products in Incident Vehicle Route Problem
DOI:
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

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

    The perishable products go bad easily in transportational process and have the trait of timeliness and incident among goods. This paper proposed a mathematical model of Incident Vehicle Route Problem with Time Window (IVRPTW) to consider production distribution for perishable products.And adapt the Immune Clonal Selection Algorithm(ICSA) to solve this complex problem. On the basis of modeling and simulating examples of this problem, it is shown that the programming model and algorithm are reasonable and efficient.Experiment result also shows the immune clonal selection algorithm can find the optimal or nearly optimal solution effectively compared with the genetic algorithm.

    Reference
    Related
    Cited by
Get Citation

汤雅连,蔡延光,章云,乐峰.易腐产品运输调度问题的优化.计算机系统应用,2013,22(8):136-140

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:January 17,2013
  • Revised:March 07,2013
  • Adopted:
  • Online: September 06,2013
  • 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