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: | Sultana, Tanzima, Akhand, Md Aminul Haque, Rahman, M.M. Hafizur |
---|---|
格式: | 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/ |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
相似書籍
-
Distance based sweep nearest algorithm to solve capacitated vehicle routing problem
由: Akhand, M. A. H, et al.
出版: (2016) -
Using genetic algorithm in implementing capacitated vehicle routing problem
由: Mohammed, M.A., et al.
出版: (2017) -
Using genetic algorithm in implementing capacitated vehicle routing problem
由: Mohammed M.A., et al.
出版: (2023) -
Ant colony algorithm for capacitated vehicle routing problem
由: Johar, Farhana, et al.
出版: (2018) -
An enhanced ant colony system algorithm based on subpaths for solving the capacitated vehicle routing problem
由: Ahmed, Zakir Hussain, et al.
出版: (2023)