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 |
---|---|
Format: | Conference or Workshop Item |
Language: | English English |
Published: |
IEEE
2017
|
Subjects: | |
Online Access: | 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/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Distance based sweep nearest algorithm to solve capacitated vehicle routing problem
by: Akhand, M. A. H, et al.
Published: (2016) -
Using genetic algorithm in implementing capacitated vehicle routing problem
by: Mohammed, M.A., et al.
Published: (2017) -
Using genetic algorithm in implementing capacitated vehicle routing problem
by: Mohammed M.A., et al.
Published: (2023) -
Ant colony algorithm for capacitated vehicle routing problem
by: Johar, Farhana, et al.
Published: (2018) -
An enhanced ant colony system algorithm based on subpaths for solving the capacitated vehicle routing problem
by: Ahmed, Zakir Hussain, et al.
Published: (2023)