Geography Department, Dezhou University, Dezhou, Shandong 253023, China

---

Abstract—The Multi-Depot Vehicle Routing Problem (MDVRP) is a generalization of SDVRP, in which multiple vehicles start from multiple depots and return to their original depots at the end of their assigned tours. The MDVRP is NP-hard, therefore, the development of heuristic algorithms for this problem class is of primary interest. This paper solves Multi-Depot Vehicle Routing Problem with Cellular Ant Algorithm which is a new optimization method for solving real problems by using both the evolutionary rule of cellular, graph theory and the characteristics of ant colony optimization. The simulation experiment shows that the Cellular Ant Algorithm is feasible and effective for the MDVRP. The clarity and simplicity of the Cellular Ant Algorithm is greatly enhanced to ant colony optimization.

Index Terms—Multi-Depot Vehicle Routing Problem (MDVRP), Cellular Ant Algorithm, Graph theory

[PDF]

Cite: Yuanzhi Wang, " Research of Multi-Depot Vehicle Routing Problem by Cellular Ant Algorithm," Journal of Computers vol. 8, no. 7, pp. 1722-1727, 2013.