Announcement for Downloading full text filePlease respect the Copyright Act.
All digital full text dissertation and theses from this website are authorized the copyright owners. These copyrighted full-text dissertation and theses can be only used for academic, research and non-commercial purposes. Users of this website can search, read, and print for personal usage. In respect of the Copyright Act of the Republic of China, please do not reproduce, distribute, change, or edit the content of these dissertations and theses without any permission. Please do not create any work based upon a pre-existing work by reproduction, Adaptation, Distribution or other means.
URN etd-0810111-142236 Statistics This thesis had been viewed 1520 times. Download 92 times. Author Mei Chen Author's Email Address No Public. Department Information Management Year 2010 Semester 2 Degree Master Type of Document Master's Thesis Language Chinese&English Page Count 90 Title A hybrid PSO algorithm for the CVRP problem Keyword Simulated Annealing Vehicle Routing Problem Particle Swarm Optimization Particle Swarm Optimization Vehicle Routing Problem Simulated Annealing Abstract The Capacitated Vehicle Routing Problem (CVRP) has been studied over five decades. The goal of CVRP is to minimize the total distance of the routes under the constraints of vehicles’ capacity. Because CVRP is one kind of NP-hard problems, a number of meta-heuristics have been proposed to solve the problem. This paper proposes a hybrid algorithm combining Combinatorial Particle Swarm Optimization (CPSO) with Simulated Annealing (SA) to solve the CVRP. The experimental results show that the proposed algorithm is an effective approach for solving the CVRP. Advisor Committee Yucheng Kao - advisor
Files Date of Defense 2011-06-15 Date of Submission 2011-08-10