:::
Trans. Planning Journal
| Title | A Particle Swarm Optimization Solution Approach for the Multi-Compartment Vehicle Routing Problem |
|---|---|
| Author | Anthony F. Han, Yu-Ching Chu and Jhih-Syuan Lin |
| Summary | Multi-compartment vehicle routing problem (MCVRP) is a variant of the conventional vehicle routing problem (VRP). The MCVRP considers multiple products to be delivered, and each product must load on a specific compartment in the vehicle. The problem considers two cases for customer delivery, “no split” and “split”, depending on if the multiple products are allowed to be split among multiple routes.We applied the particle swarm optimization (PSO) metaheuristic approach to solve the MCVRP. Two new solution representation methods were designed to generate and evolve the particles for both the no-split and split cases respectively. A variable neighborhood descent (VND) module with an innovative (1, 0)* node-interchange operator was built to improve the quantity of particles during its evolution process. Two sets of benchmark instances for MCVRP were adopted to test the proposed PSO metaheuristic method. Results showed that the PSO method is very competitive as compared to the best algorithms published in the MCVRP literature. Out of the 80 benchmark instances tested, the PSO found 16, and improved 34 best known solutions. |
| Vol. | 45 |
| No. | 2 |
| Page | 101 |
| Year | 2016 |
| Month | 6 |
Count Views:490