A probability matrix-based Discrete Bacterial Foraging Optimization for Capacity Vehicle Routing Problems
| Autor: | Chih-chung Lin, 林志忠 |
|---|---|
| Rok vydání: | 2016 |
| Druh dokumentu: | 學位論文 ; thesis |
| Popis: | 104 Vehicle routing problem (VRP) becomes more important in the distribution industry. Capacitated vehicle routing problems (CVRP) are a combinatorial optimization problem. It has been proved that CVRP is an NP-hard problem. Therefore it is hard to find optimal solutions for large-sized problems. This paper proposes a Discrete Bacterial Foraging Optimization with Probability Matrix (DBFOMAT) approach to solve the CVRP. The proposed approach uses a probability matrix as the main mechanism for solution matrix decoding. The algorithm first uses DBFO for assigning customers to routes and then uses probability matrices to arrange customer visiting sequences for each vehicle. This approach also uses another probability matrix to memorize customer sequences, which are used to guide customer sequencing in next iteration. The experimental results show that the proposed algorithm is an effective approach for solving the CVRP. |
| Databáze: | Networked Digital Library of Theses & Dissertations |
| Externí odkaz: |
|