Solution to vehicle routing problem with time window based on modified particle swarm optimization

• Main Authors: Ming-Hui Ho, 何銘輝
• Other Authors: Hsuan-Ming Feng
• Format: Others
• Language: zh-TW
• Published: 2013
• Online Access: http://ndltd.ncl.edu.tw/handle/00235499772254922261

碩士 === 國立金門大學 === 電子工程學系碩士班 === 101 === 　　The vehicle routing problem applied in such fields as the flow of goods , factory scheduling and management has been widely researched by scholars, and is gradually put to practical use in our daily life. Therefore, it is of great value to find solutions to the vehicle routing problems so as to lower costs. 　　This paper proposes the particle swarm optimization (PSO) to solve the vehicle routing problem with time windows(VRPTW) , and hybrid genetic algorithm (GA) and hill-climbing Algorithm (HC) characteristics of particle expression to construct the vehicle routing problemmethod, and the establishment of the particle swarm algorithm for this problem. The simulation results show that the particle swarm algorithm can quickly and effectively obtain the optimal solution of the vehicle routing problem with time windows, is a better solution for solving the vehicle routing problem with time window.