Genetic algorithm for the one-commodity pickup-and-delivery vehicle routing problem

摘要

A new variant of classical VRP, called 1-PDVRP, is introduced in this paper. It differs from the general VRP with pickup and delivery in that the commodity provided by the pickup customers is the same as that needed by delivery customers. We established the mathematical model for 1-PDVRP, and utilized genetic algorithm to solve it. In the proposed genetic algorithm, we implemented a pheromone-based crossover operator for this problem and the algorithm is tested on 100 randomly generated instances.