Abstract: A Capacitated Vehicle Routing Problem (CVRP) is an important problem in transportation and industry. It is challenging to be solved using some optimization algorithms. Unfortunately, it is not easy to achieve a global optimum solution. Hence, many researchers use a combination of two or more optimization algorithms, which based on swarm intelligence methods, to overcome the drawbacks of the single algorithm. In this research, a CVRP optimization model, which contains two main processes of clustering and optimization, based on a discrete hybrid evolutionary firefly algorithm (DHEFA), is proposed. Some evaluations on three CVRP cases show that DHEFA produces an averaged effectiveness of 91.74%, which is much more effective than the original FA that gives mean effectiveness of 87.95%. This result shows that clustering nodes into several clusters effectively reduces the problem space, and the DHEFA quickly searches the optimum solution in those partial spaces.

Ubassy Abdillah and Suyanto Suyanto, “Clustering Nodes and Discretizing Movement to Increase the Effectiveness of HEFA for a CVRP” International Journal of Advanced Computer Science and Applications(IJACSA), 11(4), 2020. http://dx.doi.org/10.14569/IJACSA.2020.01104100

@article{Abdillah2020,
title = {Clustering Nodes and Discretizing Movement to Increase the Effectiveness of HEFA for a CVRP},
journal = {International Journal of Advanced Computer Science and Applications},
doi = {10.14569/IJACSA.2020.01104100},
url = {http://dx.doi.org/10.14569/IJACSA.2020.01104100},
year = {2020},
publisher = {The Science and Information Organization},
volume = {11},
number = {4},
author = {Ubassy Abdillah and Suyanto Suyanto}
}