Abstract
Vehicle Routing Problem (VRP) is one of critical problems in modern logistics service. In order to overcome the shortcomings of the basic Ant Colony Optimization (ACO) algorithm, which has long searching time and easily jumps into local optimal solution, a hybrid behavior ACO algorithm is presented for solving the VRP problem. A series of rules of the ants' behaviors are defined. The simulation results show that the above approach is reasonable and efficient.
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.
