2 articles for “Capacitated Vehicle Routing Problem (CVRP)”

Set a search alert

Research ArticleOpen accessIn the keywordsOptimization of Capacitated Vehicle Routing Problem by Nested Particle Swarm OptimizationKaruppusamy Kanthavel, Paruchuri PrasadProblem statement: Vehicle routing problem determines the optimum route for each vehicle as a sequence of visiting cities. The problem has been defined as NP-hard and exact solution is relatively difficult to achieve for real time large scale models. Though several attempts to solve the problem were made in the literature, new approaches may be tried to solve the problem … …American Journal of Applied Sciences, Vol. 8, Issue 2 · 28 Feb 2011 · 7,978 accessesView PDF Cite

Research ArticleOpen accessIn the abstractAnt Colony Optimization for Capacitated Vehicle Routing ProblemW. F. Tan, L. S. Lee, Z. A. Majid, H. V. SeowProblem statement: The Capacitated Vehicle Routing Problem (CVRP) is a well-known combinatorial optimization problem which is concerned with the distribution of goods between the depot and customers. It is of economic importance to businesses as approximately 10-20% of the final cost of the goods is contributed by the transportation process. Approach: This problem was tackled using an Ant Colony Optimization … …Journal of Computer Science, Vol. 8, Issue 6 · 15 Mar 2012 · 10,043 accessesView PDF Cite