Facebook pixel tracking

The Science and Information (SAI) Organization publishes open-access peer-reviewed journals in computer science and artificial intelligence.

Contact Info
Website thesai.org
Follow Us
Contact Info
Follow Us
Research Article | Open Access |

Enhanced Ant Colony Optimization for Capacitated Vehicle Routing Problem with Time Windows in Franchise Distribution

Author 1: Dian Rachmawati Author 2: Tommy Lohil Author 3: Jos Timanta Tarigan
International Journal of Advanced Computer Science and Applications (IJACSA) · Vol. 17, No. 2 · Published 2026

DOI: 10.14569/IJACSA.2026.01702103

Abstract

Efficient routing for distributing goods to multiple franchisee locations requires optimization techniques capable of handling vehicle capacity limits, heterogeneous time windows, and operational constraints, making conventional brute-force or map-based approaches infeasible due to the NP-hard nature of the problem. This study presents an enhanced Ant Colony Optimization (ACO) algorithm for solving the Capacitated Vehicle Routing Problem with Time Windows (CVRPTW) in a franchisor–franchisee logistics setting. The proposed enhancement incorporates feasibility filtering to enforce capacity and time-window constraints during route construction and adaptive pheromone updating to improve convergence stability. Using real franchisee coordinates, demand values, and operational time windows, the experiments configured with α = 2, β = 1, ρ = 0.05, and a 150-iteration limit demonstrate that the enhanced ACO achieves a minimum total route distance of 46.90 km with zero variance across 10 simulations, indicating highly stable convergence. Comparative evaluation shows that the enhanced ACO improves route efficiency by 11.4% compared to standard ACO and 15.2% relative to a representative Genetic Algorithm baseline. Implemented in a web-based environment using JavaScript for visualization and Java for computation, the approach provides a practical decision-support tool for Indonesian franchise logistics. The algorithm exhibits an observed computational complexity of θ(n4), making it suitable for small to medium-scale distribution networks involving strict delivery time windows.

Keywords

How to Cite this Article

Rachmawati, D., Lohil, T., & Tarigan, J. T. (2026). Enhanced Ant Colony Optimization for Capacitated Vehicle Routing Problem with Time Windows in Franchise Distribution. International Journal of Advanced Computer Science and Applications, 17(2). https://doi.org/10.14569/IJACSA.2026.01702103

Rachmawati, Dian, et al.. "Enhanced Ant Colony Optimization for Capacitated Vehicle Routing Problem with Time Windows in Franchise Distribution." International Journal of Advanced Computer Science and Applications, vol. 17, no. 2, 2026, https://doi.org/10.14569/IJACSA.2026.01702103.

@article{Rachmawati2026,
  title     = {Enhanced Ant Colony Optimization for Capacitated Vehicle Routing Problem with Time Windows in Franchise Distribution},
  journal   = {International Journal of Advanced Computer Science and Applications},
  volume    = {17},
  number    = {2},
  year      = {2026},
  publisher = {The Science and Information Organization},
  author    = {Dian Rachmawati and Tommy Lohil and Jos Timanta Tarigan},
  doi       = {10.14569/IJACSA.2026.01702103},
  url       = {https://doi.org/10.14569/IJACSA.2026.01702103}
}

Open Access — licensed under a Creative Commons Attribution 4.0 International License. Unrestricted use, distribution, and reproduction in any medium, even commercially, as long as the original work is properly cited.

Call for Papers - Important Dates

Volume 17 No. 12, December 2026
Paper Submission Due November 25, 2026
Review Notification December 15, 2026
Publication Date December 31, 2026