A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem

Authors:
Hipólito Hernández-Pérez;Inmaculada Rodríguez-Martín;Juan José Salazar-González
Affiliations:
DEIOC, Facultad de Matemáticas, Universidad de La Laguna, 38271 La Laguna, Tenerife, Spain;DEIOC, Facultad de Matemáticas, Universidad de La Laguna, 38271 La Laguna, Tenerife, Spain;DEIOC, Facultad de Matemáticas, Universidad de La Laguna, 38271 La Laguna, Tenerife, Spain
Venue:
Computers and Operations Research
Year:
2009

Citing 5
Cited 2

Variable neighborhood search

Computers and Operations Research
Approximating Capacitated Routing and Delivery Problems

SIAM Journal on Computing
Heuristics for the One-Commodity Pickup-and-Delivery Traveling Salesman Problem

Transportation Science
A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery

Discrete Applied Mathematics - The fourth international colloquium on graphs and optimisation (GO-IV)
The one-commodity pickup and delivery travelling salesman problem on a path or a tree

Networks

Solving the one-commodity pickup and delivery problem using an adaptive hybrid VNS/SA approach

PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part II
A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem

Journal of Heuristics

Quantified Score

Hi-index	0.01

Visualization

Abstract

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 Hernandez-Perez and Salazar-Gonzalez [Heuristics for the one-commodity pickup-and-delivery traveling salesman problem. Transportation Science 2004;38:245-55]. Computational experiments on benchmark instances reveal that our hybrid method yields better results than the previously proposed approaches.