首頁 > 網路資源 > 大同大學數位論文系統

Title page for etd-0810111-142236


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 indicate in-campus access immediately and off-campus access at 5 years
    Date of Defense 2011-06-15 Date of Submission 2011-08-10


    Browse | Search All Available ETDs