Abstract
In this paper, we present an algorithm based on Ant Colony Algorithm (ACA) to solve the capacitated vehicle routing problem (CVRP) with simultaneous delivery task in a spatial network. The ant colony algorithm is an algorithm for finding optimal paths that is based on the behavior of ants searching for food. Simulated ants are used to construct a solution for CVRP by pheromone information from previously solutions. We develop an iterative algorithm to model the problem and an extensive numerical experiment is performed on simulated problem. It is found that ACA gives good results for CVRP.
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 callMore From: DEStech Transactions on Social Science, Education and Human Science
Disclaimer: 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.
