doi: 10.4304/jsw.8.6.1339-1345
Constraint Cellular Ant Algorithm for the Multi- Objective Vehicle Routing Problem
Abstract—Constraint Cellular ant algorithm is a new optimization method for solving real problems by using both constraints method, the evolutionary rule of cellular, graph theory and the characteristics of ant colony optimization. Multi-objective vehicle routing problem is very important and practical in logistic research fields, but it is difficult to model and solve because objectives have complicated relationship and restriction. Constraint Cellular ant algorithm has more obvious advantages to solve such kind of combinatorial optimization problems than many other algorithms. The test results show that the constraint cellular ant algorithm is feasible and effective for the MOVRP. The clarity and simplicity of the constraint cellular ant algorithm is greatly enhanced to ant colony optimization.
Index Terms—Constraint cellular ant algorithm, Graph theory, Multi-objective, Vehicle routing problem.
Cite: Yuanzhi Wang, "Constraint Cellular Ant Algorithm for the Multi- Objective Vehicle Routing Problem," Journal of Software vol. 8, no. 6, pp. 1339-1345, 2013.
General Information
ISSN: 1796-217X (Online)
Abbreviated Title: J. Softw.
Frequency: Biannually
APC: 500USD
DOI: 10.17706/JSW
Editor-in-Chief: Prof. Antanas Verikas
Executive Editor: Ms. Cecilia Xie
Google Scholar, ProQuest,
INSPEC(IET), ULRICH's Periodicals
Directory, WorldCat, etcE-mail: jsweditorialoffice@gmail.com
-
Mar 07, 2025 News!
Vol 19, No 4 has been published with online version [Click]
-
Mar 07, 2025 News!
JSW had implemented online submission system [Click]
-
Apr 01, 2024 News!
Vol 14, No 4- Vol 14, No 12 has been indexed by IET-(Inspec) [Click]
-
Apr 01, 2024 News!
Papers published in JSW Vol 18, No 1- Vol 18, No 6 have been indexed by DBLP [Click]
-
Oct 22, 2024 News!
Vol 19, No 3 has been published with online version [Click]