Distance based sweep nearest algorithm to solve capacitated vehicle routing problem
Capacitated Vehicle Routing Problem (CVRP) is a real life constraint satisfaction problem to find minimal travel distances to serve customers with homogeneous fleet of vehicles. Among several methods, Sweep algorithm in 2-phase approach is popular in solving CVRP. Sweep (SW) method solely depend...
Saved in:
Main Authors: | Akhand, M. A. H, Sultana, Tanzima, Peya, Zahrul Jannat, Rahman, M.M. Hafizur |
---|---|
Format: | Conference or Workshop Item |
Language: | English |
Published: |
2016
|
Subjects: | |
Online Access: | http://irep.iium.edu.my/51765/1/51765_Distance_based_Sweep_Nearest_Algorithm.pdf http://irep.iium.edu.my/51765/ http://www.icetss.org/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A variant fisher and Jaikuamr algorithm to solve capacitated vehicle routing problem
by: Sultana, Tanzima, et al.
Published: (2017) -
A farthest insertion heuristic algorithm for the distance-constrained capacitated vehicle routing problem
by: Chai, Jin Sian, et al.
Published: (2015) -
Ant colony optimization algorithm for distance-constrained capacitated vehicle routing problem
by: Johar, Farhana, et al.
Published: (2018) -
Nearest greedy for solving the waste collection vehicle routing problem: A case study
by: Mat, Nur Azriati, et al.
Published: (2017) -
Solving vehicle routing problem by using improved K-nearest neighbor algorithm for best solution
by: Mohammed, Mazin Abed, et al.
Published: (2017)