Pickup and Delivery Traveling Salesman Problem with Traffic Conditions

Abstract

This paper deals with the pickup and delivery traveling salesman problem with traffic conditions (PDTSPTC), 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. The PDTSPTC concerns more parameters, such as street network and vehicle speed, which results it closer to the real world condition. The paper also proposes the new developed genetic algorithm called “Hybrid Encoding Genetic Algorithm (HEGA)”. The concept is to combine binary encoding and integer encoding together, causing the incomplexity of the algorithm structure and the ease of implementation. The main advantage of this new algorithm is the improvement of overall system efficiency.