| Summary: | 碩士 === 國立虎尾科技大學 === 工業工程與管理研究所 === 98 === The Vehicle Routing Problem with Time Windows (VRPTW) is an extension of the Vehicle Routing Problem (VRP). It has become an important research and the application field in recent years. This thesis studies the optimal disinfection operations problem which is similar to the well known contained vehicle capacity with time windows. This problem is arranged an optimal route with minimal cost. The studied disinfection operations problem is one of the vehicle routing problems with time windows, however, it is different to the traditional VRPTW since each node of the studied disinfection operations problem has to receive multiple various services (various liquid medicines) to disinfect various insects and bacteria. In addition, for safety, the interval times of spray of different liquid medicines should be up to given periods.
Due to its high computational complexity, VRPTW is a NP-hard problem. Typical mathematical programming approaches are time expensive for finding the optimal solution of VRPTW. Therefore, in practice, heuristics are proposed to solve VRPTW.
These main purposes of this thesis are multiple. Firstly, we propose three heuristic algorithms, including Immune Algorithm, Genetic Algorithm and Particle Swarm Optimization for solving the proposed disinfection operations problem. Secondly, based upon NFU campus, we solve for the optimal disinfection strategy and routs with single vehicle and multiple vehicles, respectively. Numerical results show that Immune Algorithm performs better than Genetic Algorithm and Particle Swarm Optimization.
|
|---|
