Solving route optimisation problem in logistics distribution through an improved ant colony optimisation algorithm

Solving route optimisation problem in logistics distribution through an improved ant colony optimisation algorithm

0.00 Avg rating0 Votes
Article ID: iaor2017273
Volume: 8
Issue: 3
Start Page Number: 218
End Page Number: 230
Publication Date: Jan 2017
Journal: International Journal of Services Operations and Informatics
Authors:
Keywords: combinatorial optimization, heuristics: ant systems, distribution, heuristics: genetic algorithms
Abstract:

In this paper, aiming at conventional Ant Colony algorithm's defects and shortcomings, we introduce Genetic Algorithm to improve it. By the GA's reproduction, crossover and mutation operators, the ACA's convergence rate and global searching ability have a significant improvement. Besides, we improve the updating mode of pheromone to enhance the adaptability of ants, the ACA can automatic adjust pheromone residual degree when executing the algorithm for convergence. Besides, introducing a new deterministic searching method will accelerate the heuristic searching method rate. After the description of our improved algorithm, we do two groups of experiments, the results show that our proposed algorithm has a good effect on solving logistics distribution routing optimisation problem, compared with the conventional algorithm, our experiments are on large logistics distribution route sets, the results show that our improved algorithm can get the optimal solution rapidly and accurately, the results are more robust than conventional results.

Reviews

Required fields are marked *. Your email address will not be published.