Particle Swarm Optimization for the Minimum Cost Vertex-Disjoint Path Cover Problem

• Main Authors: Indri Claudia Magdalena Marpaung, 麥依林
• Other Authors: Vincent F. Yu
• Format: Others
• Language: en_US
• Published: 2016
• Online Access: http://ndltd.ncl.edu.tw/handle/mzbyun

碩士 === 國立臺灣科技大學 === 工業管理系 === 104 === In the minimum cost vertex–disjoint path cover problem (MCVDPCP), each vehicle serves customers directly from its location without having to start from or return to a depot. The aim of the MCVDPCP is to minimize the total vehicle travel cost without violating the vehicle capacity constraint and the maximum tour length. An application of the problem can be found in companies hiring freelance workers to serve customers to reduce operational costs. In this study, we propose a particle swarm optimization algorithm for solving the MCVDPCP with an aim at obtaining better results than the previous study.