A variant fisher and Jaikuamr algorithm to solve capacitated vehicle routing problem
Vehicle Routing Problem (VRP) is a real life constraint satisfaction problem to find minimal travel distances of vehicles to serve customers. Capacitated CVRP (CVRP) is the simplest form of VRP considering vehicle capacity constraint. Constructive and clustering are the two popular approaches to...
Saved in:
| Main Authors: | , , |
|---|---|
| 格式: | Conference or Workshop Item |
| 语言: | English English |
| 出版: |
IEEE
2017
|
| 主题: | |
| 在线阅读: | http://irep.iium.edu.my/61954/1/61954-A%20Variant%20Fisher%20and%20Jaikuamr%20Algorithm.pdf http://irep.iium.edu.my/61954/2/61954-A%20variant%20fisher%20and%20Jaikuamr%20algorithm-SCOPUS.pdf http://irep.iium.edu.my/61954/ http://ieeexplore.ieee.org/document/8079932/ |
| 标签: |
添加标签
没有标签, 成为第一个标记此记录!
|
成为第一个发表评论!