| Summary |
Yunn-Jia Chou,2007.06
Department of Transportation Technology and Management National Chiao Tung University
Under the highly competitive circumstance, providing good quality service is the core value of all freight transportation companies. An effective routing plan for pickup and delivery is the most important part contributing to reducing fuel consumption and operation costs. The purpose of this research is proposing an efficient solution algorithm for a real world pickup and delivery problem with time window constraints while minimizing the total vehicles used.
This research adopts Genetic Algorithm for solving the pickup and delivery problem with time windows constraints. The goal is minimizing the total traveling distance and the degree of violating time windows constraints. Ten testing cases with different sizes are generated for testing purpose. We also conduct sensitivity analysis for various factors, such as population, vehicle numbers, vehicle capacity, mutation rate, mutation percentage, penalty weights, and stopping rules. Our testing results show that the proposed algorithm is efficient and sound. |
