| Autor: |
Ezugwu AE; School of Mathematics, Statistics and Computer Science, University of Kwazulu-Natal, Durban, South Africa.; Department of Computer Science, Federal University Lafia, Lafia, Nasarawa State, Nigeria., Akutsah F; School of Mathematics, Statistics and Computer Science, University of Kwazulu-Natal, Durban, South Africa., Olusanya MO; School of Mathematics, Statistics and Computer Science, University of Kwazulu-Natal, Durban, South Africa., Adewumi AO; School of Mathematics, Statistics and Computer Science, University of Kwazulu-Natal, Durban, South Africa. |
| Abstrakt: |
The intelligent water drop algorithm is a swarm-based metaheuristic algorithm, inspired by the characteristics of water drops in the river and the environmental changes resulting from the action of the flowing river. Since its appearance as an alternative stochastic optimization method, the algorithm has found applications in solving a wide range of combinatorial and functional optimization problems. This paper presents an improved intelligent water drop algorithm for solving multi-depot vehicle routing problems. A simulated annealing algorithm was introduced into the proposed algorithm as a local search metaheuristic to prevent the intelligent water drop algorithm from getting trapped into local minima and also improve its solution quality. In addition, some of the potential problematic issues associated with using simulated annealing that include high computational runtime and exponential calculation of the probability of acceptance criteria, are investigated. The exponential calculation of the probability of acceptance criteria for the simulated annealing based techniques is computationally expensive. Therefore, in order to maximize the performance of the intelligent water drop algorithm using simulated annealing, a better way of calculating the probability of acceptance criteria is considered. The performance of the proposed hybrid algorithm is evaluated by using 33 standard test problems, with the results obtained compared with the solutions offered by four well-known techniques from the subject literature. Experimental results and statistical tests show that the new method possesses outstanding performance in terms of solution quality and runtime consumed. In addition, the proposed algorithm is suitable for solving large-scale problems. |
