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...
| Main Authors: | , , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English English |
| Published: |
IEEE
2017
|
| Subjects: | |
| Online Access: | http://irep.iium.edu.my/61954/ http://irep.iium.edu.my/61954/ http://irep.iium.edu.my/61954/ 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 |