Journal of Computer Science

Application of Hybrid Encoding Genetic Algorithm on Pickup and Delivery Traveling Salesman Problem with Traffic Conditions

Supat Patvichaichod

DOI : 10.3844/jcssp.2011.605.610

Journal of Computer Science

Volume 7, Issue 5

Pages 605-610


Problem statement: This study deals with the pickup and delivery traveling salesman problem with traffic conditions (PDTSPTW), an extension of the pickup and delivery traveling salesman problem (PDTSP) where each customer to be served is associated with two quantities of product to be collected and delivered. Almost PDTSP problems uses distance between each point of customers as Euclidean Distance and are not concerned with other parameters to find minimal cost. Approach: The PDTSPTC concerns more parameters, such as street network and vehicle speed, which results it closer to the real world condition. The study also proposes the developed genetic algorithm called “Hybrid Encoding Genetic Algorithm (HEGA)”. The concept is to combine binary encoding and integer encoding together, causing the in complexity of the algorithm structure and the ease of implementation. Results: the HEGA can save the travel cost about 26-57%. It is obviously seen that HEGA in the PDTSPTC test problems result the fast convergence that is about 12-43% and in all, the computational time is under 6 seconds. Conclusion: The HEGA performs quite well when testing a test problem. Computation times are small in all case. The PDTSPTC is closer to real-world conditions than PDTSP. This problem can be applied in logistics immediately if the distance of streets, traffic conditions (average vehicle speed in each street) and vehicle conditions (fuel consumption rate and vehicle capacity) are known.


© 2011 Supat Patvichaichod. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.