A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem
We address in this paper the one-commodity pickup-and-delivery traveling salesman problem, which is characterized by a set of customers, each of them supplying (pickup customer) or demanding (delivery customer) a given amount of a single product. The objective is to design a minimum cost Hamiltonian route for a capacitated vehicle in order to transport the product from the pickup to the delivery customers. The vehicle starts the route from a depot, and its initial load also has to be determined. We propose a hybrid algorithm that combines the GRASP and VND metaheuristics. Our heuristic is compared with other approximate algorithms described in Hernndez-Prez and Salazar-Gonzlez [Heuristics for the one-commodity pickup-and-delivery traveling salesman problem. Transportation Science 2004;38:24555]. Computational experiments on benchmark instances reveal that our hybrid method yields better results than the previously proposed approaches.
grasp vnd traveling salesman problem pickup and delivery hybrid heuristic