Improved Ant Colony Algorithm for Solving multi-deport Open Vehicle Routing Problem with Fuzzy Time Window

In response to Multi-Deport Open Vehicle Routing Problem (MDOVRP) subject to time window constraints, we employed trapezoidal fuzzy numbers to fuzzified the time windows. Building upon the definitions of customer satisfaction functions and time penalty cost functions, we established a robust optimization model. Assuming the existence of virtual distribution centers under the holistic approach, we designed an enhanced ant colony algorithm for solving the problem, and selected suitable test cases for validation and analysis. Experimental results demonstrate that the proposed algorithm is capable of obtaining satisfactory solutions and represents an effective approach for addressing such issues. The model we constructed is suitable for scenarios involving multiple centers, multiple demand points, and an open system, showing both reasonability and effectiveness. In comparison to soft and hard time window configurations, the use of fuzzy time windows is both reasonable and effective, concurrently illustrating the impact of fuzzy time window settings on customer satisfaction and model solutions.