| Summary: | 碩士 === 國立屏東科技大學 === 資訊管理系所 === 105 === The concept of Vehicle Routing Problem (VRP) first appears in military logistics to solve the transmission of information and supplies in battlefield. It had become research interests to the experts and scholars afterwards. The Capacitated Open Vehicle Routing Problem (COVRP) is an extension of VRP; it has provided companies deal with logistics and transportation, reducing the huge cost in vehicles, labor and time during these years. Based on the Particle Swarm Optimization, this thesis adopts the “multi-directional search strategy” to improve search capability of the best solution. In order to sort out a non-crossed path quickly, this thesis proposed “Loop 2-opt” reducing the 2-opt implementation times greatly. The computational results showed that our proposed algorithm can find the 45 solutions of 68 tested instances as the best-known solutions.
|
|---|
