Particle Swarm Optimization for the Minimum Cost Vertex-Disjoint Path Cover Problem
碩士 === 國立臺灣科技大學 === 工業管理系 === 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 th...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2016
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/mzbyun |