Application of ant colony algorithm reduced costs and distances in logistics for a textile company, suggesting improved efficiency.
The shortest path problem is algorithmic and involves finding the least costly path (in terms of distance, time, cost, or other criteria) between two nodes in a graph. This problem is fundamental in graph theory and has applications in logistics, networks, mapping, and more. Several methods have been used to solve this problem. In this paper, we applied the ant colony algorithm to optimize the travel path of product quality technicians in a textile company specializing in washing and dyeing denim items. The company aims to minimize distances and costs between its subcontractors. The method has demonstrated a significant impact on distance and cost reduction while contributing to the reduction of the environmental effects.
No takes yet. Share an insight, caveat, or question.
Lahdhiri et al. (2025) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: