A randomized multi-start genetic algorithm for the one-commodity Pickup-and-Delivery traveling salesman problem

Abstract

The One-Commodity Pickup-and-Delivery Traveling Salesman Problem (1-PDTSP) is a generalization of the standard travelling salesman problem. 1-PDTSP is to design an optimal tour that minimizes the overall travelled distance through the depot and a set of customers. Each customer requires either a pickup service or a delivery service. We propose a Randomized Multi-start Genetic Algorithm (RM-GA) to solve the 1-PDTSP. Experimental investigations show that the proposed algorithm is competitive against state-of-the-art methods.