A Hybrid Genetic Algorithm for the Traveling Salesman Problem with Pickup and Delivery

In this paper, a hybrid genetic algorithm (GA) is proposed for the traveling salesman problem (TSP) with pickup and delivery (TSPPD) In our algorithm, a novel pheromone-based crossover operator is advanced that utilizes both local and global information to construct offspring In addition, a local search procedure is integrated into the GA to accelerate convergence The proposed GA has been tested on benchmark instances, and the computational results show that it gives better convergence than existing heuristics.