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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
