Emergency Logistics Routing Optimization Algorithm Based on FSACO.
ABSTRACT Emergency logistics routing problem, which is premise with the time requirements for emergency logistics and aims at maximum saving delivery time for relief supplies, is a reasonable arrangement of vehicles to run routes. According to the characteristics of time which emergency logistics emphasis on, the delivery route optimization model which the number of delivery vehicles less than demand areas is been established, besides, it has been solved by the Fish-Swarm Ant Colony Optimization (FSACO). Simulation results show that the algorithm compared with ant colony algorithm has better optimization quality.
- SourceAvailable from: psu.edu[Show abstract] [Hide abstract]
ABSTRACT: This paper introduces the ant colony system (ACS), a distributed algorithm that is applied to the traveling salesman problem (TSP). In the ACS, a set of cooperating agents called ants cooperate to find good solutions to TSPs. Ants cooperate using an indirect form of communication mediated by a pheromone they deposit on the edges of the TSP graph while building solutions. We study the ACS by running experiments to understand its operation. The results show that the ACS outperforms other nature-inspired algorithms such as simulated annealing and evolutionary computation, and we conclude comparing ACS-3-opt, a version of the ACS augmented with a local search procedure, to some of the best performing algorithms for symmetric and asymmetric TSPsIEEE Transactions on Evolutionary Computation 05/1997; · 4.81 Impact Factor